Higher-Order and Symbolic Computation

, Volume 20, Issue 3, pp 295–318

The graphical Krivine machine


DOI: 10.1007/s10990-007-9011-3

Cite this article as:
Lippi, S. Higher-Order Symb Comput (2007) 20: 295. doi:10.1007/s10990-007-9011-3


We present a natural implementation of the Krivine machine in interaction nets: one rule for each transition and the usual rules for duplication and erasing. There is only one rule devoted to the so-called administration. This way, we obtain a graphical system encoding λ-calculus weak head reduction that can be extended to a λ-calculus normalizer by encoding left reduction.


λ-calculusLinear logicInteraction netsSharing-graphsRewritingDistributed computation

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.Institut de Mathématiques de LuminyUMR 6206 du CNRSMarseille Cedex 9France