Computation by interaction for space-bounded functional programming
DOI10.1016/J.IC.2015.04.006zbMATH Open1339.68038OpenAlexW2186736595MaRDI QIDQ276265FDOQ276265
Authors: Ugo Dal Lago, Ulrich Schöpp 
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
Recommendations
- Functional programming in sublinear space
- Space-Efficient Computation by Interaction
- Higher-order functional reactive programming in bounded space
- scientific article; zbMATH DE number 1332639
- Implicit self-adjusting computation for purely functional programs
- Implicit self-adjusting computation for purely functional programs
- From functional programs to interaction nets via the rewriting calculus
- scientific article; zbMATH DE number 1670486
- Relativized alternation and space-bounded computation
functional programmingimplicit computational complexitylogarithmic spacegeometry of interactiontype system
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Functional programming and lambda calculus (68N18)
Cites Work
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- 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
- Logspace without bounds
- Geometry of synthesis: a structured approach to VLSI design
- Data streams: algorithms and applications.
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geometry of Interaction and linear combinatory algebras
- Traced monoidal categories
- Title not available (Why is that?)
- Geometry of synthesis III
- Programming Languages and Systems
- Title not available (Why is that?)
- Ramified Corecurrence and Logspace
Cited In (11)
- Title not available (Why is that?)
- The dynamic geometry of interaction machine: a token-guided graph rewriter
- Implicit computation complexity in higher-order programming languages
- The complexity of interaction
- Recursion and dynamic data-structures in bounded space: towards embedded ML programming
- Functional programming in sublinear space
- Haskell in Space
- Reasonable space for the \(\lambda \)-calculus, logarithmically
- Programming Languages and Systems
- Higher-order functional reactive programming in bounded space
- Space-Efficient Computation by Interaction
This page was built for publication: Computation by interaction for space-bounded functional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q276265)
