default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSam Staton
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Dario Stein
, Sam Staton:
Probabilistic Programming with Exact Conditions. J. ACM 71(1): 2:1-2:53 (2024)- [j14]Nathanael L. Ackerman, Cameron E. Freer, Younesse Kaddar, Jacek Karwowski, Sean K. Moss, Daniel M. Roy, Sam Staton, Hongseok Yang:
Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets. Proc. ACM Program. Lang. 8(POPL): 1819-1849 (2024) - [c46]Sam Lindley, Cristina Matache, Sean K. Moss, Sam Staton, Nicolas Wu, Zhixuan Yang:
Scoped Effects as Parameterized Algebraic Theories. ESOP (1) 2024: 3-21 - [i22]Sam Lindley, Cristina Matache, Sean K. Moss, Sam Staton, Nicolas Wu, Zhixuan Yang:
Scoped Effects as Parameterized Algebraic Theories. CoRR abs/2402.03103 (2024) - [i21]Jack Liell-Cock, Sam Staton:
Compositional imprecise probability. CoRR abs/2405.09391 (2024) - 2023
- [j13]Alexander K. Lew, Mathieu Huot, Sam Staton, Vikash K. Mansinghka:
ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Programs. Proc. ACM Program. Lang. 7(POPL): 121-153 (2023) - [j12]Swaraj Dash, Younesse Kaddar, Hugo Paquet, Sam Staton:
Affine Monads and Lazy Structures for Bayesian Programming. Proc. ACM Program. Lang. 7(POPL): 1338-1368 (2023) - [c45]Mathieu Huot, Alexander K. Lew, Vikash K. Mansinghka, Sam Staton:
ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs. LICS 2023: 1-14 - [c44]Younesse Kaddar, Sam Staton:
A model of stochastic memoization and name generation in probabilistic programming: categorical semantics via monads on presheaf categories. MFPS 2023 - [e4]Sam Staton, Christina Vasilakopoulou:
Proceedings of the Sixth International Conference on Applied Category Theory 2023, ACT 2023, University of Maryland, 31 July - 4 August 2023. EPTCS 397, 2023 [contents] - [i20]Mathieu Huot, Alexander K. Lew, Vikash K. Mansinghka, Sam Staton:
ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs. CoRR abs/2302.10636 (2023) - [i19]Cristina Matache, Sean K. Moss, Sam Staton, Ariadne Si Suo:
Denotational semantics for languages for inference: semirings, monads, and tensors. CoRR abs/2312.16694 (2023) - [i18]Nathanael L. Ackerman, Cameron E. Freer, Younesse Kaddar, Jacek Karwowski, Sean K. Moss, Daniel M. Roy, Sam Staton, Hongseok Yang:
Probabilistic programming interfaces for random graphs: Markov categories, graphons, and nominal sets. CoRR abs/2312.17127 (2023) - [i17]Dario Stein, Sam Staton:
Probabilistic Programming with Exact Conditions. CoRR abs/2312.17141 (2023) - 2022
- [j11]Mathieu Huot, Sam Staton, Matthijs Vákár:
Higher Order Automatic Differentiation of Higher Order Functions. Log. Methods Comput. Sci. 18(1) (2022) - [c43]Cristina Matache, Sean K. Moss, Sam Staton:
Concrete categories and higher-order recursion: With applications including probability, differentiability, and full abstraction. LICS 2022: 57:1-57:14 - [c42]Sam Staton, Ned Summers:
Quantum de Finetti Theorems as Categorical Limits, and Limits of State Spaces of C*-algebras. QPL 2022: 400-414 - [i16]Cristina Matache, Sean K. Moss, Sam Staton:
Concrete categories and higher-order recursion (With applications including probability, differentiability, and full abstraction). CoRR abs/2205.15917 (2022) - [i15]Alexander K. Lew, Mathieu Huot, Sam Staton, Vikash K. Mansinghka:
ADEV: Sound Automatic Differentiation of Expected Values of Probabilistic Programs. CoRR abs/2212.06386 (2022) - [i14]Swaraj Dash, Younesse Kaddar, Hugo Paquet, Sam Staton:
Affine Monads and Lazy Structures for Bayesian Programming. CoRR abs/2212.07250 (2022) - 2021
- [j10]Marcin Sabok, Sam Staton, Dario Stein, Michael Wolman:
Probabilistic programming semantics for name generation. Proc. ACM Program. Lang. 5(POPL): 1-29 (2021) - [c41]Sam Staton:
Some Formal Structures in Probability (Invited Talk). FSCD 2021: 4:1-4:4 - [c40]Cristina Matache, Sean K. Moss, Sam Staton:
Recursion and Sequentiality in Categories of Sheaves. FSCD 2021: 25:1-25:22 - [c39]Dario Stein, Sam Staton:
Compositional Semantics for Probabilistic Programs with Exact Conditioning. LICS 2021: 1-13 - [c38]Swaraj Dash, Sam Staton:
Monads for Measurable Queries in Probabilistic Databases. MFPS 2021: 34-50 - [i13]Mathieu Huot, Sam Staton, Matthijs Vákár:
Higher Order Automatic Differentiation of Higher Order Functions. CoRR abs/2101.06757 (2021) - [i12]Dario Stein, Sam Staton:
Compositional Semantics for Probabilistic Programs with Exact Conditioning. CoRR abs/2101.11351 (2021) - [i11]Cristina Matache, Sean K. Moss, Sam Staton:
Recursion and Sequentiality in Categories of Sheaves. CoRR abs/2105.02156 (2021) - 2020
- [j9]Mathys Rennela, Sam Staton:
Classical Control, Quantum Circuits and Linear Logic in Enriched Category Theory. Log. Methods Comput. Sci. 16(1) (2020) - [c37]Bart Jacobs, Sam Staton:
De Finetti's Construction as a Categorical Limit. CMCS 2020: 90-111 - [c36]Mathieu Huot, Sam Staton, Matthijs Vákár:
Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing. FoSSaCS 2020: 319-338 - [c35]Swaraj Dash, Sam Staton:
A Monad for Probabilistic Point Processes. ACT 2020: 19-32 - [i10]Mathieu Huot, Sam Staton, Matthijs Vákár:
Correctness of Automatic Differentiation via Diffeologies and Categorical Gluing. CoRR abs/2001.02209 (2020) - [i9]Marcin Sabok, Sam Staton, Dario Stein, Michael Wolman:
Probabilistic Programming Semantics for Name Generation. CoRR abs/2007.08638 (2020)
2010 – 2019
- 2019
- [j8]Matthijs Vákár, Ohad Kammar, Sam Staton:
A domain theory for statistical probabilistic programming. Proc. ACM Program. Lang. 3(POPL): 36:1-36:29 (2019) - [c34]Cristina Matache, Sam Staton:
A Sound and Complete Logic for Algebraic Effects. FoSSaCS 2019: 382-399 - [c33]Mathieu Huot, Sam Staton:
Quantum channels as a categorical completion. LICS 2019: 1-13 - [e3]Alexandra Silva, Sam Staton, Peter Sutton, Carla Umbach:
Language, Logic, and Computation - 12th International Tbilisi Symposium, TbiLLC 2017, Lagodekhi, Georgia, September 18-22, 2017, Revised Selected Papers. Lecture Notes in Computer Science 11456, Springer 2019, ISBN 978-3-662-59564-0 [contents] - [i8]Mathieu Huot, Sam Staton:
Quantum channels as a categorical completion. CoRR abs/1904.09600 (2019) - 2018
- [j7]Sam Staton, Sander Uijlen:
Effect algebras, presheaves, non-locality and contextuality. Inf. Comput. 261: 336-354 (2018) - [j6]Adam Scibior, Ohad Kammar, Matthijs Vákár, Sam Staton, Hongseok Yang, Yufei Cai, Klaus Ostermann, Sean K. Moss, Chris Heunen, Zoubin Ghahramani:
Denotational validation of higher-order Bayesian inference. Proc. ACM Program. Lang. 2(POPL): 60:1-60:29 (2018) - [c32]Sam Staton:
Probability Theory from a Programming Perspective (Invited Paper). ICALP 2018: 3:1-3:1 - [c31]Sam Staton, Dario Stein, Hongseok Yang, Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy:
The Beta-Bernoulli process and algebraic effects. ICALP 2018: 141:1-141:15 - [c30]Mathieu Huot, Sam Staton:
Universal Properties in Quantum Theory. QPL 2018: 213-223 - [c29]Sam Staton:
Preface. MFPS 2018: 1-3 - [c28]Mathys Rennela, Sam Staton:
Classical Control and Quantum Circuits in Enriched Category Theory. MFPS 2018: 257-279 - [e2]Sam Staton:
Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, MFPS 2018, Dalhousie University, Halifax, Canada, June 6-9, 2018. Electronic Notes in Theoretical Computer Science 341, Elsevier 2018 [contents] - [i7]Sam Staton, Dario Stein, Hongseok Yang, Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy:
The Beta-Bernoulli process and algebraic effects. CoRR abs/1802.09598 (2018) - [i6]Matthijs Vákár, Ohad Kammar, Sam Staton:
A Domain Theory for Statistical Probabilistic Programming. CoRR abs/1811.04196 (2018) - 2017
- [j5]Maciej Piróg, Sam Staton:
Backtracking with cut via a distributive law and left-zero monoids. J. Funct. Program. 27: e17 (2017) - [c27]Sam Staton:
Commutative Semantics for Probabilistic Programming. ESOP 2017: 855-879 - [c26]Chris Heunen, Ohad Kammar, Sam Staton, Hongseok Yang:
A convenient category for higher-order probability theory. LICS 2017: 1-12 - [c25]Ohad Kammar, Paul Blain Levy, Sean K. Moss, Sam Staton:
A monad for full ground reference cells. LICS 2017: 1-12 - [i5]Chris Heunen, Ohad Kammar, Sam Staton, Hongseok Yang:
A Convenient Category for Higher-Order Probability Theory. CoRR abs/1701.02547 (2017) - [i4]Ohad Kammar, Paul Blain Levy, Sean K. Moss, Sam Staton:
A monad for full ground reference cells. CoRR abs/1702.04908 (2017) - [i3]Adam Scibior, Ohad Kammar, Matthijs Vákár, Sam Staton, Hongseok Yang, Yufei Cai, Klaus Ostermann, Sean K. Moss, Chris Heunen, Zoubin Ghahramani:
Denotational validation of higher-order Bayesian inference. CoRR abs/1711.03219 (2017) - [i2]Mathys Rennela, Sam Staton:
Classical Control, Quantum Circuits and Linear Logic in Enriched Category Theory. CoRR abs/1711.05159 (2017) - 2016
- [c24]Sam Staton, Hongseok Yang, Frank D. Wood, Chris Heunen, Ohad Kammar:
Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints. LICS 2016: 525-534 - [c23]Mathys Rennela, Sam Staton, Robert Furber:
Infinite-Dimensionality in Quantum Foundations: W*-algebras as Presheaves over Matrix Algebras. QPL 2016: 161-173 - [i1]Sam Staton, Hongseok Yang, Chris Heunen, Ohad Kammar, Frank D. Wood:
Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints. CoRR abs/1601.04943 (2016) - 2015
- [c22]Sam Staton, Sander Uijlen:
Effect Algebras, Presheaves, Non-locality and Contextuality. ICALP (2) 2015: 401-413 - [c21]Sam Staton:
Algebraic Effects, Linearity, and Quantum Programming Languages. POPL 2015: 395-406 - [c20]Robert Atkey, Neil Ghani, Fredrik Nordvall Forsberg, Timothy Revell, Sam Staton:
Models for Polymorphism over Physical Dimension. TLCA 2015: 45-59 - [c19]Mathys Rennela, Sam Staton:
Complete Positivity and Natural Representation of Quantum Computations. MFPS 2015: 369-385 - 2014
- [j4]Rasmus Ejlers Møgelberg, Sam Staton:
Linear usage of state. Log. Methods Comput. Sci. 10(1) (2014) - [c18]Marcelo P. Fiore, Sam Staton:
Substitution, jumps, and algebraic effects. CSL-LICS 2014: 41:1-41:10 - [c17]Paul Blain Levy, Sam Staton:
Transition systems over games. CSL-LICS 2014: 64:1-64:10 - [c16]Bart Jacobs, Alexandra Silva, Sam Staton:
Preface. MFPS 2014: 1-2 - [e1]Bart Jacobs, Alexandra Silva, Sam Staton:
Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, MFPS 2014, Ithaca, NY, USA, June 12-15, 2014. Electronic Notes in Theoretical Computer Science 308, Elsevier 2014 [contents] - 2013
- [c15]Sam Staton:
An Algebraic Presentation of Predicate Logic - (Extended Abstract). FoSSaCS 2013: 401-417 - [c14]Sam Staton:
Instances of Computational Effects: An Algebraic Perspective. LICS 2013: 519 - [c13]Sam Staton, Paul Blain Levy:
Universal properties of impure programming languages. POPL 2013: 179-192 - [c12]Danel Ahman, Sam Staton:
Normalization by Evaluation and Algebraic Effects. MFPS 2013: 51-69 - [c11]Sam Staton:
Freyd categories are Enriched Lawvere Theories. WACT 2013: 197-206 - 2012
- [c10]Sam Staton, Kurt Debattista, Thomas Bashford-Rogers, Alan Chalmers:
Light Clustering for Dynamic Image Based Lighting. TPCG 2012: 17-24 - 2011
- [j3]Sam Staton:
Relating coalgebraic notions of bisimulation. Log. Methods Comput. Sci. 7(1) (2011) - [c9]Rasmus Ejlers Møgelberg, Sam Staton:
Linearly-Used State in Models of Call-by-Value. CALCO 2011: 298-313 - 2010
- [c8]Thorsten Altenkirch, Paul Blain Levy, Sam Staton:
Higher-Order Containers. CiE 2010: 11-20 - [c7]Sam Staton:
Completeness for Algebraic Theories of Local State. FoSSaCS 2010: 48-63 - [c6]Sam Staton, Glynn Winskel:
On the Expressivity of Symmetry in Event Structures. LICS 2010: 392-401
2000 – 2009
- 2009
- [j2]Marcelo P. Fiore, Sam Staton:
A congruence rule format for name-passing process calculi. Inf. Comput. 207(2): 209-236 (2009) - [c5]Sam Staton:
Relating Coalgebraic Notions of Bisimulation. CALCO 2009: 191-205 - [c4]Sam Staton:
Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names. MFPS 2009: 471-490 - 2008
- [c3]Sam Staton:
General Structural Operational Semantics through Categorical Logic. LICS 2008: 166-177 - 2007
- [b1]Samuel Staton:
Name-passing process calculi : operational models and structural operational semantics. University of Cambridge, UK, 2007 - 2006
- [j1]Marcelo P. Fiore, Sam Staton:
Comparing operational models of name-passing process calculi. Inf. Comput. 204(4): 524-560 (2006) - [c2]Marcelo P. Fiore, Sam Staton:
A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics. LICS 2006: 49-58 - 2004
- [c1]Marcelo P. Fiore, Sam Staton:
Comparing Operational Models of Name-Passing Process Calculi. CMCS 2004: 91-104
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
