Abstract
Can the λ-calculus be considered a reasonable computational model? Can we use it for measuring the time and space consumption of algorithms? While the literature contains positive answers about time, much less is known about space. This paper presents a new reasonable space cost model for the λ-calculus, based on a variant over the Krivine abstract machine. For the first time, this cost model is able to accommodate logarithmic space. Moreover, we study the time behavior of our machine, which is unreasonable but it can be turned into a reasonable one using known techniques. Finally, we show how to transport our results to the call-by-value λ-calculus.
| Original language | English |
|---|---|
| Pages (from-to) | 15:1-15:57 |
| Journal | Logical Methods in Computer Science |
| Volume | 20 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1 Oct 2024 |
Keywords
- abstract machines
- complexity
- lambda-calculus
- space