Computation by interaction for space-bounded functional programming

DOI10.1016/J.IC.2015.04.006MaRDI QIDQ276265zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

functional programmingimplicit computational complexitylogarithmic spacegeometry of interactiontype system

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3751225 (Why is no real title available?)
• scientific article; zbMATH DE number 42059 (Why is no real title available?)
• scientific article; zbMATH DE number 176523 (Why is no real title available?)
• scientific article; zbMATH DE number 4123722 (Why is no real title available?)
• scientific article; zbMATH DE number 1254648 (Why is no real title available?)
• scientific article; zbMATH DE number 1954368 (Why is no real title available?)
• scientific article; zbMATH DE number 1393359 (Why is no real title available?)
• scientific article; zbMATH DE number 2242599 (Why is no real title available?)
• A modified GoI interpretation for a linear functional programming language and its adequacy
• A note on logspace optimization
• Bounded linear logic: A modular approach to polynomial-time computability
• Data streams: algorithms and applications.
• Enriching an Effect Calculus with Linear Types
• Full abstraction for PCF
• Functional programming in sublinear space
• Functorial Boxes in String Diagrams
• Geometry of Interaction and linear combinatory algebras
• Geometry of synthesis III
• Geometry of synthesis: a structured approach to VLSI design
• LOGSPACE and PTIME characterized by programming languages
• Light types for polynomial time computation in lambda calculus
• Linear logic
• Logspace without bounds
• On full abstraction for PCF: I, II and III
• On the relation of interaction semantics to continuations and defunctionalization
• On traced monoidal closed categories
• Problems complete for deterministic logarithmic space
• Programming Languages and Systems
• Ramified Corecurrence and Logspace
• Some Programming Languages for Logspace and Ptime
• The expressive power of higher-order types or, life without CONS
• Traced monoidal categories

Cited in

(11)

• Functional programming in sublinear space
• Haskell in Space
• Implicit computation complexity in higher-order programming languages
• Space-Efficient Computation by Interaction
• scientific article; zbMATH DE number 7561616 (Why is no real title available?)
• Reasonable space for the \(\lambda \)-calculus, logarithmically
• The complexity of interaction
• Recursion and dynamic data-structures in bounded space: towards embedded ML programming
• The dynamic geometry of interaction machine: a token-guided graph rewriter
• Higher-order functional reactive programming in bounded space
• Programming Languages and Systems

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)