7 citations · 8 across the 3 of their papers we have counts for
3 papers
cs.PL2024★ 1 cited
Incremental units-of-measure verification
Matthew Danish, Dominic Orchard, Andrew Rice
Despite an abundance of proposed systems, the verification of units-of-measure within programs remains rare in scientific computing. We attempt to address this issue by providing a…
cs.PL2023
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,…
cs.PL2021★ 7 cited
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…