Unifying Recursion in Partial, Total and General Correctness
From MaRDI portal
Publication:3055748
DOI10.1007/978-3-642-16690-7_10zbMath1309.68046OpenAlexW1667913537MaRDI QIDQ3055748
Publication date: 9 November 2010
Published in: Unifying Theories of Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-16690-7_10
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (5)
An algebraic approach to computations with progress ⋮ Unifying Lazy and Strict Computations ⋮ Fixpoints for general correctness ⋮ Algebras for iteration and infinite computations ⋮ Infinite executions of lazy and strict computations
This page was built for publication: Unifying Recursion in Partial, Total and General Correctness