Least fixed points revisited

DOI10.1016/0304-3975(76)90031-1zbMath0348.68013OpenAlexW2176037827WikidataQ56092889 ScholiaQ56092889MaRDI QIDQ1234588

J. W. de Bakker

Publication date: 1976

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(76)90031-1

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (4)

Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Unnamed Item ⋮ Algebraic correctness proofs for compiling recursive function definitions with strictness information ⋮ Expressive power of typed and type-free programming languages

Cites Work

• On the completeness of the inductive assertion method
• Inductive methods for proving properties of programs
• Another recursion induction principle
• Fixpoint approach to the theory of computation
• Tree-Manipulating Systems and Church-Rosser Theorems
• The Mechanical Evaluation of Expressions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Least fixed points revisited