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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

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...
09/19/2018

On sets of terms with a given intersection type

We are interested in how much of the structure of a strongly normalizabl...
08/29/2019

Factorization and Normalization, Essentially

Lambda-calculi come with no fixed evaluation strategy. Different strateg...
02/15/2019

Types by Need (Extended Version)

A cornerstone of the theory of lambda-calculus is that intersection type...
01/08/2021

Polymorphic System I

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

Non-idempotent intersection types in logical form

Intersection types are an essential tool in the analysis of operational ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.