Unifying lazy and strict computations
From MaRDI portal
Recommendations
Cites work
- A completeness theorem for Kleene algebras and the algebra of regular events
- A relation algebraic model of robust correctness
- Algebras for iteration and infinite computations
- An algebra of hybrid systems
- Fixpoints for general correctness
- scientific article; zbMATH DE number 1612485 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 1487470 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- Imperative abstractions for functional actions
- Internal axioms for domain semirings
- Kleene algebra with domain
- Kleene getting lazy
- Partial, total and general correctness
- Reasoning algebraically about loops
- Relation-algebraic semantics
- Towards a refinement algebra
- Unifying correctness statements
- Unifying Recursion in Partial, Total and General Correctness
- Unifying theories for logic programming
- Unifying theories of programming that distinguish nontermination and abort
Cited in
(11)- Delaying unification algorithms for lambda calculi
- Infinite executions of lazy and strict computations
- An algebraic approach to computations with progress
- scientific article; zbMATH DE number 1810493 (Why is no real title available?)
- Lazy Relations
- Lazy UTP
- Multirelations with infinite computations
- Hopscotch -- reaching the target hop by hop
- Imperative abstractions for functional actions
- Algebras for iteration and infinite computations
- Algebras for Iteration, Infinite Executions and Correctness of Sequential Computations
This page was built for publication: Unifying lazy and strict computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915133)