On rational definitions in complete algebras without rank

DOI10.1016/0304-3975(82)90078-0zbMath0498.68017OpenAlexW2082112816MaRDI QIDQ1171374

Klaus Indermark

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90078-0

zbMATH Keywords

infinite treesrational operationsalgebraic theory of programmingalgebras without rankrational schemesrecursion on higher functional domainsregular and equational normal forms of rational schemesregular equations with parameterstyped combinators

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)

Related Items (2)

Unnamed Item ⋮ Separately continuous algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Programming languages and their definition. Selected papers ed. by C. B. Jones
• The IO- and OI-hierarchies
• The common algebraic structure of exit-automata and machines
• Initial Algebra Semantics and Continuous Algebras
• Algebraic automata and context-free sets
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Automata in general algebras
• A Perspective View of Discrete Automata and Their Design
• Beitrag zur Aerodynamik eines schwingenden Gitters II (Unterschallströmung)

This page was built for publication: On rational definitions in complete algebras without rank