WRS 2008 Reduction Strategies in Rewriting and Programming 8 th International Workshop

Abstract

In this paper we discuss and compare abstract machines for the lambda-calculus, implementing various evaluation strategies. Starting from the well-known Categorical abstract machine (CAM) and Krivine’s abstract machine (KAM), we develop two families of machines that differ in the way they treat environments. The first family is inspired by the work on closed reduction strategies, whereas the second is built in the spirit of the jumping machines based on the work done on Linear Logic

22 Figures and Tables

Cite this paper

@inproceedings{Middeldorp2008WRS2R, title={WRS 2008 Reduction Strategies in Rewriting and Programming 8 th International Workshop}, author={Aart Middeldorp and Elvira Albert and Temur Kutsia and Oana Andrei and Paul Brauner and Samir Genaim and R{\'e}my Haemmerl{\'e} and Martin Korp and Naoki Nishida and Miguel Palomino and Yann Radenac and Ren{\'e} Thiemann and Christian Urban and Maribel Fern{\'a}ndez and Nikolaos Siafakas}, year={2008} }