Fixpoint approach to the theory of computation
From MaRDI portal
Publication:5657655
DOI10.1145/361454.361460zbMath0245.68011MaRDI 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
68Q25: Analysis of algorithms and problem complexity
Related Items
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars, A mathematical semantics for a nondeterministic typed lambda-calculus, The congruence of two programming language definitions, On the fixpoints of monogenic functions in free monoids, Least fixed points revisited, On the completeness of the inductive assertion method, 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, Algebraic correctness proofs for compiling recursive function definitions with strictness information, Infinite trees in normal form and recursive equations having a unique solution, Unnamed Item, Unnamed Item