DeepAI AI Chat
Log In Sign Up

Call-by-Value Solvability and Multi Types

by   Beniamino Accattoli, et al.

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.


page 1

page 2

page 3

page 4


Types of Fireballs (Extended Version)

The good properties of Plotkin's call-by-value lambda-calculus crucially...

Semantic Bounds and Strong Call-by-Value Normalization

This paper explores two topics at once: the use of denotational semantic...

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

The denotational semantics of the untyped lambda-calculus is a well deve...

The Bang Calculus Revisited

Call-by-Push-Value (CBPV) is a programming paradigm subsuming both Call-...

Normal Form Bisimulations By Value

Sangiorgi's normal form bisimilarity is call-by-name, identifies all the...

Tight Typings and Split Bounds

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

Malliavin calculus and its application to robust optimal portfolio for an insider

Insider information and model uncertainty are two unavoidable problems f...