7 citations · 12 across the 5 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2015★ 2 cited
Fragments of ML Decidable by Nested Data Class Memory Automata
Conrad Cotton-Barratt, David Hopkins, Andrzej S. Murawski +1
The call-by-value language RML may be viewed as a canonical restriction of Standard ML to ground-type references, augmented by a "bad variable" construct in the sense of Reynolds.…
cs.PL2014★ 7 cited
Innocent Strategies are Sheaves over Plays---Deterministic, Non-deterministic and Probabilistic Innocence
Takeshi Tsukada, C. -H. Luke Ong
Although the HO/N games are fully abstract for PCF, the traditional notion of innocence (which underpins these games) is not satisfactory for such language features as non-determin…