2 citations · 3 across the 2 of their papers we have counts for
2 papers
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.FL2014★ 1 cited
Weak and Nested Class Memory Automata
Conrad Cotton-Barratt, Andrzej Murawski, Luke Ong
Automata over infinite alphabets have recently come to be studied extensively as potentially useful tools for solving problems in verification and database theory. One popular mode…