55 citations · 110 across the 6 of their papers we have counts for
6 papers
A fixed point theorem for COFEs
Stephen Dolan
A new fixed point principle for complete ordered families of equivalences (COFEs) is presented, which is stronger than the standard Banach-type fixed point principle.
Retrofitting Effect Handlers onto OCaml
KC Sivaramakrishnan, Stephen Dolan, Leo White +3
Effect handlers have been gathering momentum as a mechanism for modular programming with user-defined effects. Effect handlers allow for non-local control flow mechanisms such as g…
The Only Undoable CRDTs are Counters
Stephen Dolan
In comparing well-known CRDTs representing sets that can grow and shrink, we find caveats. In one, the removal of an element cannot be reliably undone. In another, undesirable stat…
Repairing and Mechanising the JavaScript Relaxed Memory Model
Conrad Watt, Christopher Pulte, Anton Podkopaev +5
Modern JavaScript includes the SharedArrayBuffer feature, which provides access to true shared memory concurrency. SharedArrayBuffers are simple linear buffers of bytes, and the Ja…
Retrofitting Parallelism onto OCaml
KC Sivaramakrishnan, Stephen Dolan, Leo White +6
OCaml is an industrial-strength, multi-paradigm programming language, widely used in industry and academia. OCaml is also one of the few modern managed system programming languages…
First-Class Subtypes
Jeremy Yallop, Stephen Dolan
First class type equalities, in the form of generalized algebraic data types (GADTs), are commonly found in functional programs. However, first-class representations of other relat…