Relational semigroupoids: abstract relation-algebraic interfaces for finite relations between infinite types
DOI10.1016/j.jlap.2007.10.008zbMath1139.18005OpenAlexW1975831115MaRDI QIDQ929967
Publication date: 19 June 2008
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2007.10.008
direct productsHaskellfunctional programmingdeterminacyrestricted residualsfinite relationssemigroupoids
Functional programming and lambda calculus (68N18) Structure theory of algebraic structures (08A05) Cylindric and polyadic algebras; relation algebras (03G15) Discrete mathematics in relation to computer science (68R99) Groupoids, semigroupoids, semigroups, groups (viewed as categories) (18B40) Categories of spans/cospans, relations, or partial maps (18B10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Categories as algebra: An essential ingredient in the theory of monoids
- A completeness theorem for Kleene algebras and the algebra of regular events
- Characterizing determinacy in Kleene algebras
- Automatic semigroups and categories.
- Graph-Based Algorithms for Boolean Function Manipulation
- The B-Book
- Demonic operators and monotype factors
- Relational Methods in Computer Science
- PROFINITE METHODS IN SEMIGROUP THEORY
- Kleene algebra with domain
- Computer Aided Verification
- Relations binaires, fermetures, correspondances de Galois
- Relational Methods in Computer Science