Intersection Type Distributors

02/04/2020
by   Federico Olimpieri, et al.
0

Building on previous works, we present a general method to define proof relevant intersection types semantics for pure lambda calculus. We argue that the bicategory of distributors is an appropriate categorical framework for this kind of semantics. We first introduce a class of 2-monads whose algebras are monoidal categories modelling resource management, following Marsden-Zwardt's approach. We show how these monadic constructions determine Kleisli bicategories over the bicategory of distributors and we give a sufficient condition for cartesian closedness. We define a family of non-extentional models for pure lambda calculus. We then prove that the interpretation of lambda terms induced by these models can be concretely described via intersection type systems. The intersection constructor corresponds to the particular tensor product given by the considered free monadic construction. We conclude by describing two particular examples of these distributor-induced intersection type systems, proving that they characterise head-normalization.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/15/2021

Sequence Types and Infinitary Semantics

We introduce a new representation of non-idempotent intersection types, ...
03/26/2018

The Delta-calculus: syntax and types

We present the Delta-calculus, an explicitly typed lambda-calculus with ...
07/12/2019

Intersection Types for the Computational lambda-Calculus

We study polymorphic type assignment systems for untyped lambda-calculi ...
07/20/2019

Factoring Derivation Spaces via Intersection Types (Extended Version)

In typical non-idempotent intersection type systems, proof normalization...
04/03/2021

Intersection Types for a Computational Lambda-Calculus with Global State

We study the semantics of an untyped lambda-calculus equipped with opera...
07/16/2019

Recovering Purity with Comonads and Capabilities

In this paper, we take a pervasively effectful (in the style of ML) type...
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...
This week in AI

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