Introducing modularity and sharing in a typed Lambda-calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

Introducing modularity and sharing in a typed Lambda-calculus


Thanks to the Curry-Howard isomorphism, typed lambda-calculi provide a convenient logical framework to formalize the concept of proof. The large size of proofs dictates the introduction of concepts of struturation and modularity. This in turn raises the problem of information sharing between modules. This paper presents the results of such a study for a language derived from Nederpelt'system Y. We first discuss the reasons why sharing is not correctly supported and then a new calculus is proposed, which allows the definition of modules. This calculus provides a mechanism of access between modules that let them share information. It is defined in terms of an operational semantics and a comparison with the system Y is provided.


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

Dates and versions

inria-00077191 , version 1 (29-05-2006)


  • HAL Id : inria-00077191 , version 1


Alain Costes. Introducing modularity and sharing in a typed Lambda-calculus. [Research Report] RR-1903, INRIA. 1993. ⟨inria-00077191⟩
54 View
24 Download


Gmail Facebook X LinkedIn More