Non-Deterministic Abstract Machines - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Non-Deterministic Abstract Machines


We present a generic design of abstract machines for non-deterministic programming languages, such as process calculi or concurrent lambda calculi, that provides a simple way to implement them. Such a machine traverses a term in the search for a redex, making non-deterministic choices when several paths are possible and backtracking when it reaches a dead end, i.e., an irreducible subterm. The search is guaranteed to terminate thanks to term annotations the machine introduces along the way. We show how to automatically derive a non-deterministic abstract machine from a zipper semantics-a form of structural operational semantics in which the decomposition process of a term into a context and a redex is made explicit. The derivation method ensures the soundness and completeness of the machines w.r.t. the zipper semantics.
Fichier principal
Vignette du fichier
LIPIcs-CONCUR-2022-7.pdf (798.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03772712 , version 1 (08-09-2022)



Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Alan Schmitt. Non-Deterministic Abstract Machines. CONCUR 2022 - 33rd International Conference
 on Concurrency Theory, Sep 2022, Varsovie, Poland. pp.1-24, ⟨10.4230/LIPIcs.CONCUR.2022.7⟩. ⟨hal-03772712⟩
53 View
28 Download



Gmail Facebook Twitter LinkedIn More