Completeness of a relational calculus for program schemes

DOI10.1016/S0304-3975(99)00343-6zbMath0974.68110OpenAlexW2044353968MaRDI QIDQ5940932

No author found.

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00343-6

zbMATH Keywords

completenessprojection functionsrecursive program schemesrelational calculus

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cites Work

• Varieties of relation algebras
• Relation algebras and Schröder categories
• Some sufficient conditions for the representability of relation algebras
• Relational Methods in Computer Science
• Boolean Algebras with Operators
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Completeness of a relational calculus for program schemes