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

by   Beniamino Accattoli, et al.

The denotational semantics of the untyped lambda-calculus is a well developed field built around the concept of solvable terms, which are elegantly characterized in many different ways. In particular, unsolvable terms provide a consistent notion of meaningless term. The semantics of the untyped call-by-value lambda-calculus (CbV) is instead still in its infancy, because of some inherent difficulties but also because CbV solvable terms are less studied and understood than in call-by-name. On the one hand, we show that a carefully crafted presentation of CbV allows us to recover many of the properties that solvability has in call-by-name, in particular qualitative and quantitative characterizations via multi types. On the other hand, we stress that, in CbV, solvability plays a different role: identifying unsolvable terms as meaningless induces an inconsistent theory.


page 1

page 2

page 3

page 4


Call-by-Value Solvability and Multi Types

This paper provides a characterization of call-by-value solvability usin...

Lambda Congruences and Extensionality

In this work we provide alternative formulations of the concepts of lamb...

The Vectorial Lambda Calculus Revisited

We revisit the Vectorial Lambda Calculus, a typed version of Lineal. Vec...

Theory Presentation Combinators

To build a scalable library of mathematics, we need a method which takes...

Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus (Long Version)

We investigate the possibility of a semantic account of the execution ti...

Reduction Monads and Their Signatures

In this work, we study 'reduction monads', which are essentially the sam...

Please sign up or login with your details

Forgot password? Click here to reset