Head Linear Reduction

@inproceedings{Danos2006HeadLR,
  title={Head Linear Reduction},
  author={Vincent Danos and Laurent Regnier},
  year={2006}
}
This paper defines head linear reduction, a reduction strategy of λ-terms that performs the minimal number of substitutions for reaching a head normal form. The definition relies on an extended notion of redex, and head linear reduction is therefore not a strategy in the exact usual sense. Krivine’s Abstract Machine is proved to be sound by relating it both to head linear reduction and to usual head reduction. The first proof suggests a variant machine, the Pointer Abstract Machine, which is… CONTINUE READING
11 Citations
18 References
Similar Papers

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…