Reasonable space for the -calculus, logarithmically
From MaRDI portal
Publication:6649482
DOI10.1145/3531130.3533362MaRDI QIDQ6649482FDOQ6649482
Authors: Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni 
Publication date: 6 December 2024
Recommendations
Cites Work
- A provable time and space efficient implementation of NESL
- Full abstraction for PCF
- LOGSPACE and PTIME characterized by programming languages
- Computation by interaction for space-bounded functional programming
- Higher-order functional reactive programming in bounded space
- Geometry of synthesis: a structured approach to VLSI design
- Functional programming in sublinear space
- Space-Efficient Computation by Interaction
- Title not available (Why is that?)
- Title not available (Why is that?)
- An abstract machine for strong call by value
- Improving the lazy Krivine machine
- Deriving a lazy abstract machine
- A call-by-name lambda-calculus machine
- On the correctness of the Krivine machine
- Distilling abstract machines
- The problem of space invariance for sequential machines
- On the invariance of the unitary cost model for head reduction
- On randomised strategies in the \(\lambda \)-calculus
- An implicit characterization of PSPACE
- Simple parsimonious types and logarithmic space
- (Leftmost-outermost) beta reduction is invariant, indeed
- On the value of variables
- The next 700 Krivine machines
- Turing machines for dummies. Why representations do matter
- Space profiling for parallel functional programs
- The Negligible and Yet Subtle Cost of Pattern Matching
Cited In (1)
This page was built for publication: Reasonable space for the \(\lambda \)-calculus, logarithmically
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649482)
