Sam Staton
 |
|
Room FS08, University of Cambridge Computer Laboratory
15 JJ Thomson Avenue
Cambridge CB3 0FD
(01223) (7)63584
sam.staton at cl.cam.ac.uk
|
I am an EPSRC post-doctoral research fellow in theoretical computer science.
My grant title is
Mathematical Operational Semantics for Data-Passing Processes.
My proposed research concerns mathematical models of operational semantics,
especially those describing the communication of
structured data.
I am also interested in programming language semantics in general,
and particularly languages with local state.
On the mathematical side of things, I am interested
in category theory and its applications to computer science,
including coalgebras.
Prior to this fellowship I worked
on the EPSRC grant
Domain Theory for Concurrency — New Categorical Foundations.
This year I am lecturing
Semantics of Programming Languages
and Categorical Logic.
Publications
-
S. Staton.
Completeness for algebraic theories of local state.
To appear in Proceedings of 13th International Conference on Foundations of Software Science and Computation Structure (FOSSACS 2010).
-
S. Staton.
Relating coalgebraic notions of bisimulation.
Proceedings of 3rd Conference on Algebra and Coalgebra in Computer Science (CALCO'09).
LNCS 5728 191-205.
doi:10.1007/978-3-642-03741-2_14.
[preprint: pdf]
-
S. Staton.
Two cotensors in one:
Presentations of algebraic theories for
local state and fresh names.
Proceedings of 25th Conference on the Mathematical Foundations of Programming Semantics (MFPS 25). doi:10.1016/j.entcs.2009.07.103.
[preprint: pdf]
-
S. Staton.
Substitution in Structural Operational Semantics and value-passing process calculi.
Proceedings of 2nd International Workshop on Theory and Applications of Abstraction, Substitution and Naming (TAASN 2009).
[preprint: pdf]
-
S. Staton.
General Structural Operational Semantics through Categorical Logic.
Proceedings of 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008), pages 166-177. doi:10.1109/LICS.2008.43.
[preprint: pdf]
-
M. Fiore and S. Staton.
A Congruence Rule Format for Name-Passing Process Calculi.
Information and Computation Vol 207, Issue 2 (February 2009), Pages 209-236. Special Issue on Structural Operational Semantics. doi:10.1016/j.ic.2007.12.005. [preprint: pdf]
-
S. Staton.
Name-Passing Process Calculi: Operational Models and Structural Operational Semantics.
PhD thesis. Girton College, Cambridge.
Supervised by Marcelo Fiore,
and examined by Gordon Plotkin and Andrew Pitts.
Computer Laboratory Technical Report UCAM-CL-TR-688.
[Thesis summary: pdf]
-
M. P. Fiore and S. Staton.
A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Operational Semantics.
Proceedings of 21st Annual IEEE Symposium on Logic in Computer Science (LICS 2006), pages 49-58. doi:10.1109/LICS.2006.7.
[preprint: pdf]
-
M. P. Fiore and S. Staton.
Comparing operational models of name-passing process calculi.
Information and Computation Vol 204, Issue 4 (April 2006),
Pages 524-560. doi:10.1016/j.ic.2005.08.004.
[preprint: pdf].
Preliminary version in Proceedings of
7th International Workshop on Coalgebraic Methods
in Computer Science (CMCS'04).
ENTCS 106 (2004) 91-104. doi:10.1016/j.entcs.2004.02.025.
[preprint: pdf]
In summer 2001 I took a research internship in Human Computer Interaction,
looking into modelling human behaviour.
Rough notes on my model have been published as
Computer Laboratory
Technical Report UCAM-CL-TR-647.
Here is my undergraduate (Part II) dissertation:
A formal approach to distributed versioning [pdf].
Girton College, Cambridge, 2002.
Meetings and teaching
This year, I am lecturing courses on
Semantics of Programming Languages
and
Categorical Logic.
I organize
seminars in logic and semantics
and
minicourses in theoretical computer science.