Relation algebraic domain constructions
From MaRDI portal
Publication:1177156
DOI10.1016/0304-3975(91)90030-6zbMath0741.68074OpenAlexW1973038184MaRDI QIDQ1177156
Publication date: 26 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(91)90030-6
Semantics in the theory of computing (68Q55) Representation theory of lattices (06B15) Cylindric and polyadic algebras; relation algebras (03G15)
Related Items (11)
Relation Algebras, Matrices, and Multi-valued Decision Diagrams ⋮ A Relation Algebraic Semantics for a Lazy Functional Logic Language ⋮ Dependences between domain constructions in heterogeneous relation algebras ⋮ Towards a formal framework for heterogeneous relation algebra ⋮ Relational matching for graphical calculi of relations ⋮ Monomorphic characterization of \(n\)-ary direct products ⋮ A relation algebraic approach to interaction categories ⋮ Products in categories of relations ⋮ Embedding mappings and splittings with applications ⋮ Cardinality of relations with applications ⋮ Weak \(n\)-ary relational products in allegories
Uses Software
Cites Work
- The largest Cartesian closed category of domains
- Varieties of relation algebras
- Relation algebras: Concept of points and representability
- Relational algebraic semantics of deterministic and nondeterministic programs
- Programs as partial graphs. I: Flow equivalence and correctness
- LCF considered as a programming language
- Can programming be liberated from the von Neumann style?
- Relations binaires, fermetures, correspondances de Galois
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Relation algebraic domain constructions
