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 …

Biernacka et al. recently proposed zipper semantics, a semantics format from which sound
and complete abstract machines for non-deterministic languages can be automatically …

Non-deterministic abstract machine (NDAM) is a recent implementation model for
programming languages where one must choose among several redexes at each reduction …

Biernacka et al. recently proposed zipper semantics, a semantics format from which sound
and complete abstract machines for nondeterministic languages can be automatically …

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 …