7 citations · 21 across the 8 of their papers we have counts for
9 papers · 1 filter
Communicating Actor Automata -- Modelling Erlang Processes as Communicating Machines
Dominic Orchard, Mihail Munteanu, Paulo Torrens
Brand and Zafiropulo's notion of Communicating Finite-State Machines (CFSMs) provides a succinct and powerful model of message-passing concurrency, based around channels. However,…
Replicate, Reuse, Repeat: Capturing Non-Linear Communication via Session Types and Graded Modal Types
Danielle Marshall, Dominic Orchard
Session types provide guarantees about concurrent behaviour and can be understood through their correspondence with linear logic, with propositions as sessions and proofs as proces…
A Theory of Composing Protocols
Laura Bocchi, Dominic Orchard, A. Laura Voinea
In programming, protocols are everywhere. Protocols describe the pattern of interaction (or communication) between software systems, for example, between a user-space program and t…
Deriving Distributive Laws for Graded Linear Types
Jack Hughes, Michael Vollmer, Dominic Orchard
The recent notion of graded modal types provides a framework for extending type theories with fine-grained data-flow reasoning. The Granule language explores this idea in the conte…
Guiding user annotations for units-of-measure verification
Dominic Orchard, Mistral Contrastin, Matthew Danish +1
This extended abstract reports on previous work of the CamFort project in which we developed an external units-of-measure type system for Fortran code, targeted at scientists. Our…
Unifying graded and parameterised monads
Dominic Orchard, Philip Wadler, Harley Eades
Monads are a useful tool for structuring effectful features of computation such as state, non-determinism, and continuations. In the last decade, several generalisations of monads…