default search action
Sean K. Moss
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j2]Nathanael L. Ackerman
, Cameron E. Freer
Probabilistic Programming Interfaces for Random Graphs: Markov Categories, Graphons, and Nominal Sets. Proc. ACM Program. Lang. 8(POPL): 1819-1849 (2024) - [c6]Sam Lindley
Scoped Effects as Parameterized Algebraic Theories. ESOP (1) 2024: 3-21 - [i10]Sam Lindley, Cristina Matache, Sean K. Moss, Sam Staton, Nicolas Wu, Zhixuan Yang:
Scoped Effects as Parameterized Algebraic Theories. CoRR abs/2402.03103 (2024) - 2023
- [i9]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) - [i8]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) - 2022
- [c5]Sean K. Moss, Paolo Perrone
Probability monads with submonads of deterministic states. LICS 2022: 38:1-38:13 - [c4]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 - [i7]Sean K. Moss, Paolo Perrone:
Probability monads with submonads of deterministic states - Extended version. CoRR abs/2204.07003 (2022) - [i6]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) - [i5]Sean K. Moss, Paolo Perrone:
A category-theoretic proof of the ergodic decomposition theorem. CoRR abs/2207.07353 (2022) - 2021
- [c3]Cristina Matache, Sean K. Moss, Sam Staton:
Recursion and Sequentiality in Categories of Sheaves. FSCD 2021: 25:1-25:22 - [i4]Sean K. Moss, Tamara von Glehn:
Dialectica models of type theory. CoRR abs/2105.00283 (2021) - [i3]Cristina Matache, Sean K. Moss, Sam Staton:
Recursion and Sequentiality in Categories of Sheaves. CoRR abs/2105.02156 (2021)
2010 – 2019
- 2018
- [j1]Adam Scibior, Ohad Kammar, Matthijs Vákár
Denotational validation of higher-order Bayesian inference. Proc. ACM Program. Lang. 2(POPL): 60:1-60:29 (2018) - [c2]Sean K. Moss, Tamara von Glehn:
Dialectica models of type theory. LICS 2018: 739-748 - 2017
- [c1]Ohad Kammar, Paul Blain Levy, Sean K. Moss, Sam Staton:
A monad for full ground reference cells. LICS 2017: 1-12 - [i2]Ohad Kammar, Paul Blain Levy, Sean K. Moss, Sam Staton:
A monad for full ground reference cells. CoRR abs/1702.04908 (2017) - [i1]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)
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-06-10 21:20 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: