Recursion-closed algebraic theories

DOI10.1016/0022-0000(81)90006-4zbMath0472.68006OpenAlexW2066192277MaRDI QIDQ1157899

Jean H. Gallier

Publication date: 1981

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(81)90006-4

zbMATH Keywords

recursion schemefixed- point semanticsrational algebraic theoriesrational theory

Mathematics Subject Classification ID

Theories (e.g., algebraic theories), structure, and semantics (18C10) General topics in the theory of software (68N01) Categories of machines, automata (18B20)

Related Items (8)

Equivalences and transformations of regular systems - applications to recursive program schemes and grammars ⋮ Algebraic solutions to recursion schemes ⋮ Unnamed Item ⋮ The equational logic of fixed points ⋮ DPDA's in 'Atomic normal form' and applications to equivalence problems ⋮ Algebraic characterization of reducible flowcharts ⋮ Implementation of data types by algebraic methods ⋮ Fundamental properties of infinite trees

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
• On the role of memory in object-based and object-oriented languages
• Metric interpretations of infinite trees and semantics of non deterministic recursive programs
• Unique fixed points vs. least fixed points
• Varieties of chain-complete algebras
• DPDA's in 'Atomic normal form' and applications to equivalence problems
• Regular trees and the free iterative theory
• Theory of program structures: Schemes, semantics, verification
• A representation of trees by languages. I
• Fixed-point constructions in order-enriched categories
• On homomorphisms, correctness, termination, unfoldments, and equivalence of flow diagram programs
• Infinite trees in normal form and recursive equations having a unique solution
• Semantics of computation
• Data Types as Lattices
• Initial Algebra Semantics and Continuous Algebras
• Algebraic automata and context-free sets
• Automata in general algebras
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES

This page was built for publication: Recursion-closed algebraic theories