A functional correspondence between evaluators and abstract machines. Ager, M. S., Biernacki, D., Danvy, O., & Midtgaard, J. ACM, New York, New York, USA, 2003.
abstract   bibtex   
We bridge the gap between functional evaluators and abstract machines for the λ-calculus, using closure conversion, transformation into continuation-passing style, and defunctionalization. We illustrate this approach by deriving Krivine's abstract machine from an ordinary call-by-name evaluator and by deriving an ordinary call-by-value evaluator from Felleisen et al.'s CEK machine. The first derivation is strikingly simpler than what can be found in the literature. The second one is new. Together, they show that Krivine's abstract …
@Book{Ager2003,
author = {Ager, Mads Sig and Biernacki, Dariusz and Danvy, Olivier and Midtgaard, Jan}, 
title = {A functional correspondence between evaluators and abstract machines}, 
volume = {}, 
pages = {8-19}, 
editor = {}, 
publisher = {ACM}, 
address = {New York, New York, USA}, 
year = {2003}, 
abstract = {We bridge the gap between functional evaluators and abstract machines for the λ-calculus, using closure conversion, transformation into continuation-passing style, and defunctionalization. We illustrate this approach by deriving Krivine\'s abstract machine from an ordinary call-by-name evaluator and by deriving an ordinary call-by-value evaluator from Felleisen et al.\'s CEK machine. The first derivation is strikingly simpler than what can be found in the literature. The second one is new. Together, they show that Krivine\'s abstract …}, 
keywords = {}}

Downloads: 0