Semantics of Higher-Order Recursion Schemes

DOI10.1007/978-3-642-03741-2_5zbMath1239.68041arXiv1101.4929OpenAlexW2120834341MaRDI QIDQ5891582

Stefan Milius, Jiří Adámek, Jiří Velebil

Publication date: 1 June 2012

Published in: Logical Methods in Computer Science, Algebra and Coalgebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.4929

zbMATH Keywords

higher-order recursion schemesrational treeinfinite \(\lambda \)-termssets in context

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Presheaves and sheaves, stacks, descent conditions (category-theoretic aspects) (18F20) Combinatory logic and lambda calculus (03B40)

Related Items

Unnamed Item ⋮ Recursive Program Schemes and Context-Free Monads ⋮ On second-order iterative monads ⋮ Elgot theories: a new perspective on the equational properties of iteration ⋮ Iterative reflections of monads ⋮ On algebras with effectful iteration ⋮ A New Foundation for Finitary Corecursion ⋮ A new foundation for finitary corecursion and iterative algebras

Cites Work

• Unnamed Item
• Substitution in non-wellfounded syntax with variable binding
• The category-theoretic solution of recursive program schemes
• Algebraic semantics
• On the monadicity of finitary monads
• Program schemes, recursion schemes, and formal languages
• Completely iterative algebras and completely iterative monads
• Iterative algebras at work
• A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata

This page was built for publication: Semantics of Higher-Order Recursion Schemes