Call-by-value and call-by-need lambda-calculi are defined using the distinguished syntactic category of values. In theoretical studies, values are variables and abstractions. In more practical works, values are usually defined simply as abstractions. This paper shows that practical values lead to a more efficient process of substitution—for both call-by-value and call-by-need—once the usual hypothesis for implementations hold (terms are closed, reduction does not go under abstraction, and substitution is done in micro steps, replacing one variable occurrence at the time). Namely, the number of substitution steps becomes linear in the number of β-redexes, while theoretical values only provide a quadratic bound
We study an extension of Plotkin\u27s call-by-value lambda-calculus by means of two commutation rule...
This paper starts by setting the ground for a lambda calculus notation that strongly mirrors the two...
This paper starts by setting the ground for a lambda calculus notation that strongly mirrors the two...
Call-by-value and call-by-need lambda-calculi are defined using the distinguished syntactic category...
International audienceCall-by-value and call-by-need $λ$-calculi are defined using the distinguished...
In this work we present a categorical approach for modeling the pure (i.e., without constants) call-...
We present a calculus that captures the operational semantics of call-by-need.We demonstrate t...
We study an extension of Plotkin's call-by-value lambda-calculus via twocommutation rules (sigma-red...
Abstract. In Plotkin's call-by-value lambda-calculus, solvable terms are characterized syntacti...
Since it is unsound to reason about call-by-value languages using call-by name equational theories, ...
Understanding procedure calls is crucial in computer science and everyday programming. Among the mos...
We propose an abstract machine to run the call-by-value -calculus extended with a call-by-value xed-...
We present a call-by-need $\lambda$-calculus that enables strong reduction(that is, reduction inside...
We give p-calculus encodings of some reduction strategies that have been found useful in the functio...
International audienceIn the call-by-value lambda-calculus solvable terms have been characterised by...
We study an extension of Plotkin\u27s call-by-value lambda-calculus by means of two commutation rule...
This paper starts by setting the ground for a lambda calculus notation that strongly mirrors the two...
This paper starts by setting the ground for a lambda calculus notation that strongly mirrors the two...
Call-by-value and call-by-need lambda-calculi are defined using the distinguished syntactic category...
International audienceCall-by-value and call-by-need $λ$-calculi are defined using the distinguished...
In this work we present a categorical approach for modeling the pure (i.e., without constants) call-...
We present a calculus that captures the operational semantics of call-by-need.We demonstrate t...
We study an extension of Plotkin's call-by-value lambda-calculus via twocommutation rules (sigma-red...
Abstract. In Plotkin's call-by-value lambda-calculus, solvable terms are characterized syntacti...
Since it is unsound to reason about call-by-value languages using call-by name equational theories, ...
Understanding procedure calls is crucial in computer science and everyday programming. Among the mos...
We propose an abstract machine to run the call-by-value -calculus extended with a call-by-value xed-...
We present a call-by-need $\lambda$-calculus that enables strong reduction(that is, reduction inside...
We give p-calculus encodings of some reduction strategies that have been found useful in the functio...
International audienceIn the call-by-value lambda-calculus solvable terms have been characterised by...
We study an extension of Plotkin\u27s call-by-value lambda-calculus by means of two commutation rule...
This paper starts by setting the ground for a lambda calculus notation that strongly mirrors the two...
This paper starts by setting the ground for a lambda calculus notation that strongly mirrors the two...