Inhabitation for Non-idempotent Intersection Types

12/11/2017
by   Antonio Bucciarelli, et al.
0

The inhabitation problem for intersection types in the lambda-calculus is known to be undecidable. We study the problem in the case of non-idempotent intersection, considering several type assignment systems, which characterize the solvable or the strongly normalizing lambda-terms. We prove the decidability of the inhabitation problem for all the systems considered, by providing sound and complete inhabitation algorithms for them.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/15/2021

Sequence Types and Infinitary Semantics

We introduce a new representation of non-idempotent intersection types, ...
research
05/05/2021

Uniqueness typing for intersection types

Working in a variant of the intersection type assignment system of Coppo...
research
12/14/2018

Observability = Typability + Inhabitation

We define an observability property for a calculus with pattern matching...
research
04/23/2019

Intersection Subtyping with Constructors

We study the question of extending the BCD intersection type system with...
research
12/19/2017

Mixin Composition Synthesis based on Intersection Types

We present a method for synthesizing compositions of mixins using type i...
research
02/04/2020

Intersection Type Distributors

Building on previous works, we present a general method to define proof ...
research
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...

Please sign up or login with your details

Forgot password? Click here to reset