Structural Rules and Algebraic Properties of Intersection Types

04/26/2022
by   Sandra Alves, et al.
0

In this paper we define several notions of term expansion, used to define terms with less sharing, but with the same computational properties of terms typable in an intersection type system. Expansion relates terms typed by associative, commutative and idempotent intersections with terms typed in the Curry type system and the relevant type system, terms typed by non-idempotent intersections with terms typed in the affine and linear type systems and terms typed by non-idempotent and non-commutative intersections with terms typed in an ordered type system. Finally, we show how idempotent intersection is related with the contraction rule, commutative intersection with the exchange rule and associative intersection with the lack of structural rules in a type system.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/30/2022

Linear Rank Intersection Types

Non-idempotent intersection types provide quantitative information about...
research
05/05/2021

Uniqueness typing for intersection types

Working in a variant of the intersection type assignment system of Coppo...
research
04/23/2019

Intersection Subtyping with Constructors

We study the question of extending the BCD intersection type system with...
research
11/05/2019

Non-idempotent intersection types in logical form

Intersection types are an essential tool in the analysis of operational ...
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...
research
10/13/2020

Resolution as Intersection Subtyping via Modus Ponens

Resolution and subtyping are two common mechanisms in programming langua...
research
08/04/2020

Intensional Datatype Refinement

The pattern-match safety problem is to verify that a given functional pr...

Please sign up or login with your details

Forgot password? Click here to reset