Algebraic solutions to recursion schemes
From MaRDI portal
Publication:1098617
DOI10.1016/0022-0000(87)90020-1zbMath0637.68018OpenAlexW2037503821MaRDI QIDQ1098617
Irène Guessarian, David B. Benson
Publication date: 1987
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(87)90020-1
fixed pointsdenotational semanticsabstract data typestree algebrasrecursion schemescongruence on trees
Specification and verification (program logics, model checking, etc.) (68Q60) Applications of computability and recursion theory (03D80)
Related Items (4)
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Unnamed Item ⋮ Linearization in parallel pCRL ⋮ Equivalence of recursive specifications in process algebra
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative algebras
- All solutions of a system of recursion equations in infinite trees and other contraction theories
- Fundamental properties of infinite trees
- Algebra of communicating processes with abstraction
- Parameter passing in nondeterministic recursive programs
- Metric interpretations of infinite trees and semantics of non deterministic recursive programs
- Unique fixed points vs. least fixed points
- On the algebra of order
- Varieties of chain-complete algebras
- Recursion-closed algebraic theories
- Tree constructions of free continuous algebras
- The IO- and OI-hierarchies
- Corrigendum to ``DPDA's in ``atomic normal form and applications to equivalence problems
- Regular trees and the free iterative theory
- Natural state transformations
- The existence and construction of free iterative theories
- Varieties of ordered algebras
- IO and OI. II
- Fixed points in free process algebras. I
- n-Rational Algebras I. Basic Properties and Free Algebras
- Functional behavior of nondeterministic and concurrent programs
- On the relationships between Scott domains, synchronization trees, and metric spaces
- Algebraic laws for nondeterminism and concurrency
- Acceptance trees
- Algebraic specification of data types: A synthetic approach
- The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions
- Completions of Partially Ordered Sets
- A Powerdomain Construction
- Initial Algebra Semantics and Continuous Algebras
- Tree-Manipulating Systems and Church-Rosser Theorems
This page was built for publication: Algebraic solutions to recursion schemes
