Computation by interaction for space-bounded functional programming
From MaRDI portal
Publication:276265
DOI10.1016/j.ic.2015.04.006zbMath1339.68038OpenAlexW2186736595MaRDI QIDQ276265
Publication date: 3 May 2016
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.04.006
functional programmingtype systemlogarithmic spaceimplicit computational complexitygeometry of interaction
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear logic
- Light types for polynomial time computation in lambda calculus
- Bounded linear logic: A modular approach to polynomial-time computability
- LOGSPACE and PTIME characterized by programming languages
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- A note on logspace optimization
- The expressive power of higher-order types or, life without CONS
- On the Relation of Interaction Semantics to Continuations and Defunctionalization
- A Modified GoI Interpretation for a Linear Functional Programming Language and Its Adequacy
- Geometry of synthesis
- Functional Programming in Sublinear Space
- Functorial Boxes in String Diagrams
- Some Programming Languages for Logspace and Ptime
- On traced monoidal closed categories
- Enriching an Effect Calculus with Linear Types
- Problems complete for deterministic logarithmic space
- Geometry of Interaction and linear combinatory algebras
- Traced monoidal categories
- Geometry of synthesis III
- Programming Languages and Systems
- Ramified Corecurrence and Logspace
