mirage

# Browsing LIP - Laboratoire de l'Informatique du Parallélisme by Subject "Lambda-Calculus"

Sort by: Order: Results:

• (2000-02)
(eng) This paper is part of a general programme of treating explicit substitutions as the primary $\lambda$-calculi from the point of view of foundations as well as applications. Here we investigate the property of strong ...
• (2004-02)
(eng) Pure type systems are a general formalism allowing to represent many type systems -- in particular, Barendregt's lambda-cube, including Girard's system F, dependent types, and the calculus of constructions. We built ...
• (1996-10)
(eng) The module system of SML is a small typed language of its own. As is, one would expect a proof of its soundness following from a proof of subject reduction, but none exists. As a consequence the theoretical study of ...