Fixpoint approach to the theory of computation

DOI10.1145/361454.361460zbMath0245.68011OpenAlexW2090767487MaRDI QIDQ5657655

Zohar Manna, Jean E. Vuillemin

Publication date: 1972

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/361454.361460

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (17)

Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics ⋮ A mathematical semantics for a nondeterministic typed lambda-calculus ⋮ The congruence of two programming language definitions ⋮ A survey of state vectors ⋮ On the fixpoints of monogenic functions in free monoids ⋮ Infinite trees in normal form and recursive equations having a unique solution ⋮ Unnamed Item ⋮ Least fixed points revisited ⋮ Algebraic correctness proofs for compiling recursive function definitions with strictness information ⋮ On the completeness of the inductive assertion method ⋮ Characterizing programming systems allowing program self-reference ⋮ Fixed-point constructions in order-enriched categories ⋮ Program development schemata as derived rules ⋮ Caratterizzazione dei reticoli continui per la teoria della computazione di Dana Scott

This page was built for publication: Fixpoint approach to the theory of computation