|
Descripción
|
|
|---|---|
| We derive by program transformation Pierre Crégut's full-reducing Krivine machine KN from the structural operational semantics of the normal order reduction strategy in a closure-converted pure lambda calculus. We thus establish the correspondence between the strategy and the machine, and showcase our technique for deriving full-reducing abstract machines. Actually, the machine we obtain is a slightly optimised version that can work with open terms and may be used in implementations of proof assistants. | |
|
Internacional
|
Si |
|
Nombre congreso
|
15th International Symposium on Principles and Practices of Declarative Programming |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
Madrid |
|
Revisores
|
Si |
|
ISBN o ISSN
|
978-14-5032-154-9 |
|
DOI
|
10.1145/2505879.2505887 |
|
Fecha inicio congreso
|
16/09/2013 |
|
Fecha fin congreso
|
18/09/2013 |
|
Desde la página
|
85 |
|
Hasta la página
|
96 |
|
Título de las actas
|
PPDP '13 Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming |