The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions
- 1 April 1982
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 29 (2) , 577-602
- https://doi.org/10.1145/322307.322325
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Partially-additive monoids, graph-growing, and the algebraic semantics of recursive callsPublished by Springer Nature ,2005
- Partially additive categories and flow-diagram semanticsJournal of Algebra, 1980
- Can programming be liberated from the von Neumann style?Communications of the ACM, 1978
- Initial Algebra Semantics and Continuous AlgebrasJournal of the ACM, 1977
- On the completeness of the inductive assertion methodJournal of Computer and System Sciences, 1975
- Guarded commands, nondeterminacy and formal derivation of programsCommunications of the ACM, 1975
- Monadic Computation And Iterative Algebraic TheoriesPublished by Elsevier ,1975
- Simple Program Schemes and Formal LanguagesLecture Notes in Computer Science, 1974
- Decidable Properties of Monadic Functional SchemasJournal of the ACM, 1973
- Two Families of Languages Related to ALGOLJournal of the ACM, 1962