Call-by-Value Solvability and Multi Types

02/07/2022
by   Beniamino Accattoli, et al.
0

This paper provides a characterization of call-by-value solvability using call-by-value multi types. Our work is based on Accattoli and Paolini's characterization of call-by-value solvable terms as those terminating with respect to the solving strategy of the value substitution calculus, a refinement of Plotkin's call-by-value λ-calculus. Here we show that the solving strategy terminates on a term t if and only if t is typable in a certain way in the multi type system induced by Ehrhard's call-by-value relational semantics. Moreover, we show how to extract from the type system exact bounds on the length of the solving evaluation and on the size of its normal form, adapting de Carvalho's technique for call-by-name.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/30/2018

Types of Fireballs (Extended Version)

The good properties of Plotkin's call-by-value lambda-calculus crucially...
research
09/21/2023

Strong Call-by-Value and Multi Types

This paper provides foundations for strong (that is, possibly under abst...
research
04/28/2021

Semantic Bounds and Strong Call-by-Value Normalization

This paper explores two topics at once: the use of denotational semantic...
research
07/18/2022

The Theory of Call-by-Value Solvability (long version)

The denotational semantics of the untyped lambda-calculus is a well deve...
research
02/10/2020

The Bang Calculus Revisited

Call-by-Push-Value (CBPV) is a programming paradigm subsuming both Call-...
research
03/14/2023

Normal Form Bisimulations By Value

Sangiorgi's normal form bisimilarity is call-by-name, identifies all the...
research
07/06/2018

Tight Typings and Split Bounds

Multi types---aka non-idempotent intersection types---have been used to ...

Please sign up or login with your details

Forgot password? Click here to reset