Intersection Types for the Resource Control Lambda Calculi - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Intersection Types for the Resource Control Lambda Calculi

(1) , (2) , (2) , (3)
1
2
3

Abstract

We propose intersection type assignment systems for two resource control term calculi: the lambda calculus and the sequent lambda calculus with explicit operators for weakening and contraction. These resource control calculi, /\® and /\®-Gtz, respectively, capture the computational content of intuitionistic natural deduction and intuitionistic sequent logic with explicit structural rules. Our main contribution is the characterisation of strong normalisation of reductions in both calculi. We first prove that typability implies strong normalisation in /\® by adapting the reducibility method. Then we prove that typability implies strong normalisation in /\®-Gtz by using a combination of well-orders and a suitable embedding of /\®-Gtz-terms into /\®-terms which preserves types and enables the simulation of all its reductions by the operational semantics of the /\®-calculus. Finally, we prove that strong normalisation implies typability in both systems using head subject expansion.
Not file

Dates and versions

ensl-00654755 , version 1 (22-12-2011)

Identifiers

  • HAL Id : ensl-00654755 , version 1

Cite

Pierre Lescanne, Silvia Ghilezan, Jelena Ivetic, Silvia Likavec. Intersection Types for the Resource Control Lambda Calculi. Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Aug 2011, Johannesburg, South Africa. pp.116-134. ⟨ensl-00654755⟩
73 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More