Sam Staton : Publications

Journal papers

• [1]

  Affine Monads and Lazy Structures for Bayesian Programming

  Swaraj Dash‚ Younesse Kaddar‚ Hugo Paquet and Sam Staton

  In Proc. ACM Program. Lang.. Vol. 7. No. POPL. Pages 1338–1368. 2023.

  Details about Affine Monads and Lazy Structures for Bayesian Programming | BibTeX data for Affine Monads and Lazy Structures for Bayesian Programming | DOI (10.1145/3571239) | Link to Affine Monads and Lazy Structures for Bayesian Programming

• [2]

  ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Programs

  Alexander K. Lew‚ Mathieu Huot‚ Sam Staton and Vikash K. Mansinghka

  In Proc. ACM Program. Lang.. Vol. 7. No. POPL. Pages 121–153. 2023.

  Details about ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Programs | BibTeX data for ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Programs | DOI (10.1145/3571198) | Link to ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Programs

• [3]

  Quantum de Finetti Theorems as Categorical Limits‚ and Limits of State Spaces of C*−algebras

  Sam Staton and Ned Summers

  In CoRR. Vol. abs/2207.05832. 2022.

  Details about Quantum de Finetti Theorems as Categorical Limits‚ and Limits of State Spaces of C*−algebras | BibTeX data for Quantum de Finetti Theorems as Categorical Limits‚ and Limits of State Spaces of C*−algebras | DOI (10.48550/arXiv.2207.05832) | Link to Quantum de Finetti Theorems as Categorical Limits‚ and Limits of State Spaces of C*−algebras

• [4]

  Concrete categories and higher−order recursion (With applications including probability‚ differentiability‚ and full abstraction)

  Cristina Matache‚ Sean K. Moss and Sam Staton

  In CoRR. Vol. abs/2205.15917. 2022.

  Details about Concrete categories and higher−order recursion (With applications including probability‚ differentiability‚ and full abstraction) | BibTeX data for Concrete categories and higher−order recursion (With applications including probability‚ differentiability‚ and full abstraction) | DOI (10.48550/arXiv.2205.15917) | Link to Concrete categories and higher−order recursion (With applications including probability‚ differentiability‚ and full abstraction)

• [5]

  Higher Order Automatic Differentiation of Higher Order Functions

  Mathieu Huot‚ Sam Staton and Matthijs Vákár

  In Log. Methods Comput. Sci.. Vol. 18. No. 1. 2022.

  Details about Higher Order Automatic Differentiation of Higher Order Functions | BibTeX data for Higher Order Automatic Differentiation of Higher Order Functions | DOI (10.46298/lmcs-18(1:41)2022) | Link to Higher Order Automatic Differentiation of Higher Order Functions

• [6]

  Recursion and Sequentiality in Categories of Sheaves

  Cristina Matache‚ Sean K. Moss and Sam Staton

  In CoRR. Vol. abs/2105.02156. 2021.

  Details about Recursion and Sequentiality in Categories of Sheaves | BibTeX data for Recursion and Sequentiality in Categories of Sheaves | Link to Recursion and Sequentiality in Categories of Sheaves

• [7]

  Compositional Semantics for Probabilistic Programs with Exact Conditioning

  Dario Stein and Sam Staton

  In CoRR. Vol. abs/2101.11351. 2021.

  Details about Compositional Semantics for Probabilistic Programs with Exact Conditioning | BibTeX data for Compositional Semantics for Probabilistic Programs with Exact Conditioning | Link to Compositional Semantics for Probabilistic Programs with Exact Conditioning

• [8]

  Higher Order Automatic Differentiation of Higher Order Functions

  Mathieu Huot‚ Sam Staton and Matthijs Vákár

  In CoRR. Vol. abs/2101.06757. 2021.

  Details about Higher Order Automatic Differentiation of Higher Order Functions | BibTeX data for Higher Order Automatic Differentiation of Higher Order Functions | Link to Higher Order Automatic Differentiation of Higher Order Functions

• [9]

  Probabilistic programming semantics for name generation

  Marcin Sabok‚ Sam Staton‚ Dario Stein and Michael Wolman

  In Proc. ACM Program. Lang.. Vol. 5. No. POPL. Pages 1–29. 2021.

  Details about Probabilistic programming semantics for name generation | BibTeX data for Probabilistic programming semantics for name generation | DOI (10.1145/3434292) | Link to Probabilistic programming semantics for name generation

• [10]

  Probabilistic Programming Semantics for Name Generation

  Marcin Sabok‚ Sam Staton‚ Dario Stein and Michael Wolman

  In CoRR. Vol. abs/2007.08638. 2020.

  Details about Probabilistic Programming Semantics for Name Generation | BibTeX data for Probabilistic Programming Semantics for Name Generation | Link to Probabilistic Programming Semantics for Name Generation

• [11]

  Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing

  Mathieu Huot‚ Sam Staton and Matthijs Vákár

  In CoRR. Vol. abs/2001.02209. 2020.

  Details about Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing | BibTeX data for Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing | Link to Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing

