Sequence Types and Infinitary Semantics

02/15/2021
by   Pierre Vial, et al.
0

We introduce a new representation of non-idempotent intersection types, using sequences (families indexed with natural numbers) instead of lists or multisets. This allows scaling up intersection type theory to the infinitary lambda-calculus. We thus characterize hereditary head normalization (Klop's Problem) and we give a unique type to all hereditary permutators (TLCA Problem #20), which is not possible in a finite system. On our way, we use non-idempotent intersection to retrieve some well-known results on infinitary terms. This paper begins with a gentle, high-level introduction to intersection type theory and to the infinitary calculus.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/11/2017

Inhabitation for Non-idempotent Intersection Types

The inhabitation problem for intersection types in the lambda-calculus i...
research
02/04/2020

Intersection Type Distributors

Building on previous works, we present a general method to define proof ...
research
07/20/2019

Factoring Derivation Spaces via Intersection Types (Extended Version)

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

Non-idempotent types for classical calculi in natural deduction style

In the first part of this paper, we define two resource aware typing sys...
research
01/31/2018

Call-by-need, neededness and all that

We show that call-by-need is observationally equivalent to weak-head nee...
research
04/23/2019

Natural Deduction and Normalization Proofs for the Intersection Type Discipline

Refining and extending previous work by Retoré, we develop a systematic ...
research
10/13/2020

Resolution as Intersection Subtyping via Modus Ponens

Resolution and subtyping are two common mechanisms in programming langua...

Please sign up or login with your details

Forgot password? Click here to reset