Projects per year
Abstract
Extending the λ-calculus with a construct for sharing, such as let expressions, enables a special representation of terms: iterated applications are decomposed by introducing sharing points in between any two of them, reducing to the case where applications have only values as immediate subterms. This work studies how such a crumbled representation of terms impacts on the design and the efficiency of abstract machines for call-by-value evaluation. About the design, it removes the need for data structures encoding the evaluation context, such as the applicative stack and the dump, that get encoded in the environment. About efficiency, we show that there is no slowdown, clarifying in particular a point raised by Kennedy, about the potential inefficiency of such a representation. Moreover, we prove that everything smoothly scales up to the delicate case of open terms, needed to implement proof assistants. Along the way, we also point out that continuation-passing style transformations - that may be alternatives to our representation - do not scale up to the open case.
Original language | English |
---|---|
Title of host publication | Proceedings of the 21st International Symposium on Principles and Practice of Declarative Programming, PPDP 2019 |
Subtitle of host publication | Porto, Portugal, October 7-9, 2019 |
Publisher | Association for Computing Machinery |
Pages | 4:1-4:15 |
Number of pages | 15 |
ISBN (Electronic) | 9781450372497 |
DOIs | |
Publication status | Published - 7 Oct 2019 |
Event | 21st International Symposium on Principles and Practice of Declarative Programming, PPDP 2019 - Porto, Portugal Duration: 7 Oct 2019 → 9 Oct 2019 |
Publication series
Name | ACM International Conference Proceeding Series |
---|
Conference
Conference | 21st International Symposium on Principles and Practice of Declarative Programming, PPDP 2019 |
---|---|
Country/Territory | Portugal |
City | Porto |
Period | 7/10/19 → 9/10/19 |
Funding
Acknowledgments. This work has been partially funded by the ANR JCJC grant COCA HOLA (ANR-16-CE40-004-01) and by the EPSRC grant EP/R029121/1 “Typed Lambda-Calculi with Sharing and Unsharing”.
Keywords
- Abstract machine
- Complexity
- Explicit substitution
- Lambda-calculus
ASJC Scopus subject areas
- Human-Computer Interaction
- Computer Networks and Communications
- Computer Vision and Pattern Recognition
- Software
Fingerprint
Dive into the research topics of 'Crumbling Abstract Machines'. Together they form a unique fingerprint.Projects
- 1 Finished
-
Typed Lambda-Calculi with Sharing and Unsharing
Heijltjes, W. (PI)
Engineering and Physical Sciences Research Council
1/01/19 → 30/07/22
Project: Research council