• [12]

  Classical Control‚ Quantum Circuits and Linear Logic in Enriched Category Theory

  Mathys Rennela and Sam Staton

  In Log. Methods Comput. Sci.. Vol. 16. No. 1. 2020.

  Details about Classical Control‚ Quantum Circuits and Linear Logic in Enriched Category Theory | BibTeX data for Classical Control‚ Quantum Circuits and Linear Logic in Enriched Category Theory | DOI (10.23638/LMCS-16(1:30)2020) | Link to Classical Control‚ Quantum Circuits and Linear Logic in Enriched Category Theory

• [13]

  Quantum channels as a categorical completion

  Mathieu Huot and Sam Staton

  In CoRR. Vol. abs/1904.09600. 2019.

  Details about Quantum channels as a categorical completion | BibTeX data for Quantum channels as a categorical completion | Link to Quantum channels as a categorical completion

• [14]

  A domain theory for statistical probabilistic programming

  Matthijs Vákár‚ Ohad Kammar and Sam Staton

  In Proc. ACM Program. Lang.. Vol. 3. No. POPL. Pages 36:1–36:29. 2019.

  Details about A domain theory for statistical probabilistic programming | BibTeX data for A domain theory for statistical probabilistic programming | DOI (10.1145/3290349) | Link to A domain theory for statistical probabilistic programming

• [15]

  A Domain Theory for Statistical Probabilistic Programming

  Matthijs Vákár‚ Ohad Kammar and Sam Staton

  In CoRR. Vol. abs/1811.04196. 2018.

  Details about A Domain Theory for Statistical Probabilistic Programming | BibTeX data for A Domain Theory for Statistical Probabilistic Programming | Link to A Domain Theory for Statistical Probabilistic Programming

• [16]

  The Beta−Bernoulli process and algebraic effects

  Sam Staton‚ Dario Stein‚ Hongseok Yang‚ Nathanael L. Ackerman‚ Cameron E. Freer and Daniel M. Roy

  In CoRR. Vol. abs/1802.09598. 2018.

  Details about The Beta−Bernoulli process and algebraic effects | BibTeX data for The Beta−Bernoulli process and algebraic effects | Link to The Beta−Bernoulli process and algebraic effects

• [17]

  Denotational validation of higher−order Bayesian inference

  Adam Ścibior‚ Ohad Kammar‚ Matthijs Vákár‚ Sam Staton‚ Hongseok Yang‚ Yufei Cai‚ Klaus Ostermann‚ Sean K. Moss‚ Chris Heunen and Zoubin Ghahramani

  In Proc. ACM Program. Lang.. Vol. 2. No. POPL. Pages 60:1–60:29. 2018.

  Details about Denotational validation of higher−order Bayesian inference | BibTeX data for Denotational validation of higher−order Bayesian inference | DOI (10.1145/3158148) | Link to Denotational validation of higher−order Bayesian inference

• [18]

  Effect algebras‚ presheaves‚ non−locality and contextuality

  Sam Staton and Sander Uijlen

  In Inf. Comput.. Vol. 261. Pages 336–354. 2018.

  Details about Effect algebras‚ presheaves‚ non−locality and contextuality | BibTeX data for Effect algebras‚ presheaves‚ non−locality and contextuality | DOI (10.1016/j.ic.2018.02.012) | Link to Effect algebras‚ presheaves‚ non−locality and contextuality

• [19]

  Classical Control‚ Quantum Circuits and Linear Logic in Enriched Category Theory

  Mathys Rennela and Sam Staton

  In CoRR. Vol. abs/1711.05159. 2017.

  Details about Classical Control‚ Quantum Circuits and Linear Logic in Enriched Category Theory | BibTeX data for Classical Control‚ Quantum Circuits and Linear Logic in Enriched Category Theory | Link to Classical Control‚ Quantum Circuits and Linear Logic in Enriched Category Theory

• [20]

  Denotational validation of higher−order Bayesian inference

  Adam Ścibior‚ Ohad Kammar‚ Matthijs Vákár‚ Sam Staton‚ Hongseok Yang‚ Yufei Cai‚ Klaus Ostermann‚ Sean K. Moss‚ Chris Heunen and Zoubin Ghahramani

  In CoRR. Vol. abs/1711.03219. 2017.

  Details about Denotational validation of higher−order Bayesian inference | BibTeX data for Denotational validation of higher−order Bayesian inference | Link to Denotational validation of higher−order Bayesian inference

• [21]

  A monad for full ground reference cells

  Ohad Kammar‚ Paul Blain Levy‚ Sean K. Moss and Sam Staton

  In CoRR. Vol. abs/1702.04908. 2017.

  Details about A monad for full ground reference cells | BibTeX data for A monad for full ground reference cells | Link to A monad for full ground reference cells

• [22]

  A Convenient Category for Higher−Order Probability Theory

  Chris Heunen‚ Ohad Kammar‚ Sam Staton and Hongseok Yang

  In CoRR. Vol. abs/1701.02547. 2017.

  Details about A Convenient Category for Higher−Order Probability Theory | BibTeX data for A Convenient Category for Higher−Order Probability Theory | Link to A Convenient Category for Higher−Order Probability Theory

