Natural Deduction and Normalization Proofs for the Intersection Type Discipline

2019/04/23 by Federico Aschieri
Computer Science · #cs.LO

paper · pdf · doi:10.4204/eptcs.293.3

published as EPTCS 293, 2019, pp. 29-37 · In Proceedings DCM 2018 and ITRS 2018, arXiv:1904.09561

arxiv created 2019/04/23 · arxiv updated 2019/04/24

Abstract

Refining and extending previous work by Retoré, we develop a systematic approach to intersection types via natural deduction. We show how a step of beta reduction can be seen as performing, at the level of typing derivations, Prawitz reductions in parallel. Then we derive as immediate consequences of Subject Reduction the main theorems about normalization for intersection types: for system D, strong normalization, for system Omega, the leftmost reduction termination for terms typable without Omega.

Citations

• Proceedings Twelfth Workshop on Developments in Computational Models and Ninth Workshop on Intersection Types and Related Systems