Complexity of strongly normalising λ-terms via non-idempotent intersection types - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Complexity of strongly normalising λ-terms via non-idempotent intersection types

Résumé

We present a typing system for the λ-calculus, with non-idempotent intersection types. As it is the case in (some) systems with idempotent intersections, a λ-term is typable if and only if it is strongly normalising. Non-idempotency brings some further information into typing trees, such as a bound on the longest β-reduction sequence reducing a term to its normal form. We actually present these results in Klop’s extension of λ-calculus, where the bound that is read in the typing tree of a term is refined into an exact measure of the longest reduction sequence. This complexity result is, for longest reduction sequences, the counterpart of de Carvalho’s result for linear head-reduction sequences

Dates et versions

hal-01110489 , version 1 (28-01-2015)

Identifiants

Citer

Alexis Bernadet, Stéphane Lengrand. Complexity of strongly normalising λ-terms via non-idempotent intersection types. Proceedings of the 14th International Conference on Foundations of Software Science and Computation Structures (FOSSACS'11), Sep 2011, Saarbruecken, Germany. pp.88-107, ⟨10.1007/978-3-642-19805-2_7⟩. ⟨hal-01110489⟩
73 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More