default search action
Ohad Kammar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Xueying Qin
, Liam O'Connor
Shoggoth: A Formal Foundation for Strategic Rewriting. Proc. ACM Program. Lang. 8(POPL): 61-89 (2024) - [c10]Yotam Dvir
A Denotational Approach to Release/Acquire Concurrency. ESOP (2) 2024: 121-149 - 2023
- [d2]Xueying Qin
Artifact for Shoggoth - A Formal Foundation for Strategic Rewriting. Version 1. Zenodo, 2023 [all versions] - [d1]Xueying Qin
Artifact for Shoggoth - A Formal Foundation for Strategic Rewriting. Version 2. Zenodo, 2023 [all versions] - [i12]Ohad Kammar, Katarzyna Marek:
Idris TyRE: a dependently typed regex parser. CoRR abs/2305.04480 (2023) - [i11]Guillaume Allais, Edwin C. Brady, Nathan Corbyn, Ohad Kammar, Jeremy Yallop:
Frex: dependently-typed algebraic simplification. CoRR abs/2306.15375 (2023) - 2022
- [j8]Ohad Kammar
Fully abstract models for effectful λ-calculi via category-theoretic logical relations. Proc. ACM Program. Lang. 6(POPL): 1-28 (2022) - [c9]Yotam Dvir
An Algebraic Theory for Shared-State Concurrency. APLAS 2022: 3-24
2010 – 2019
- 2019
- [j7]Yannick Forster
On the expressive power of user-defined effects: Effect handlers, monadic reflection, delimited control. J. Funct. Program. 29: e15 (2019) - [j6]Matthijs Vákár
A domain theory for statistical probabilistic programming. Proc. ACM Program. Lang. 3(POPL): 36:1-36:29 (2019) - 2018
- [j5]Adam Scibior, Ohad Kammar, Zoubin Ghahramani:
Functional programming for modular Bayesian inference. Proc. ACM Program. Lang. 2(ICFP): 83:1-83:29 (2018) - [j4]Jeremy Yallop, Tamara von Glehn, Ohad Kammar:
Partially-static data as free extension of algebras. Proc. ACM Program. Lang. 2(ICFP): 100:1-100:30 (2018) - [j3]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) - [c8]Ohad Kammar, Dylan McDermott
Factorisation Systems for Logical Relations and Monadic Lifting in Type-and-effect System Semantics. MFPS 2018: 239-260 - [i10]Ohad Kammar, Dylan McDermott:
Factorisation systems for logical relations and monadic lifting in type-and-effect system semantics. CoRR abs/1804.03460 (2018) - [i9]Matthijs Vákár, Ohad Kammar, Sam Staton:
A Domain Theory for Statistical Probabilistic Programming. CoRR abs/1811.04196 (2018) - 2017
- [j2]Ohad Kammar, Matija Pretnar
No value restriction is needed for algebraic effects and handlers. J. Funct. Program. 27: e7 (2017) - [j1]Yannick Forster
On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control. Proc. ACM Program. Lang. 1(ICFP): 13:1-13:29 (2017) - [c7]Chris Heunen, Ohad Kammar, Sam Staton, Hongseok Yang:
A convenient category for higher-order probability theory. LICS 2017: 1-12 - [c6]Ohad Kammar, Paul Blain Levy, Sean K. Moss, Sam Staton:
A monad for full ground reference cells. LICS 2017: 1-12 - [i8]Chris Heunen, Ohad Kammar, Sam Staton, Hongseok Yang:
A Convenient Category for Higher-Order Probability Theory. CoRR abs/1701.02547 (2017) - [i7]Ohad Kammar, Paul Blain Levy, Sean K. Moss, Sam Staton:
A monad for full ground reference cells. CoRR abs/1702.04908 (2017) - [i6]Ohad Kammar, Dylan McDermott:
A monadic solution to the Cartwright-Felleisen-Wadler conjecture. CoRR abs/1707.06685 (2017) - [i5]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) - 2016
- [c5]Fredrik Dahlqvist, Vincent Danos, Ilias Garnier, Ohad Kammar:
Bayesian Inversion by ω-Complete Cone Duality. CONCUR 2016: 1:1-1:15 - [c4]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 - [i4]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) - [i3]Ohad Kammar, Matija Pretnar:
No value restriction is needed for algebraic effects and handlers. CoRR abs/1605.06938 (2016) - [i2]Yannick Forster, Ohad Kammar, Sam Lindley, Matija Pretnar:
On the Expressive Power of User-Defined Effects: Effect Handlers, Monadic Reflection, Delimited Control. CoRR abs/1610.09161 (2016) - 2015
- [i1]Ohad Kammar:
An absolute characterisation of locally determined omega-colimits. CoRR abs/1508.05072 (2015) - 2014
- [b1]Ohad Kammar:
Algebraic theory of type-and-effect systems. University of Edinburgh, UK, 2014 - 2013
- [c3]Ohad Kammar, Sam Lindley
Handlers in action. ICFP 2013: 145-158 - 2012
- [c2]Ohad Kammar, Gordon D. Plotkin:
Algebraic foundations for effect-dependent optimisations. POPL 2012: 349-360 - 2011
- [c1]Giorgio Bacci
On the Statistical Thermodynamics of Reversible Communicating Processes. CALCO 2011: 1-18
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-12-13 19:10 CET 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: