Non-idempotent intersection types and strong normalisation

A Bernadet, SJ Lengrand - Logical Methods in Computer …, 2013 - lmcs.episciences.org
We present a ty** system with non-idempotent intersection types, ty** a term syntax
covering three different calculi: the pure λ-calculus, the calculus with explicit substitutions λ …

Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types

A Bernadet, S Lengrand - … Conference, FOSSACS 2011, Held as Part of …, 2011 - Springer
We present a ty** 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 …

Types intersections non-idempotents pour raffiner la normalisation forte avec des informations quantitatives

A Bernadet - 2014 - pastel.hal.science
Nous étudions des systèmes de typage avec des types intersections non-idempotents pour
des variantes du lambda-calcul et nous discutons de leurs propriétés et de leurs …

[PDF][PDF] Non idempotent-intersection types to refine strong normalisation with quantitative information

A Bernadet, MLT de Falco Rapporteur, MS Lengrand… - 2014 - core.ac.uk
We study systems of non-idempotent intersection types for different variants of the λ-calculus
and we discuss properties and applications. Besides the pure λ-calculus itself, the variants …