Abstract
This paper formalizes and proves correct a compilation scheme for mutually-recursive definitions in call-by-value functional languages. This scheme supports a wider range of recursive definitions than standard call-by-value recursive definitions. We formalize our technique as a translation scheme to a lambda-calculus featuring in-place update of memory blocks, and prove the translation to be faithful.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Fifth ACM SIGPLAN Conference on Principle and Practice of Declarative Programming, (PPDP 03) |
| Pages | 160-171 |
| Number of pages | 12 |
| Volume | 5 |
| Publication status | Published - 2003 |
| Event | 2003 ACM SIGPLAN Workshop on Erlang - Uppsala, Sweden Duration: 29 Aug 2003 → 29 Aug 2003 |
Conference
| Conference | 2003 ACM SIGPLAN Workshop on Erlang |
|---|---|
| Abbreviated title | ERLANG '03 |
| Country/Territory | Sweden |
| City | Uppsala |
| Period | 29/08/03 → 29/08/03 |
Keywords
- Compilation
- Functional languages
- Recursion
- Semantics