Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell

DOI10.1007/11828563_16MaRDI QIDQ5459185zbMATH OpenOpenAlexFDO

Authors Wolfram Kahl

Publication date 24 April 2008

Published in Relations and Kleene Algebra in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11828563_16

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types
• scientific article; zbMATH DE number 1543343
• Implementing relational specifications in a constraint functional logic language
• Algebra of programming in Agda: Dependent types for relational program derivation
• scientific article; zbMATH DE number 1086633

Cited in

(5)

• Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
• Implementing relational specifications in a constraint functional logic language
• Simple rectangle-based functional programs for computing reflexive-transitive closures
• Using relations to develop a Haskell program for computing maximum bipartite matchings
• Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types

Describes a project that uses

Uses Software

• RelView
• Haskell

This page was built for publication: Semigroupoid Interfaces for Relation-Algebraic Programming in Haskell

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459185)