
Strong Call by Value is Reasonable for Time
The invariance thesis of Slot and van Emde Boas states that all reasonab...
read it

The Deltacalculus: syntax and types
We present the Deltacalculus, an explicitly typed lambdacalculus with ...
read it

The Dynamic Geometry of Interaction Machine: A TokenGuided Graph Rewriter
In implementing evaluation strategies of the lambdacalculus, both corre...
read it

Strict Ideal Completions of the Lambda Calculus
The infinitary lambda calculi pioneered by Kennaway et al. extend the ba...
read it

Efficient Implementation of Evaluation Strategies via TokenGuided Graph Rewriting
In implementing evaluation strategies of the lambdacalculus, both corre...
read it

Product Kanerva Machines: Factorized Bayesian Memory
An ideal cognitivelyinspired memory system would compress and organize ...
read it

Strong CallbyValue is Reasonable, Implosively
Whether the number of betasteps in the lambdacalculus can be taken as ...
read it
An Abstract Machine for Strong Call by Value
We present an abstract machine that implements a fullreducing (a.k.a. strong) callbyvalue strategy for pure λcalculus. It is derived using Danvy et al.'s functional correspondence from Crégut's KN by: (1) deconstructing KN to a callbyname normalizationbyevaluation function akin to Filinski and Rohde's, (2) modifying the resulting normalizer so that it implements the righttoleft callbyvalue function application, and (3) constructing the functionally corresponding abstract machine. This new machine implements a reduction strategy that subsumes the fireballcalculus variant of call by value studied by Accattoli et al. We describe the strong strategy of the machine in terms of a reduction semantics and prove the correctness of the machine using a method based on Biernacka et al.'s generalized refocusing. As a byproduct, we present an example application of the machine to checking term convertibility by discriminating on the basis of their partially normalized forms.
READ FULL TEXT
Comments
There are no comments yet.