DeepAI

# Natural Deduction and Normalization Proofs for the Intersection Type Discipline

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.

05/01/2018

### Index-Stratified Types (Extended Version)

We present Tores, a core language for encoding metatheoretic proofs. The...
07/20/2019

### Factoring Derivation Spaces via Intersection Types (Extended Version)

In typical non-idempotent intersection type systems, proof normalization...
02/15/2021

### Sequence Types and Infinitary Semantics

We introduce a new representation of non-idempotent intersection types, ...
08/29/2019

### Factorization and Normalization, Essentially

Lambda-calculi come with no fixed evaluation strategy. Different strateg...
04/23/2019

### Intersection Subtyping with Constructors

We study the question of extending the BCD intersection type system with...
01/08/2021

### Polymorphic System I

System I is a simply-typed lambda calculus with pairs, extended with an ...
05/16/2018

### Modelling of crash types at signalized intersections based on random effect model

Approach-level models were developed to accommodate the diversity of app...