Natural Deduction and Normalization Proofs for the Intersection Type Discipline

04/23/2019
by   Federico Aschieri, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/01/2018

Index-Stratified Types (Extended Version)

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

Factoring Derivation Spaces via Intersection Types (Extended Version)

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

Sequence Types and Infinitary Semantics

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

Factorization and Normalization, Essentially

Lambda-calculi come with no fixed evaluation strategy. Different strateg...
research
02/21/2023

A Deforestation of Reducts: Refocusing

In a small-step semantics with a deterministic reduction strategy, refoc...
research
04/23/2019

Intersection Subtyping with Constructors

We study the question of extending the BCD intersection type system with...
research
02/15/2019

Types by Need (Extended Version)

A cornerstone of the theory of lambda-calculus is that intersection type...

Please sign up or login with your details

Forgot password? Click here to reset