Higher-Order and Symbolic Computation

, Volume 20, Issue 3, pp 209–230

Strongly reducing variants of the Krivine abstract machine

Authors

Article

DOI: 10.1007/s10990-007-9015-z

Cite this article as:
Crégut, P. Higher-Order Symb Comput (2007) 20: 209. doi:10.1007/s10990-007-9015-z

Abstract

We present two variants of the Krivine abstract machine that reduce lambda-terms to full normal form. We give a proof of their correctness by interpreting their behaviour in the λσ-calculus.

Keywords

Strong normalizationAbstract machines

Copyright information

© Springer Science+Business Media, LLC 2007