Semantics of Higher-Order Recursion Schemes

Higher-order recursion schemes are recursive equations defining new operations from given ones called "terminals". Every such recursion scheme is proved to have a least interpreted semantics in every Scott's model of \lambda-calculus in which the terminals are interpreted as continuou...

Full description

Bibliographic Details
Published in:	Logical Methods in Computer Science
Main Authors:	Jiri Adamek, Stefan Milius, Jiri Velebil
Format:	Article
Language:	English
Published:	Logical Methods in Computer Science e.V. 2011-04-01
Subjects:	computer science - logic in computer science mathematics - category theory math.ct
Online Access:	https://lmcs.episciences.org/1177/pdf

Similar Items

Weak omega-categories from intensional type theory
by: Peter LeFanu Lumsdaine
Published: (2010-09-01)

Elgot Algebras
by: Jiri Adamek, et al.
Published: (2006-11-01)

Well-Pointed Coalgebras
by: Jiří Adámek, et al.
Published: (2013-08-01)

Abstract GSOS Rules and a Modular Treatment of Recursive Definitions
by: Stefan Milius, et al.
Published: (2013-09-01)

Positive fragments of coalgebraic logics
by: Adriana Balan, et al.
Published: (2015-09-01)

Extending set functors to generalised metric spaces
by: Adriana Balan, et al.
Published: (2019-01-01)

Algebraic coherent confluence and higher globular Kleene algebras
by: Cameron Calk, et al.
Published: (2022-11-01)

Globular: an online proof assistant for higher-dimensional rewriting
by: Krzysztof Bar, et al.
Published: (2018-01-01)

Cartesian closed 2-categories and permutation equivalence in higher-order rewriting
by: Tom Hirschowitz
Published: (2013-09-01)

Corecursive Algebras, Corecursive Monads and Bloom Monads
by: Jiří Adámek, et al.
Published: (2014-09-01)

A Categorical Approach to Syntactic Monoids
by: Jiří Adamek, et al.
Published: (2018-05-01)

Decidable Expansions of Labelled Linear Orderings
by: Alexis Bes, et al.
Published: (2011-05-01)

A categorical semantics for causal structure
by: Aleks Kissinger, et al.
Published: (2019-08-01)

Many-valued coalgebraic logic over semi-primal varieties
by: Alexander Kurz, et al.
Published: (2024-07-01)

Stabilized profunctors and stable species of structures
by: Marcelo Fiore, et al.
Published: (2024-02-01)

Arboreal Categories: An Axiomatic Theory of Resources
by: Samson Abramsky, et al.
Published: (2023-08-01)

Converse extensionality and apartness
by: Benno van den Berg, et al.
Published: (2022-12-01)

Quantitative Equality in Substructural Logic via Lipschitz Doctrines
by: Francesco Dagnino, et al.
Published: (2025-01-01)

The Formal Theory of Monads, Univalently
by: Niels van der Weide
Published: (2025-02-01)

On The Axioms Of $\mathcal{M},\mathcal{N}$-Adhesive Categories
by: Davide Castelnovo, et al.
Published: (2025-03-01)

Rewriting for Symmetric Monoidal Categories with Commutative (Co)Monoid Structure
by: Aleksandar Milosavljevic, et al.
Published: (2025-01-01)

From Kleisli Categories to Commutative C*-algebras: Probabilistic Gelfand Duality
by: Robert W. J. Furber, et al.
Published: (2015-06-01)

Stream processors and comodels
by: Richard Garner
Published: (2023-01-01)

Monoidal Width
by: Elena Di Lavore, et al.
Published: (2023-09-01)

Cartesian Difference Categories
by: Mario Alvarez-Picallo, et al.
Published: (2021-09-01)

LNL polycategories and doctrines of linear logic
by: Michael Shulman
Published: (2023-04-01)

Concurrent Process Histories and Resource Transducers
by: Chad Nester
Published: (2023-01-01)

On the Termination Problem for Probabilistic Higher-Order Recursive Programs
by: Naoki Kobayashi, et al.
Published: (2020-10-01)

Using models to model-check recursive schemes
by: Sylvain Salvati, et al.
Published: (2015-06-01)

Recursion Schemes, the MSO Logic, and the U quantifier
by: Paweł Parys
Published: (2020-02-01)

Defining Recursive Predicates in Graph Orders
by: Ramanathan S. Thinniyam
Published: (2018-09-01)

Co-c.e. spheres and cells in computable metric spaces
by: Zvonko Iljazovic
Published: (2011-08-01)

Strongly Complete Logics for Coalgebras
by: Alexander Kurz, et al.
Published: (2012-09-01)

Monads need not be endofunctors
by: Thosten Altenkirch, et al.
Published: (2015-03-01)

LNL-FPC: The Linear/Non-linear Fixpoint Calculus
by: Bert Lindenhovius, et al.
Published: (2021-04-01)

When is a container a comonad?
by: Danel Ahman, et al.
Published: (2014-09-01)

A Categorical Reconstruction of Quantum Theory
by: Sean Tull
Published: (2020-01-01)

Extensional Semantics for Higher-Order Logic Programs with Negation
by: Panos Rondogiannis, et al.
Published: (2018-06-01)

Relation lifting, with an application to the many-valued cover modality
by: Marta Bilkova, et al.
Published: (2013-10-01)

The categorical contours of the Chomsky-Sch\"utzenberger representation theorem
by: Paul-André Melliès, et al.
Published: (2025-05-01)