Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus

04/23/2019
by   Giulio Guerrieri, et al.
0

We investigate the possibility of a semantic account of the execution time (i.e. the number of beta-steps leading to the normal form, if any) for the shuffling calculus, an extension of Plotkin's call-by-value lambda-calculus. For this purpose, we use a linear logic based denotational model that can be seen as a non-idempotent intersection type system: relational semantics. Our investigation is inspired by similar ones for linear logic proof-nets and untyped call-by-name lambda-calculus. We first prove a qualitative result: a (possibly open) term is normalizable for weak reduction (which does not reduce under abstractions) if and only if its interpretation is not empty. We then show that the size of type derivations can be used to measure the execution time. Finally, we show that, differently from the case of linear logic and call-by-name lambda-calculus, the quantitative information enclosed in type derivations does not lift to types (i.e. to the interpretation of terms). To get a truly semantic measure of execution time in a call-by-value setting, we conjecture that a refinement of its syntax and operational semantics is needed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/27/2018

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...
research
08/30/2018

Types of Fireballs (Extended Version)

The good properties of Plotkin's call-by-value lambda-calculus crucially...
research
06/18/2018

Linear lambda-calculus and Reversible Automatic Combinators

In 2005, Abramsky introduced various linear/affine combinatory algebras ...
research
06/18/2018

Lambda-calculus and Reversible Automatic Combinators

In 2005, Abramsky introduced various linear/affine combinatory algebras ...
research
04/24/2023

Two Decreasing Measures for Simply Typed Lambda-Terms (Extended Version)

This paper defines two decreasing measures for terms of the simply typed...
research
12/11/2018

Towards the average-case analysis of substitution resolution in λ-calculus

Substitution resolution supports the computational character of β-reduct...
research
04/28/2021

Semantic Bounds and Strong Call-by-Value Normalization

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

Please sign up or login with your details

Forgot password? Click here to reset