The Calculus of explicit substitutions lambda-upsilon

Pierre Lescanne (1) , Jocelyne Rouyer-Degli (1)

1 INRIA Lorraine

lambda-upsilon-calculus is a new simple calculus of explicit substitutions. In the paper we explore its properties, namely we prove that it correctly implements B reduction, it is confluent, its simply typed version is strongly normalizing. We associate with it an abstract machine called the U-machine. We prove that it is a correct implementation of the calculus.

Domaines: Autre [cs.OH]

Pierre Lescanne, Jocelyne Rouyer-Degli. The Calculus of explicit substitutions lambda-upsilon. [Research Report] RR-2222, INRIA. 1994. ⟨inria-00074448⟩