• [23]

  Backtracking with cut via a distributive law and left−zero monoids

  Maciej Pirόg and Sam Staton

  In J. Funct. Program.. Vol. 27. Pages e17. 2017.

  Details about Backtracking with cut via a distributive law and left−zero monoids | BibTeX data for Backtracking with cut via a distributive law and left−zero monoids | DOI (10.1017/S0956796817000077) | Link to Backtracking with cut via a distributive law and left−zero monoids

• [24]

  Semantics for probabilistic programming: higher−order functions‚ continuous distributions‚ and soft constraints

  Sam Staton‚ Hongseok Yang‚ Chris Heunen‚ Ohad Kammar and Frank D. Wood

  In CoRR. Vol. abs/1601.04943. 2016.

  Details about Semantics for probabilistic programming: higher−order functions‚ continuous distributions‚ and soft constraints | BibTeX data for Semantics for probabilistic programming: higher−order functions‚ continuous distributions‚ and soft constraints | Link to Semantics for probabilistic programming: higher−order functions‚ continuous distributions‚ and soft constraints

• [25]

  Freyd categories are Enriched Lawvere Theories

  Sam Staton

  In Electron. Notes Theor. Comput. Sci.. Vol. 303. Pages 197–206. 2014.

  Details about Freyd categories are Enriched Lawvere Theories | BibTeX data for Freyd categories are Enriched Lawvere Theories | DOI (10.1016/j.entcs.2014.02.010) | Link to Freyd categories are Enriched Lawvere Theories

• [26]

  Linear usage of state

  Rasmus Ejlers Møgelberg and Sam Staton

  In Log. Methods Comput. Sci.. Vol. 10. No. 1. 2014.

  Details about Linear usage of state | BibTeX data for Linear usage of state | DOI (10.2168/LMCS-10(1:17)2014) | Link to Linear usage of state

• [27]

  Relating coalgebraic notions of bisimulation

  Sam Staton

  In Log. Methods Comput. Sci.. Vol. 7. No. 1. 2011.

  Details about Relating coalgebraic notions of bisimulation | BibTeX data for Relating coalgebraic notions of bisimulation | DOI (10.2168/LMCS-7(1:13)2011) | Link to Relating coalgebraic notions of bisimulation

• [28]

  A congruence rule format for name−passing process calculi

  Marcelo P. Fiore and Sam Staton

  In Inf. Comput.. Vol. 207. No. 2. Pages 209–236. 2009.

  Details about A congruence rule format for name−passing process calculi | BibTeX data for A congruence rule format for name−passing process calculi | DOI (10.1016/j.ic.2007.12.005) | Link to A congruence rule format for name−passing process calculi

• [29]

  Comparing operational models of name−passing process calculi

  Marcelo P. Fiore and Sam Staton

  In Inf. Comput.. Vol. 204. No. 4. Pages 524–560. 2006.

  Details about Comparing operational models of name−passing process calculi | BibTeX data for Comparing operational models of name−passing process calculi | DOI (10.1016/j.ic.2005.08.004) | Link to Comparing operational models of name−passing process calculi

Conference papers

• [1]

  Concrete categories and higher−order recursion: With applications including probability‚ differentiability‚ and full abstraction

  Cristina Matache‚ Sean K. Moss and Sam Staton

  In Christel Baier and Dana Fisman, editors, LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science‚ Haifa‚ Israel‚ August 2 − 5‚ 2022. Pages 57:1–57:14. ACM. 2022.

  Details about Concrete categories and higher−order recursion: With applications including probability‚ differentiability‚ and full abstraction | BibTeX data for Concrete categories and higher−order recursion: With applications including probability‚ differentiability‚ and full abstraction | DOI (10.1145/3531130.3533370) | Link to Concrete categories and higher−order recursion: With applications including probability‚ differentiability‚ and full abstraction

• [2]

  Monads for Measurable Queries in Probabilistic Databases

  Swaraj Dash and Sam Staton

  In Ana Sokolova, editor, Proceedings 37th Conference on Mathematical Foundations of Programming Semantics‚ MFPS 2021‚ Hybrid: Salzburg‚ Austria and Online‚ 30th August − 2nd September‚ 2021. Vol. 351 of EPTCS. Pages 34–50. 2021.

  Details about Monads for Measurable Queries in Probabilistic Databases | BibTeX data for Monads for Measurable Queries in Probabilistic Databases | DOI (10.4204/EPTCS.351.3) | Link to Monads for Measurable Queries in Probabilistic Databases

• [3]

  Compositional Semantics for Probabilistic Programs with Exact Conditioning

  Dario Stein and Sam Staton

  In 36th Annual ACM/IEEE Symposium on Logic in Computer Science‚ LICS 2021‚ Rome‚ Italy‚ June 29 − July 2‚ 2021. Pages 1–13. IEEE. 2021.

  Details about Compositional Semantics for Probabilistic Programs with Exact Conditioning | BibTeX data for Compositional Semantics for Probabilistic Programs with Exact Conditioning | DOI (10.1109/LICS52264.2021.9470552) | Link to Compositional Semantics for Probabilistic Programs with Exact Conditioning

