A Diamond Machine for Strong Evaluation
Abstract machines for strong evaluation of the λ-calculus enter into arguments and have a set of transitions for backtracking out of an evaluated argument. We study a new abstract machine which avoids backtracking by splitting the run of the machine in smaller jobs, one for argument, and that jumps directly to the next job once one is finished.
Usually, machines are also deterministic and implement deterministic strategies. Here we weaken this aspect and consider a light form of non-determinism, namely the diamond property, for both the machine and the strategy. For the machine, this introduces a modular management of jobs, parametric in a scheduling policy. We then show how to obtain various strategies, among which leftmost-outermost evaluation.
Mon 27 NovDisplayed time zone: Beijing, Chongqing, Hong Kong, Urumqi change
13:30 - 15:00
|A Diamond Machine for Strong Evaluation
|Proofs as Terms, Terms as Graphs
Jui-Hsuan Wu Institut Polytechnique de Paris
|Typed Non-determinism in Functional and Concurrent Calculi