S. Staton. Freyd categories are enriched Lawvere theories.

In Proceedings of

Workshop on Algebra, Coalgebra and Topology

. Electron. Notes Theor. Comput. Sci. 303:197-206.

2013

.

doi:10.1016/j.entcs.2014.02.010

. [preprint:

pdf

| note:

txt

]

  • D. Ahman and S. Staton. Normalization by evaluation and algebraic effects. In Proceedings of Twenty-Ninth Conference on Mathematical Foundations of Programming Semantics (MFPS 2013). Electron. Notes Theor. Comput. Sci. 298:51-69. 2013. doi:10.106/j.entcs.2013.09.007. Preprint: [pdf]

  • S. Staton. Instances of computational effects. In Proceedings of Twenty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2013). doi:10.1109/LICS.2013.58. [preprint: pdf | errata: txt]

  • S. Staton. An algebraic presentation of predicate logic. In Proceedings of Sixteenth International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2013), Lecture Notes in Comput. Sci. 7794:401-417. Springer, 2013. doi:10.1007/978-3-642-37075-5_26. [preprint: pdf] [code: flp.sml]

  • S. Staton and P. Levy. Universal properties for impure programming languages. In Proceedings of Fortieth ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2013), pages 179-192. doi:10.1145/2429069.2429091. [preprint: pdf]

  • R. E. Møgelberg and S. Staton. Linearly-used state in models of call-by-value. In Proceedings of Fourth International Conference on Algebra and Coalgebra in Computer Science (CALCO 2011). Lecture Notes in Comput. Sci. 6859:293-313. doi:10.1007/978-3-642-22944-2_21. [preprint: pdf]

  • S. Staton. Relating coalgebraic notions of bisimulation. Logical Methods in Computer Science Vol 7, Issue 1 (March 2011). doi:10.2168/LMCS-7(1:13)2011. Preprint: [pdf] arXiv:1101.4223.

  • S. Staton and G. Winskel. On the expressivity of symmetry in event structures. In Proceedings of 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010), pages 392-401. doi:10.1109/LICS.2010.37. [preprint: pdf]

  • R. E. Møgelberg and S. Staton. Full abstraction in a metalanguage for state. In Workshop on Syntax and Semantics of Low Level Languages (LOLA 2010). Satellite workshop of LICS 2010.

  • T. Altenkirch, P. Levy and S. Staton. Higher order containers. In Proceedings of Computability in Europe (CiE 2010). Lecture Notes in Comput. Sci. 6158:11-20. doi:10.1007/978-3-642-13962-8_2. [preprint: pdf]

  • M. P. Fiore and S. Staton. Positive structural operational semantics and monotone distributive laws. Short contribution for 10th International Workshop on Coalgebraic Methods in Computer Science (CMCS 2010). CWI Technical report SEN-1004. [preprint: pdf]

  • S. Staton. Completeness for algebraic theories of local state. Proceedings of 13th International Conference on Foundations of Software Science and Computation Structure (FOSSACS 2010). Lecture Notes in Comput. Sci. 6014:48-63. doi:10.1007/978-3-642-12032-9_5. [preprint: pdf | errata: txt]

  • S. Staton. Relating coalgebraic notions of bisimulation, with applications to name-passing process calculi. Proceedings of 3rd Conference on Algebra and Coalgebra in Computer Science (CALCO 2009). Lecture Notes in Comput. Sci. 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). Electron. Notes Theor. Comput. Sci. 249:471-490. 2009. 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]

  • 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. 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]

  • 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).  Electron. Notes Theor. Comput. Sci. 106:91-104. doi:10.1016/j.entcs.2004.02.025.  [preprint: pdf]

  • Research Associates and Students

    ;

    Philip Saville

    was a postdoc on my grant "Quantum programming via algebraic effects" (2021-2024), now a Lecturer at University of Sussex;

    Satoshi Kura

    was a JSPS overseas research fellow (2022-2024), now an Assistant Professor at Waseda University;

    Mathieu Huot

    was a DPhil student, now a postdoc at MIT;

    Sean Moss

    was an RA on my ERC grant, now an Assistant Professor in Birmingham;

    Cristina Matache

    was a DPhil student, now a postdoc in Edinburgh;

    Hugo Paquet

    was a postdoc on my Royal Society grant until Jan 2023, now holding a Marie Skłodowska-Curie Award in Paris;

    Ohad Kammar

    was an RA on my EPSRC grant

    EP/N007387/1

    and earlier on a grant from the Isaac Newton Trust; now a Lecturer in Edinburgh;

    Marcin Szymczak

    was an RA on seed funding from the Alan Turing Institute, on a project with Scott Hale, Ohad Kammar, Helen Margetts, and Tom Melham;

    Dario Stein

    (DPhil on probabilistic programming, 2017-2021);

    Sam Speight

    was a DPhil student primarily supervised by Samson Abramsky,

    Junghun Yoo

    was a DPhil student primarily supervised by Hongseok Yang, now a lecturer at Sheffield Hallam;

    Antonin Delpeuch

    (DPhil on string diagrams, cosupervised with Jamie Vicary, 2021-2022);

    Yuan Zhou

    (DPhil on probabilistic programming cosupervised with Hongseok Yang, Tom Rainforth, Yee Whye Teh, and Frank Wood, 2016-2021);

    Mathys Rennela

    (PhD on quantum programming languages, 2013-2019);

    Sander Uijlen

    (PhD on quantum logic, 2013-2019, cosupervised with Aleks Kissinger and Bart Jacobs);

    Ben Roberts

    (PhD on information flow security for distributed programming languages, 2013);

    Jad Ghalayini

    (MSc project on dependent types);

    Danel Ahman

    (MPhil project on normalization by evaluation);

    Ramana Kumar

    (MPhil essay on formalizing set theory);

    Kwok Cheung

    (MPhil essay on algebraic effects and partiality);

    Sohum Banerjea

    (MPhil essay on inference programming languages).

    Courses taught: Principles of Programming Languages

    in Oxford.

    Statistical Probabilistic Programming

    at Oxford, jointly with Luke Ong, Hugo Paquet and Paolo Perrone.

    Probabilistic Programming

    at Oregon PL Summer School 2019. A

    course on coalgebra

    jointly with

    Alexandra Silva

    in Nijmegen. Courses on

    Discrete mathematics I

    ,

    Semantics of programming languages

    , and

    Category theory and logic

    in Cambridge.

    Responsibilities and events

    Steering committees

    : IEEE Symposium on Logic in Computer Science

    (LICS, 2015-)

    ; Formal Structures in Computation and Deduction

    (FSCD, 2017-2020)

    . Organizing committee of Mathematical Foundations of Programming Semantics (MFPS, 2022-).

    Editorial board member: ACM Transactions on Quantum Computing.

    Programme committee member: 53rd ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2026, Associate Chair); 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2025); 41st Conference on Mathematical Foundations of Programming Semantics (MFPS 2025); 34th European Symposium on Programming (ESOP 2025), 32nd EACSL Annual Conference on Computer Science Logic 2024 (CSL 2024); 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023); PC co-chair: 6th Annual Conference on Applied Category Theory (ACT 2023); 26th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2023); 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022); 49th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2022); 30th European Symposium on Programming (ESOP 2021); 25th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2020); 24th ACM SIGPLAN International Conference on Functional Programming (ICFP 2019); 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019); PC chair: 34th Conference on Mathematical Foundations of Programming Semantics (MFPS XXXIV); 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017); 44th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2017); 26th European Symposium on Programming (ESOP 2017); Workshop on Syntax and Semantics of Low-level Languages (LOLA 2016); 10th International Workshop on Fixed Points in Computer Science (FICS 2015); 6th Conference on Algebra and Coalgebra in Computer Science (CALCO 2015); PC co-chair: 30th Conference on Mathematical Foundations of Programming Semantics (MFPS XXX); 3rd ACM-SIGPLAN Workshop on Higher-Order Programming with Effects (HOPE 2014); Combined 21st International Workshop on Expressiveness in Concurrency and 11th Workshop on Structured Operational Semantics (EXPRESS/SOS 2014); 11th International Workshop on Domain Theory and Applications (Domains XI); 18th ACM SIGPLAN International Conference on Functional Programming (ICFP 2013); Workshop on Syntax and Semantics of Low-Level Languages (LOLA 2013); 5th Conference on Algebra and Coalgebra in Computer Science (CALCO 2013); 21st Conference on Computer Science Logic (CSL 2012), 4th Workshop on Mathematically Structured Functional Programming (MSFP 2012); 11th International Workshop on Coalgebraic Methods in Computer Science (CMCS 2012); 9th Asian Symposium on Programming Languages and Systems (APLAS 2011); 4th Conference on Algebra and Coalgebra (CALCO 2011); 8th International Workshop on Structural Operational Semantics (SOS 2011); 7th International Workshop on Structural Operational Semantics (SOS 2010). External review committee of 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2012).

    Organizing committees: Scientific committee: Logic of Probabilistic Programming at CIRM (Jan 2022). Local organizer: ACT and MFPS 2024; LICS 2018; FSCD 2017; CALCO 2015 and MFPS XXXI; International Conference on Category Theory (CT 2014); Informal Workshop on Programming with Handlers (Cambridge June 2013).

    Some recent/upcoming invited or keynote talks: TLLA 2025; NWPT 2024; PROBPROG Sep 2023; VERIPROP 2023; BCS-FACS 2022 Seminar; LAFI 2022; CMCS 2022; FSCD 2021; MFPS 2021; OWLS Jan 2021; CPS 2020; OPLSS 2019; CIE 2019; PIHOC 2019; ICALP 2018; STOC 2018; Logic and learning 2018; British Logic Colloquium 2017; Uncertainty in Computation, 2016; QSLC 2016; WIP 2016; MFPS 2016; CHOCOLA, Jan 2016; S-REPLS2, Nov 2015; MFPS 2015.