• [4]

  Recursion and Sequentiality in Categories of Sheaves

  Cristina Matache‚ Sean K. Moss and Sam Staton

  In Naoki Kobayashi, editor, 6th International Conference on Formal Structures for Computation and Deduction‚ FSCD 2021‚ July 17−24‚ 2021‚ Buenos Aires‚ Argentina (Virtual Conference). Vol. 195 of LIPIcs. Pages 25:1–25:22. Schloss Dagstuhl − Leibniz−Zentrum für Informatik. 2021.

  Details about Recursion and Sequentiality in Categories of Sheaves | BibTeX data for Recursion and Sequentiality in Categories of Sheaves | DOI (10.4230/LIPIcs.FSCD.2021.25) | Link to Recursion and Sequentiality in Categories of Sheaves

• [5]

  Some Formal Structures in Probability (Invited Talk)

  Sam Staton

  In Naoki Kobayashi, editor, 6th International Conference on Formal Structures for Computation and Deduction‚ FSCD 2021‚ July 17−24‚ 2021‚ Buenos Aires‚ Argentina (Virtual Conference). Vol. 195 of LIPIcs. Pages 4:1–4:4. Schloss Dagstuhl − Leibniz−Zentrum für Informatik. 2021.

  Details about Some Formal Structures in Probability (Invited Talk) | BibTeX data for Some Formal Structures in Probability (Invited Talk) | DOI (10.4230/LIPIcs.FSCD.2021.4) | Link to Some Formal Structures in Probability (Invited Talk)

• [6]

  A Monad for Probabilistic Point Processes

  Swaraj Dash and Sam Staton

  In David I. Spivak and Jamie Vicary, editors, Proceedings of the 3rd Annual International Applied Category Theory Conference 2020‚ ACT 2020‚ Cambridge‚ USA‚ 6−10th July 2020. Vol. 333 of EPTCS. Pages 19–32. 2020.

  Details about A Monad for Probabilistic Point Processes | BibTeX data for A Monad for Probabilistic Point Processes | DOI (10.4204/EPTCS.333.2) | Link to A Monad for Probabilistic Point Processes

• [7]

  Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing

  Mathieu Huot‚ Sam Staton and Matthijs Vákár

  In Jean Goubault−Larrecq and Barbara König, editors, Foundations of Software Science and Computation Structures − 23rd International Conference‚ FOSSACS 2020‚ Held as Part of the European Joint Conferences on Theory and Practice of Software‚ ETAPS 2020‚ Dublin‚ Ireland‚ April 25−30‚ 2020‚ Proceedings. Vol. 12077 of Lecture Notes in Computer Science. Pages 319–338. Springer. 2020.

  Details about Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing | BibTeX data for Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing | DOI (10.1007/978-3-030-45231-5\_17) | Link to Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing

• [8]

  De Finetti's Construction as a Categorical Limit

  Bart Jacobs and Sam Staton

  In Daniela Petrisan and Jurriaan Rot, editors, Coalgebraic Methods in Computer Science − 15th IFIP WG 1.3 International Workshop‚ CMCS 2020‚ Colocated with ETAPS 2020‚ Dublin‚ Ireland‚ April 25−26‚ 2020‚ Proceedings. Vol. 12094 of Lecture Notes in Computer Science. Pages 90–111. Springer. 2020.

  Details about De Finetti's Construction as a Categorical Limit | BibTeX data for De Finetti's Construction as a Categorical Limit | DOI (10.1007/978-3-030-57201-3\_6) | Link to De Finetti's Construction as a Categorical Limit

• [9]

  Quantum channels as a categorical completion

  Mathieu Huot and Sam Staton

  In 34th Annual ACM/IEEE Symposium on Logic in Computer Science‚ LICS 2019‚ Vancouver‚ BC‚ Canada‚ June 24−27‚ 2019. Pages 1–13. IEEE. 2019.

  Details about Quantum channels as a categorical completion | BibTeX data for Quantum channels as a categorical completion | DOI (10.1109/LICS.2019.8785700) | Link to Quantum channels as a categorical completion

• [10]

  A Sound and Complete Logic for Algebraic Effects

  Cristina Matache and Sam Staton

  In Mikolaj Bojanczyk and Alex Simpson, editors, Foundations of Software Science and Computation Structures − 22nd International Conference‚ FOSSACS 2019‚ Held as Part of the European Joint Conferences on Theory and Practice of Software‚ ETAPS 2019‚ Prague‚ Czech Republic‚ April 6−11‚ 2019‚ Proceedings. Vol. 11425 of Lecture Notes in Computer Science. Pages 382–399. Springer. 2019.

  Details about A Sound and Complete Logic for Algebraic Effects | BibTeX data for A Sound and Complete Logic for Algebraic Effects | DOI (10.1007/978-3-030-17127-8\_22) | Link to A Sound and Complete Logic for Algebraic Effects

• [11]

  Classical Control and Quantum Circuits in Enriched Category Theory

  Mathys Rennela and Sam Staton

  In Sam Staton, editor, Proceedings of the Thirty−Fourth Conference on the Mathematical Foundations of Programming Semantics‚ MFPS 2018‚ Dalhousie University‚ Halifax‚ Canada‚ June 6−9‚ 2018. Vol. 341 of Electronic Notes in Theoretical Computer Science. Pages 257–279. Elsevier. 2018.

  Details about Classical Control and Quantum Circuits in Enriched Category Theory | BibTeX data for Classical Control and Quantum Circuits in Enriched Category Theory | DOI (10.1016/j.entcs.2018.03.027) | Link to Classical Control and Quantum Circuits in Enriched Category Theory

