Fixpoint approach to the theory of computation
From MaRDI portal
Publication:5657655
DOI10.1145/361454.361460zbMATH Open0245.68011OpenAlexW2090767487MaRDI QIDQ5657655FDOQ5657655
Authors: 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
Cited In (17)
- Title not available (Why is that?)
- A mathematical semantics for a nondeterministic typed lambda-calculus
- The congruence of two programming language definitions
- Characterizing programming systems allowing program self-reference
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- On the fixpoints of monogenic functions in free monoids
- A survey of state vectors
- On the completeness of the inductive assertion method
- Algebraic correctness proofs for compiling recursive function definitions with strictness information
- Infinite trees in normal form and recursive equations having a unique solution
- Least fixed points revisited
- Title not available (Why is that?)
- Fixed-point constructions in order-enriched categories
- Title not available (Why is that?)
- Caratterizzazione dei reticoli continui per la teoria della computazione di Dana Scott
- On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics
- Program development schemata as derived rules
This page was built for publication: Fixpoint approach to the theory of computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5657655)
