Computation by interaction for space-bounded functional programming
From MaRDI portal
(Redirected from Publication:276265)
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
- 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
- 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?)
- Light types for polynomial time computation in lambda calculus
- Linear logic
- LOGSPACE and PTIME characterized by programming languages
- 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
(15)- Recursion and dynamic data-structures in bounded space: towards embedded ML programming
- The complexity of interaction
- Higher-order functional reactive programming in bounded space
- Haskell in Space
- Functional programming in sublinear space
- Space-Efficient Computation by Interaction
- The dynamic geometry of interaction machine: a token-guided graph rewriter
- scientific article; zbMATH DE number 7561616 (Why is no real title available?)
- Programming Languages and Systems
- Implicit computation complexity in higher-order programming languages
- Reasonable space for the -calculus, logarithmically
- Tropical mathematics and the lambda-calculus I: metric and differential analysis of effectful programs
- A characterization of basic feasible functionals through higher-order rewriting and tuple interpretations
- (Definitely not) boring interaction abstract machines
- Reasonable space for the -calculus, logarithmically
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)