• [12]

  Preface

  Sam Staton

  In Sam Staton, editor, Proceedings of the Thirty−Fourth Conference on the Mathematical Foundations of Programming Semantics‚ MFPS 2018‚ Dalhousie University‚ Halifax‚ Canada‚ June 6−9‚ 2018. Vol. 341 of Electronic Notes in Theoretical Computer Science. Pages 1–3. Elsevier. 2018.

  Details about Preface | BibTeX data for Preface | DOI (10.1016/j.entcs.2018.11.001) | Link to Preface

• [13]

  Universal Properties in Quantum Theory

  Mathieu Huot and Sam Staton

  In Peter Selinger and Giulio Chiribella, editors, Proceedings 15th International Conference on Quantum Physics and Logic‚ QPL 2018‚ Halifax‚ Canada‚ 3−7th June 2018. Vol. 287 of EPTCS. Pages 213–223. 2018.

  Details about Universal Properties in Quantum Theory | BibTeX data for Universal Properties in Quantum Theory | DOI (10.4204/EPTCS.287.12) | Link to Universal Properties in Quantum Theory

• [14]

  The Beta−Bernoulli process and algebraic effects

  Sam Staton‚ Dario Stein‚ Hongseok Yang‚ Nathanael L. Ackerman‚ Cameron E. Freer and Daniel M. Roy

  In Ioannis Chatzigiannakis‚ Christos Kaklamanis‚ Dániel Marx and Donald Sannella, editors, 45th International Colloquium on Automata‚ Languages‚ and Programming‚ ICALP 2018‚ July 9−13‚ 2018‚ Prague‚ Czech Republic. Vol. 107 of LIPIcs. Pages 141:1–141:15. Schloss Dagstuhl − Leibniz−Zentrum für Informatik. 2018.

  Details about The Beta−Bernoulli process and algebraic effects | BibTeX data for The Beta−Bernoulli process and algebraic effects | DOI (10.4230/LIPIcs.ICALP.2018.141) | Link to The Beta−Bernoulli process and algebraic effects

• [15]

  Probability Theory from a Programming Perspective (Invited Paper)

  Sam Staton

  In Ioannis Chatzigiannakis‚ Christos Kaklamanis‚ Dániel Marx and Donald Sannella, editors, 45th International Colloquium on Automata‚ Languages‚ and Programming‚ ICALP 2018‚ July 9−13‚ 2018‚ Prague‚ Czech Republic. Vol. 107 of LIPIcs. Pages 3:1–3:1. Schloss Dagstuhl − Leibniz−Zentrum für Informatik. 2018.

  Details about Probability Theory from a Programming Perspective (Invited Paper) | BibTeX data for Probability Theory from a Programming Perspective (Invited Paper) | DOI (10.4230/LIPIcs.ICALP.2018.3) | Link to Probability Theory from a Programming Perspective (Invited Paper)

• [16]

  A monad for full ground reference cells

  Ohad Kammar‚ Paul Blain Levy‚ Sean K. Moss and Sam Staton

  In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science‚ LICS 2017‚ Reykjavik‚ Iceland‚ June 20−23‚ 2017. Pages 1–12. IEEE Computer Society. 2017.

  Details about A monad for full ground reference cells | BibTeX data for A monad for full ground reference cells | DOI (10.1109/LICS.2017.8005109) | Link to A monad for full ground reference cells

• [17]

  A convenient category for higher−order probability theory

  Chris Heunen‚ Ohad Kammar‚ Sam Staton and Hongseok Yang

  In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science‚ LICS 2017‚ Reykjavik‚ Iceland‚ June 20−23‚ 2017. Pages 1–12. IEEE Computer Society. 2017.

  Details about A convenient category for higher−order probability theory | BibTeX data for A convenient category for higher−order probability theory | DOI (10.1109/LICS.2017.8005137) | Link to A convenient category for higher−order probability theory

• [18]

  Commutative Semantics for Probabilistic Programming

  Sam Staton

  In Hongseok Yang, editor, Programming Languages and Systems − 26th European Symposium on Programming‚ ESOP 2017‚ Held as Part of the European Joint Conferences on Theory and Practice of Software‚ ETAPS 2017‚ Uppsala‚ Sweden‚ April 22−29‚ 2017‚ Proceedings. Vol. 10201 of Lecture Notes in Computer Science. Pages 855–879. Springer. 2017.

  Details about Commutative Semantics for Probabilistic Programming | BibTeX data for Commutative Semantics for Probabilistic Programming | DOI (10.1007/978-3-662-54434-1\_32) | Link to Commutative Semantics for Probabilistic Programming

• [19]

  Infinite−Dimensionality in Quantum Foundations: W*−algebras as Presheaves over Matrix Algebras

  Mathys Rennela‚ Sam Staton and Robert Furber

  In Ross Duncan and Chris Heunen, editors, Proceedings 13th International Conference on Quantum Physics and Logic‚ QPL 2016‚ Glasgow‚ Scotland‚ 6−10 June 2016. Vol. 236 of EPTCS. Pages 161–173. 2016.

  Details about Infinite−Dimensionality in Quantum Foundations: W*−algebras as Presheaves over Matrix Algebras | BibTeX data for Infinite−Dimensionality in Quantum Foundations: W*−algebras as Presheaves over Matrix Algebras | DOI (10.4204/EPTCS.236.11) | Link to Infinite−Dimensionality in Quantum Foundations: W*−algebras as Presheaves over Matrix Algebras

