3 citations · 5 across the 4 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2026
Nominal techniques as an Agda library
Murdoch J. Gabbay, Orestis Melkonian
Nominal techniques provide a mathematically principled approach to dealing with names and variable binding in programming languages. This paper explores an attempt to make nominal…
cs.PL2019★ 2 cited
Reconciling Event Structures with Modern Multiprocessors
Evgenii Moiseenko, Anton Podkopaev, Ori Lahav +2
Weakestmo is a recently proposed memory consistency model that uses event structures to resolve the infamous "out-of-thin-air" problem. Although it has been shown to have important…