Article

Higher-Order and Symbolic Computation

, Volume 20, Issue 3, pp 209-230

First online:

Strongly reducing variants of the Krivine abstract machine

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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 normalization Abstract machines