#### Filter Results:

- Full text PDF available (30)

#### Publication Year

1997

2017

- This year (4)
- Last 5 years (22)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sam Staton
- FOSSACS
- 2010

Every algebraic theory gives rise to a monad, and monads allow a meta-language which is a basic programming language with sideeffects. Equations in the algebraic theory give rise to equations between programs in the meta-language. An interesting question is this: to what extent can we put equational reasoning for programs into the algebraic theory for the… (More)

- Marcelo P. Fiore, Sam Staton
- 21st Annual IEEE Symposium on Logic in Computer…
- 2006

We introduce a mathematical structural operational semantics that yields a congruence result for bisimilarity and is suitable for investigating rule formats for name-passing systems. Indeed, we instantiate this general abstract model theory in a framework of nominal sets and extract from it a GSOS-like rule format for name-passing process calculi for which… (More)

- Sam Staton
- Logical Methods in Computer Science
- 2009

A labelled transition system can be understood as a coalgebra for a particular endofunctor on the category of sets. Generalizing, we are led to consider coalgebras for arbitrary endofunctors on arbitrary categories. Bisimulation is a crucial notion in the theory of labelled transition systems. We identify four definitions of bisimulation on general… (More)

- Marcelo P. Fiore, Sam Staton
- Electr. Notes Theor. Comput. Sci.
- 2004

We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic model is considered both for presheaves over the category of finite sets and injections, and for its subcategory of atomic sheaves known as the Schanuel topos. Each coalgebra… (More)

- Marcelo P. Fiore, Sam Staton
- Inf. Comput.
- 2009

We introduce a GSOS-like rule format for name-passing process calculi. Specifications in this format correspond to theories in nominal logic. The intended models of such specifications arise by initiality from a general categorical model theory. For operational semantics given in this rule format, a natural behavioural equivalence — a form of open… (More)

- Sam Staton
- POPL
- 2015

We develop a new framework of algebraic theories with linear parameters, and use it to analyze the equational reasoning principles of quantum computing and quantum programming languages. We use the framework as follows: <ul><li>we present a new elementary algebraic theory of quantum computation, built from unitary gates and measurement;</li> <li>we provide… (More)

- Sam Staton, Hongseok Yang, Chris Heunen, Ohad Kammar, Frank Wood
- LICS
- 2016

We study the semantic foundation of expressive probabilistic programming languages, that support higher-order functions, continuous distributions, and soft constraints (such as Anglican, Church, and Venture). We define a metalanguage (an idealised version of Anglican) for probabilistic computation with the above features, develop both operational and… (More)

- Sam Staton, Sander Uijlen
- ICALP
- 2015

Our paper is about generalized theories of probability that allow us to analyze the non-locality and contextuality paradoxes from quantum theory. Informally, these paradoxes have to do with the idea that it might not be possible to explain the outcomes of measurements in a classical way. We use now-standard techniques for local reasoning in computer… (More)

- Sam Staton
- ESOP
- 2017

- Rasmus Ejlers Møgelberg, Sam Staton
- CALCO
- 2011

We investigate the phenomenon that every monad is a linear state monad. We do this by studying a fully-complete state-passing translation from an impure call-by-value language to a new linear type theory: the enriched call-by-value calculus. The results are not specific to store, but can be applied to any computational effect expressible using algebraic… (More)