259 citations · 384 across the 18 of their papers we have counts for
18 papers
Validating Labelled State Transition and Message Production Systems: A Theory for Modelling Faulty Distributed Systems
Vlad Zamfir, Mihai Calancea, Denisa Diaconescu +7
Modeling and formally reasoning about distributed systems with faults is a challenging task. To address this problem, we propose the theory of Validating Labeled State transition a…
Native Type Theory
Christian Williams, Michael Stay
Native type systems are those in which type constructors are derived from term constructors, as well as the constructors of predicate logic and intuitionistic type theory. We prese…
Representing operational semantics with enriched Lawvere theories
Michael Stay, L. G. Meredith
Many term calculi, like lambda calculus or pi calculus, involve binders for names, and the mathematics of bound variable names is subtle. Schoenfinkel introduced the SKI combinator…
Name-free combinators for concurrency
Lucius Gregory Meredith, Michael Stay
Yoshida demonstrated how to eliminate the bound names coming from the input prefix in the asynchronous pi calculus, but her combinators still depend on the "new" operator to bind n…
Logic as a distributive law
Mike Stay, Lucius Gregory Meredith
We present an algorithm for deriving a spatial-behavioral type system from a formal presentation of a computational calculus. Given a 2-monad Calc: Catv Cat for the free calcu…
Higher category models of the pi-calculus
Mike Stay, Lucius Gregory Meredith
We present an approach to modeling computational calculi using higher category theory. Specifically we present a fully abstract semantics for the pi-calculus. The interpretation is…