Types by Need (Extended Version)

02/15/2019
by   Beniamino Accattoli, et al.
0

A cornerstone of the theory of lambda-calculus is that intersection types characterise termination properties. They are a flexible tool that can be adapted to various notions of termination, and that also induces adequate denotational models. Since the seminal work of de Carvalho in 2007, it is known that multi types (i.e. non-idempotent intersection types) refine intersection types with quantitative information and a strong connection to linear logic. Typically, type derivations provide bounds for evaluation lengths, and minimal type derivations provide exact bounds. De Carvalho studied call-by-name evaluation, and Kesner used his system to show the termination equivalence of call-by-need and call-by-name. De Carvalho's system, however, cannot provide exact bounds on call-by-need evaluation lengths. In this paper we develop a new multi type system for call-by-need. Our system produces exact bounds and induces a denotational model of call-by-need, providing the first tight quantitative semantics of call-by-need.

READ FULL TEXT
research
11/30/2022

Linear Rank Intersection Types

Non-idempotent intersection types provide quantitative information about...
research
07/06/2018

Tight Typings and Split Bounds

Multi types---aka non-idempotent intersection types---have been used to ...
research
10/23/2020

Intersection Types and (Positive) Almost-Sure Termination

Randomized higher-order computation can be seen as being captured by a l...
research
08/30/2018

Types of Fireballs (Extended Version)

The good properties of Plotkin's call-by-value lambda-calculus crucially...
research
11/05/2019

Non-idempotent intersection types in logical form

Intersection types are an essential tool in the analysis of operational ...
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
03/21/2022

Curry and Howard Meet Borel

We show that an intuitionistic version of counting propositional logic c...

Please sign up or login with your details

Forgot password? Click here to reset