Multirelations with infinite computations
DOI10.1016/J.JLAP.2014.02.008zbMATH Open1371.68172OpenAlexW1999807337WikidataQ128988520 ScholiaQ128988520MaRDI QIDQ406449FDOQ406449
Authors: 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
Recommendations
- Modelling angelic and demonic nondeterminism with multirelations
- Relational formalisations of compositions and liftings of multirelations
- Theory and Applications of Relational Structures as Knowledge Instruments
- Monotone Predicate Transformers as Up-Closed Multirelations
- Kleisli, Parikh and Peleg compositions and liftings for multirelations
Symbolic computation and algebraic computation (68W30) Semantics in the theory of computing (68Q55) Cylindric and polyadic algebras; relation algebras (03G15)
Cites Work
- Title not available (Why is that?)
- Refinement Calculus
- Title not available (Why is that?)
- Unifying lazy and strict computations
- Relational mathematics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebras for iteration and infinite computations
- Modelling angelic and demonic nondeterminism with multirelations
- General correctness: A unification of partial and total correctness
- Ordnungen, Verbände und Relationen mit Anwendungen
- Programs, Recursion and Unbounded Choice
- Title not available (Why is that?)
- Monotone Predicate Transformers as Up-Closed Multirelations
- Fixpoints for general correctness
- Ternary Boolean algebra
- A ternary operation in distributive lattices
- Symmetric quotients and domain constructions
- Theory and Applications of Relational Structures as Knowledge Instruments
- Partiality. I: Embedding relation algebras
- Angelic nondeterminism in the unifying theories of programming
Cited In (11)
- Dependences between domain constructions in heterogeneous relation algebras
- Kleisli, Parikh and Peleg compositions and liftings for multirelations
- Monotone Predicate Transformers as Up-Closed Multirelations
- A relation-algebraic approach to multirelations and predicate transformers
- Column-wise extendible vector expressions and the relational computation of sets of sets
- Relational formalisations of compositions and liftings of multirelations
- Relational computation of sets of relations
- Computations and Relational Bundles
- Infinite executions of lazy and strict computations
- An algebraic approach to multirelations and their properties
- Modelling angelic and demonic nondeterminism with multirelations
Uses Software
This page was built for publication: Multirelations with infinite computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406449)
