Unifying Lazy and Strict Computations

DOI10.1007/978-3-642-33314-9_2zbMath1330.68074OpenAlexW67633796WikidataQ128988539 ScholiaQ128988539MaRDI QIDQ2915133

Walter Guttmann

Publication date: 21 September 2012

Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33314-9_2

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (5)

An algebraic approach to computations with progress ⋮ Multirelations with infinite computations ⋮ Hopscotch -- reaching the target hop by hop ⋮ Algebras for iteration and infinite computations ⋮ Infinite executions of lazy and strict computations

Uses Software

• Isabelle
• Isabelle/HOL

Cites Work

• Fixpoints for general correctness
• Imperative abstractions for functional actions
• Internal axioms for domain semirings
• Algebras for iteration and infinite computations
• Kleene getting lazy
• An algebra of hybrid systems
• Reasoning algebraically about loops
• A completeness theorem for Kleene algebras and the algebra of regular events
• A relation algebraic model of robust correctness
• Relation-algebraic semantics
• Towards a refinement algebra
• Unifying Correctness Statements
• Unifying Recursion in Partial, Total and General Correctness
• Partial, Total and General Correctness
• Unifying Theories of Programming That Distinguish Nontermination and Abort
• Kleene algebra with domain
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unifying Lazy and Strict Computations