Multirelations with infinite computations

DOI10.1016/j.jlap.2014.02.008zbMath1371.68172OpenAlexW1999807337WikidataQ128988520 ScholiaQ128988520MaRDI QIDQ406449

Walter Guttmann

Publication date: 8 September 2014

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2014.02.008

zbMATH Keywords

relationsmedianapproximation orderprogram semanticsmultirelationsRelViewsequential computations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semantics in the theory of computing (68Q55) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (5)

A Relation-Algebraic Approach to Multirelations and Predicate Transformers ⋮ Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of Sets ⋮ Dependences between domain constructions in heterogeneous relation algebras ⋮ Relational computation of sets of relations ⋮ An algebraic approach to multirelations and their properties

Uses Software

• RelView

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixpoints for general correctness
• Symmetric quotients and domain constructions
• Algebras for iteration and infinite computations
• Partiality. I: Embedding relation algebras
• Angelic nondeterminism in the unifying theories of programming
• Modelling angelic and demonic nondeterminism with multirelations
• General correctness: A unification of partial and total correctness
• Unifying Lazy and Strict Computations
• Ordnungen, Verbände und Relationen mit Anwendungen
• Programs, Recursion and Unbounded Choice
• Refinement Calculus
• Monotone Predicate Transformers as Up-Closed Multirelations
• Ternary Boolean algebra
• A ternary operation in distributive lattices
• Theory and Applications of Relational Structures as Knowledge Instruments

This page was built for publication: Multirelations with infinite computations