• [20]

  Semantics for probabilistic programming: higher−order functions‚ continuous distributions‚ and soft constraints

  Sam Staton‚ Hongseok Yang‚ Frank D. Wood‚ Chris Heunen and Ohad Kammar

  In Martin Grohe‚ Eric Koskinen and Natarajan Shankar, editors, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science‚ LICS '16‚ New York‚ NY‚ USA‚ July 5−8‚ 2016. Pages 525–534. ACM. 2016.

  Details about Semantics for probabilistic programming: higher−order functions‚ continuous distributions‚ and soft constraints | BibTeX data for Semantics for probabilistic programming: higher−order functions‚ continuous distributions‚ and soft constraints | DOI (10.1145/2933575.2935313) | Link to Semantics for probabilistic programming: higher−order functions‚ continuous distributions‚ and soft constraints

• [21]

  Complete Positivity and Natural Representation of Quantum Computations

  Mathys Rennela and Sam Staton

  In Dan R. Ghica, editor, The 31st Conference on the Mathematical Foundations of Programming Semantics‚ MFPS 2015‚ Nijmegen‚ The Netherlands‚ June 22−25‚ 2015. Vol. 319 of Electronic Notes in Theoretical Computer Science. Pages 369–385. Elsevier. 2015.

  Details about Complete Positivity and Natural Representation of Quantum Computations | BibTeX data for Complete Positivity and Natural Representation of Quantum Computations | DOI (10.1016/j.entcs.2015.12.022) | Link to Complete Positivity and Natural Representation of Quantum Computations

• [22]

  Models for Polymorphism over Physical Dimension

  Robert Atkey‚ Neil Ghani‚ Fredrik Nordvall Forsberg‚ Timothy Revell and Sam Staton

  In Thorsten Altenkirch, editor, 13th International Conference on Typed Lambda Calculi and Applications‚ TLCA 2015‚ July 1−3‚ 2015‚ Warsaw‚ Poland. Vol. 38 of LIPIcs. Pages 45–59. Schloss Dagstuhl − Leibniz−Zentrum für Informatik. 2015.

  Details about Models for Polymorphism over Physical Dimension | BibTeX data for Models for Polymorphism over Physical Dimension | DOI (10.4230/LIPIcs.TLCA.2015.45) | Link to Models for Polymorphism over Physical Dimension

• [23]

  Algebraic Effects‚ Linearity‚ and Quantum Programming Languages

  Sam Staton

  In Sriram K. Rajamani and David Walker, editors, Proceedings of the 42nd Annual ACM SIGPLAN−SIGACT Symposium on Principles of Programming Languages‚ POPL 2015‚ Mumbai‚ India‚ January 15−17‚ 2015. Pages 395–406. ACM. 2015.

  Details about Algebraic Effects‚ Linearity‚ and Quantum Programming Languages | BibTeX data for Algebraic Effects‚ Linearity‚ and Quantum Programming Languages | DOI (10.1145/2676726.2676999) | Link to Algebraic Effects‚ Linearity‚ and Quantum Programming Languages

• [24]

  Effect Algebras‚ Presheaves‚ Non−locality and Contextuality

  Sam Staton and Sander Uijlen

  In Magnús M. Halldόrsson‚ Kazuo Iwama‚ Naoki Kobayashi and Bettina Speckmann, editors, Automata‚ Languages‚ and Programming − 42nd International Colloquium‚ ICALP 2015‚ Kyoto‚ Japan‚ July 6−10‚ 2015‚ Proceedings‚ Part II. Vol. 9135 of Lecture Notes in Computer Science. Pages 401–413. Springer. 2015.

  Details about Effect Algebras‚ Presheaves‚ Non−locality and Contextuality | BibTeX data for Effect Algebras‚ Presheaves‚ Non−locality and Contextuality | DOI (10.1007/978-3-662-47666-6\_32) | Link to Effect Algebras‚ Presheaves‚ Non−locality and Contextuality

• [25]

  Preface

  Bart Jacobs‚ Alexandra Silva and Sam Staton

  In Bart Jacobs‚ Alexandra Silva and Sam Staton, editors, Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics‚ MFPS 2014‚ Ithaca‚ NY‚ USA‚ June 12−15‚ 2014. Vol. 308 of Electronic Notes in Theoretical Computer Science. Pages 1–2. Elsevier. 2014.

  Details about Preface | BibTeX data for Preface | DOI (10.1016/j.entcs.2014.10.001) | Link to Preface

• [26]

  Transition systems over games

  Paul Blain Levy and Sam Staton

  In Thomas A. Henzinger and Dale Miller, editors, Joint Meeting of the Twenty−Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty−Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)‚ CSL−LICS '14‚ Vienna‚ Austria‚ July 14 − 18‚ 2014. Pages 64:1–64:10. ACM. 2014.

  Details about Transition systems over games | BibTeX data for Transition systems over games | DOI (10.1145/2603088.2603150) | Link to Transition systems over games

