Reasonable space for the \(\lambda \)-calculus, logarithmically

DOI10.1145/3531130.3533362MaRDI QIDQ6649482

Gabriele Vanoni, Beniamino Accattoli, Ugo Dal Lago

Publication date: 6 December 2024

zbMATH Keywords

complexitylambda-calculusabstract machines

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Combinatory logic and lambda calculus (03B40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computation by interaction for space-bounded functional programming
• The problem of space invariance for sequential machines
• LOGSPACE and PTIME characterized by programming languages
• Full abstraction for PCF
• On randomised strategies in the \(\lambda \)-calculus
• An abstract machine for strong call by value
• On the value of variables
• Improving the lazy Krivine machine
• The next 700 Krivine machines
• A call-by-name lambda-calculus machine
• On the correctness of the Krivine machine
• (Leftmost-outermost) beta reduction is invariant, indeed
• A provable time and space efficient implementation of NESL
• Distilling abstract machines
• Turing Machines for Dummies
• Higher-order functional reactive programming in bounded space
• An Implicit Characterization of PSPACE
• Space profiling for parallel functional programs
• Geometry of synthesis
• Functional Programming in Sublinear Space
• Space-Efficient Computation by Interaction
• Deriving a lazy abstract machine
• The Negligible and Yet Subtle Cost of Pattern Matching
• Simple Parsimonious Types and Logarithmic Space

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)