A Diamond Machine for Strong Evaluation
B Accattoli, P Barenbaum - Asian Symposium on Programming …, 2023 - Springer
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 …
set of transitions for backtracking out of an evaluated argument. We study a new abstract …
Leaf-First Zipper Semantics
S Lenglet, A Schmitt - International Conference on Formal Techniques for …, 2024 - Springer
Biernacka et al. recently proposed zipper semantics, a semantics format from which sound
and complete abstract machines for non-deterministic languages can be automatically …
and complete abstract machines for non-deterministic languages can be automatically …
Optimizing a Non-Deterministic Abstract Machine with Environments
Non-deterministic abstract machine (NDAM) is a recent implementation model for
programming languages where one must choose among several redexes at each reduction …
programming languages where one must choose among several redexes at each reduction …
Check for updates
LFZ Semantics, S Lenglet, A Schmitt - … , and Systems: 44th IFIP WG 6.1 … - books.google.com
Biernacka et al. recently proposed zipper semantics, a semantics format from which sound
and complete abstract machines for nondeterministic languages can be automatically …
and complete abstract machines for nondeterministic languages can be automatically …
[PDF][PDF] Undergraduate Research and Scholarship I
C Aubert, N Schwartz - 2024 - spots.augusta.edu
This class is aimed at fostering and developing abilities to conduct individual research in
Computer Science. As such, its structure may be evolving and concrete expectations are …
Computer Science. As such, its structure may be evolving and concrete expectations are …