• [27]

  Substitution‚ jumps‚ and algebraic effects

  Marcelo P. Fiore and Sam Staton

  In Thomas A. Henzinger and Dale Miller, editors, Joint Meeting of the Twenty−Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty−Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)‚ CSL−LICS '14‚ Vienna‚ Austria‚ July 14 − 18‚ 2014. Pages 41:1–41:10. ACM. 2014.

  Details about Substitution‚ jumps‚ and algebraic effects | BibTeX data for Substitution‚ jumps‚ and algebraic effects | DOI (10.1145/2603088.2603163) | Link to Substitution‚ jumps‚ and algebraic effects

• [28]

  Normalization by Evaluation and Algebraic Effects

  Danel Ahman and Sam Staton

  In Dexter Kozen and Michael W. Mislove, editors, Proceedings of the Twenty−ninth Conference on the Mathematical Foundations of Programming Semantics‚ MFPS 2013‚ New Orleans‚ LA‚ USA‚ June 23−25‚ 2013. Vol. 298 of Electronic Notes in Theoretical Computer Science. Pages 51–69. Elsevier. 2013.

  Details about Normalization by Evaluation and Algebraic Effects | BibTeX data for Normalization by Evaluation and Algebraic Effects | DOI (10.1016/j.entcs.2013.09.007) | Link to Normalization by Evaluation and Algebraic Effects

• [29]

  Universal properties of impure programming languages

  Sam Staton and Paul Blain Levy

  In Roberto Giacobazzi and Radhia Cousot, editors, The 40th Annual ACM SIGPLAN−SIGACT Symposium on Principles of Programming Languages‚ POPL '13‚ Rome‚ Italy − January 23 − 25‚ 2013. Pages 179–192. ACM. 2013.

  Details about Universal properties of impure programming languages | BibTeX data for Universal properties of impure programming languages | DOI (10.1145/2429069.2429091) | Link to Universal properties of impure programming languages

• [30]

  Instances of Computational Effects: An Algebraic Perspective

  Sam Staton

  In 28th Annual ACM/IEEE Symposium on Logic in Computer Science‚ LICS 2013‚ New Orleans‚ LA‚ USA‚ June 25−28‚ 2013. Pages 519. IEEE Computer Society. 2013.

  Details about Instances of Computational Effects: An Algebraic Perspective | BibTeX data for Instances of Computational Effects: An Algebraic Perspective | DOI (10.1109/LICS.2013.58) | Link to Instances of Computational Effects: An Algebraic Perspective

• [31]

  An Algebraic Presentation of Predicate Logic − (Extended Abstract)

  Sam Staton

  In Frank Pfenning, editor, Foundations of Software Science and Computation Structures − 16th International Conference‚ FOSSACS 2013‚ Held as Part of the European Joint Conferences on Theory and Practice of Software‚ ETAPS 2013‚ Rome‚ Italy‚ March 16−24‚ 2013. Proceedings. Vol. 7794 of Lecture Notes in Computer Science. Pages 401–417. Springer. 2013.

  Details about An Algebraic Presentation of Predicate Logic − (Extended Abstract) | BibTeX data for An Algebraic Presentation of Predicate Logic − (Extended Abstract) | DOI (10.1007/978-3-642-37075-5\_26) | Link to An Algebraic Presentation of Predicate Logic − (Extended Abstract)

• [32]

  Light Clustering for Dynamic Image Based Lighting

  Sam Staton‚ Kurt Debattista‚ Thomas Bashford−Rogers and Alan Chalmers

  In Hamish A. Carr and Silvester Czanner, editors, Theory and Practice of Computer Graphics‚ Rutherford‚ United Kingdom‚ 2012. Proceedings. Pages 17–24. Eurographics Association. 2012.

  Details about Light Clustering for Dynamic Image Based Lighting | BibTeX data for Light Clustering for Dynamic Image Based Lighting | DOI (10.2312/LocalChapterEvents/TPCG/TPCG12/017-024) | Link to Light Clustering for Dynamic Image Based Lighting

• [33]

  Linearly−Used State in Models of Call−by−Value

  Rasmus Ejlers Møgelberg and Sam Staton

  In Andrea Corradini‚ Bartek Klin and Corina Cîrstea, editors, Algebra and Coalgebra in Computer Science − 4th International Conference‚ CALCO 2011‚ Winchester‚ UK‚ August 30 − September 2‚ 2011. Proceedings. Vol. 6859 of Lecture Notes in Computer Science. Pages 298–313. Springer. 2011.

  Details about Linearly−Used State in Models of Call−by−Value | BibTeX data for Linearly−Used State in Models of Call−by−Value | DOI (10.1007/978-3-642-22944-2\_21) | Link to Linearly−Used State in Models of Call−by−Value

• [34]

  On the Expressivity of Symmetry in Event Structures

  Sam Staton and Glynn Winskel

  In Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science‚ LICS 2010‚ 11−14 July 2010‚ Edinburgh‚ United Kingdom. Pages 392–401. IEEE Computer Society. 2010.

  Details about On the Expressivity of Symmetry in Event Structures | BibTeX data for On the Expressivity of Symmetry in Event Structures | DOI (10.1109/LICS.2010.37) | Link to On the Expressivity of Symmetry in Event Structures

