A Diamond Machine for Strong Evaluation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

A Diamond Machine for Strong Evaluation

Résumé

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 nondeterminism, 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, by instantiating in different ways the scheduling policy.
Fichier principal
Vignette du fichier
main.pdf (426.17 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04395635 , version 1 (15-01-2024)

Identifiants

  • HAL Id : hal-04395635 , version 1

Citer

Beniamino Accattoli, Pablo Barenbaum. A Diamond Machine for Strong Evaluation. APLAS 2023 - The 21st Asian Symposium on Programming Languages and Systems, Nov 2023, Taipei, Taiwan. ⟨hal-04395635⟩
15 Consultations
12 Téléchargements

Partager

Gmail Facebook X LinkedIn More