Towards a geometry of recursion
From MaRDI portal
Publication:534710
DOI10.1016/j.tcs.2010.12.024zbMath1222.03068OpenAlexW2023311579MaRDI QIDQ534710
Publication date: 10 May 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.024
recursiongeometry of interactionfixed-point operatorstraced categoriesunique decomposition categories
Logic in computer science (03B70) Categorical logic, topoi (03G30) Proof-theoretic aspects of linear logic and other substructural logics (03F52) General topics in the theory of algorithms (68W01)
Cites Work
- The inverse semigroup of a sum-ordered semiring
- A categorical model for the geometry of interaction
- Algebraically compact functors
- New foundations for the geometry of interaction
- Head linear reduction and pure proof net extraction
- Glueing and orthogonality for models of linear logic
- The geometry of linear higher-order recursion
- Context semantics, linear logic, and computational complexity
- The formal language of recursion
- The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive Definitions
- Applying dispersion correction to numerical approximations of the two‐dimensional wave equation ‐ eigenproblems
- Unique decomposition categories, Geometry of Interaction and combinatory logic
- Geometry of Interaction and linear combinatory algebras
- Traced monoidal categories
- Computer Science Logic
- Retracing some paths in process algebra
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Towards a geometry of recursion