International audienceCall-by-value and call-by-need $λ$-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 a time). Namely, the number of substitution steps becomes linear in the number of $β$-redexes, while theoretical values only provide a quadratic bound. We complet...
AbstractWe give a systematic category theoretic axiomatics for modelling data refinement in call by ...
Since it is unsound to reason about call-by-value languages using call-by name equational theories, ...
International audienceWe define a variant of realizability where realizers are pairs of a term and a...
International audienceCall-by-value and call-by-need $λ$-calculi are defined using the distinguished...
Call-by-value and call-by-need lambda-calculi are defined using the distinguished syntactic category...
In this work we present a categorical approach for modeling the pure (i.e., without constants) call-...
AbstractThis paper examines the old question of the relationship between ISWIM and the λ-calculus, u...
International audienceCall-by-need calculi are complex to design and reason with. When adding contro...
International audienceWe present a call-by-need λ-calculus that enables strong reduction (that is, r...
International audienceIn the call-by-value lambda-calculus solvable terms have been characterised by...
Traditionally, reasoning about programs under varying evaluation regimes (call-by-value, call-by-nam...
Understanding procedure calls is crucial in computer science and everyday programming. Among the mos...
We establish a general framework for reasoning about the relationship between call-by-value and call...
We study an extension of Plotkin's call-by-value lambda-calculus via twocommutation rules (sigma-red...
AbstractWe give a systematic category theoretic axiomatics for modelling data refinement in call by ...
Since it is unsound to reason about call-by-value languages using call-by name equational theories, ...
International audienceWe define a variant of realizability where realizers are pairs of a term and a...
International audienceCall-by-value and call-by-need $λ$-calculi are defined using the distinguished...
Call-by-value and call-by-need lambda-calculi are defined using the distinguished syntactic category...
In this work we present a categorical approach for modeling the pure (i.e., without constants) call-...
AbstractThis paper examines the old question of the relationship between ISWIM and the λ-calculus, u...
International audienceCall-by-need calculi are complex to design and reason with. When adding contro...
International audienceWe present a call-by-need λ-calculus that enables strong reduction (that is, r...
International audienceIn the call-by-value lambda-calculus solvable terms have been characterised by...
Traditionally, reasoning about programs under varying evaluation regimes (call-by-value, call-by-nam...
Understanding procedure calls is crucial in computer science and everyday programming. Among the mos...
We establish a general framework for reasoning about the relationship between call-by-value and call...
We study an extension of Plotkin's call-by-value lambda-calculus via twocommutation rules (sigma-red...
AbstractWe give a systematic category theoretic axiomatics for modelling data refinement in call by ...
Since it is unsound to reason about call-by-value languages using call-by name equational theories, ...
International audienceWe define a variant of realizability where realizers are pairs of a term and a...