• [35]

  Completeness for Algebraic Theories of Local State

  Sam Staton

  In C.−H. Luke Ong, editor, Foundations of Software Science and Computational Structures‚ 13th International Conference‚ FOSSACS 2010‚ Held as Part of the Joint European Conferences on Theory and Practice of Software‚ ETAPS 2010‚ Paphos‚ Cyprus‚ March 20−28‚ 2010. Proceedings. Vol. 6014 of Lecture Notes in Computer Science. Pages 48–63. Springer. 2010.

  Details about Completeness for Algebraic Theories of Local State | BibTeX data for Completeness for Algebraic Theories of Local State | DOI (10.1007/978-3-642-12032-9\_5) | Link to Completeness for Algebraic Theories of Local State

• [36]

  Higher−Order Containers

  Thorsten Altenkirch‚ Paul Blain Levy and Sam Staton

  In Fernando Ferreira‚ Benedikt Löwe‚ Elvira Mayordomo and Luís Mendes Gomes, editors, Programs‚ Proofs‚ Processes‚ 6th Conference on Computability in Europe‚ CiE 2010‚ Ponta Delgada‚ Azores‚ Portugal‚ June 30 − July 4‚ 2010. Proceedings. Vol. 6158 of Lecture Notes in Computer Science. Pages 11–20. Springer. 2010.

  Details about Higher−Order Containers | BibTeX data for Higher−Order Containers | DOI (10.1007/978-3-642-13962-8\_2) | Link to Higher−Order Containers

• [37]

  Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names

  Sam Staton

  In Samson Abramsky‚ Michael W. Mislove and Catuscia Palamidessi, editors, Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics‚ MFPS 2009‚ Oxford‚ UK‚ April 3−7‚ 2009. Vol. 249 of Electronic Notes in Theoretical Computer Science. Pages 471–490. Elsevier. 2009.

  Details about Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names | BibTeX data for Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names | DOI (10.1016/j.entcs.2009.07.103) | Link to Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names

• [38]

  Relating Coalgebraic Notions of Bisimulation

  Sam Staton

  In Alexander Kurz‚ Marina Lenisa and Andrzej Tarlecki, editors, Algebra and Coalgebra in Computer Science‚ Third International Conference‚ CALCO 2009‚ Udine‚ Italy‚ September 7−10‚ 2009. Proceedings. Vol. 5728 of Lecture Notes in Computer Science. Pages 191–205. Springer. 2009.

  Details about Relating Coalgebraic Notions of Bisimulation | BibTeX data for Relating Coalgebraic Notions of Bisimulation | DOI (10.1007/978-3-642-03741-2\_14) | Link to Relating Coalgebraic Notions of Bisimulation

• [39]

  General Structural Operational Semantics through Categorical Logic

  Sam Staton

  In Proceedings of the Twenty−Third Annual IEEE Symposium on Logic in Computer Science‚ LICS 2008‚ 24−27 June 2008‚ Pittsburgh‚ PA‚ USA. Pages 166–177. IEEE Computer Society. 2008.

  Details about General Structural Operational Semantics through Categorical Logic | BibTeX data for General Structural Operational Semantics through Categorical Logic | DOI (10.1109/LICS.2008.43) | Link to General Structural Operational Semantics through Categorical Logic

• [40]

  A Congruence Rule Format for Name−Passing Process Calculi from Mathematical Structural Operational Semantics

  Marcelo P. Fiore and Sam Staton

  In 21th IEEE Symposium on Logic in Computer Science (LICS 2006)‚ 12−15 August 2006‚ Seattle‚ WA‚ USA‚ Proceedings. Pages 49–58. IEEE Computer Society. 2006.

  Details about A Congruence Rule Format for Name−Passing Process Calculi from Mathematical Structural Operational Semantics | BibTeX data for A Congruence Rule Format for Name−Passing Process Calculi from Mathematical Structural Operational Semantics | DOI (10.1109/LICS.2006.7) | Link to A Congruence Rule Format for Name−Passing Process Calculi from Mathematical Structural Operational Semantics

• [41]

  Comparing Operational Models of Name−Passing Process Calculi

  Marcelo P. Fiore and Sam Staton

  In Jirí Adámek and Stefan Milius, editors, Proceedings of the Workshop on Coalgebraic Methods in Computer Science‚ CMCS 2004‚ Barcelona‚ Spain‚ March 27−29‚ 2004. Vol. 106 of Electronic Notes in Theoretical Computer Science. Pages 91–104. Elsevier. 2004.

  Details about Comparing Operational Models of Name−Passing Process Calculi | BibTeX data for Comparing Operational Models of Name−Passing Process Calculi | DOI (10.1016/j.entcs.2004.02.025) | Link to Comparing Operational Models of Name−Passing Process Calculi

Miscellaneous

• [1]

  Note: Not all publications are listed here. Please see people pages.

   

  2099.

  Details about Note: Not all publications are listed here. Please see people pages. | BibTeX data for Note: Not all publications are listed here. Please see people pages.