The Calculus of explicit substitutions lambda-upsilon - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1994

The Calculus of explicit substitutions lambda-upsilon

Abstract

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2222.pdf (864.7 Ko) Télécharger le fichier

Dates and versions

inria-00074448 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074448 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More