The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions

DOI10.1145/322307.322325zbMath0478.68016OpenAlexW2018561559MaRDI QIDQ3936172

Michael A. Arbib, Ernest G. Manes

Publication date: 1982

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

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

zbMATH Keywords

program transformationrecursive definitionsproofs of correctnesspartially-additive semanticsabstract recursion schemesinterpretive semantics of a recursively defined program

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (10)

Algebraic solutions to recursion schemes ⋮ Unnamed Item ⋮ Partially additive categories and flow-diagram semantics ⋮ Retracing some paths in process algebra ⋮ A class of fuzzy theories ⋮ Towards a geometry of recursion ⋮ Unnamed Item ⋮ Tensor product of partially-additive monoids ⋮ The inverse semigroup of a sum-ordered semiring ⋮ Labelled Markov Processes as Generalised Stochastic Relations

This page was built for publication: The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions