Ohad Kammar

Orcid: 0000-0002-2071-0929

According to our database1, Ohad Kammar authored at least 23 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Shoggoth: A Formal Foundation for Strategic Rewriting.
Proc. ACM Program. Lang., January, 2024

A Denotational Approach to Release/Acquire Concurrency.
Proceedings of the Programming Languages and Systems, 2024

2023
Frex: dependently-typed algebraic simplification.
CoRR, 2023

Idris TyRE: a dependently typed regex parser.
CoRR, 2023

2022
Fully abstract models for effectful λ-calculi via category-theoretic logical relations.
Proc. ACM Program. Lang., 2022

An Algebraic Theory for Shared-State Concurrency.
Proceedings of the Programming Languages and Systems - 20th Asian Symposium, 2022

2019
A domain theory for statistical probabilistic programming.
Proc. ACM Program. Lang., 2019

2018
Partially-static data as free extension of algebras.
Proc. ACM Program. Lang., 2018

Denotational validation of higher-order Bayesian inference.
Proc. ACM Program. Lang., 2018

Functional programming for modular Bayesian inference.
Proc. ACM Program. Lang., 2018

Factorisation Systems for Logical Relations and Monadic Lifting in Type-and-effect System Semantics.
Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

2017
On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control.
Proc. ACM Program. Lang., 2017

No value restriction is needed for algebraic effects and handlers.
J. Funct. Program., 2017

A monadic solution to the Cartwright-Felleisen-Wadler conjecture.
CoRR, 2017

A monad for full ground reference cells.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

A convenient category for higher-order probability theory.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Bayesian Inversion by ω-Complete Cone Duality.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
An absolute characterisation of locally determined omega-colimits.
CoRR, 2015

2014
Algebraic theory of type-and-effect systems.
PhD thesis, 2014

2013
Handlers in action.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

2012
Algebraic foundations for effect-dependent optimisations.
Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

2011
On the Statistical Thermodynamics of Reversible Communicating Processes.
Proceedings of the Algebra and Coalgebra in Computer Science, 2011


  Loading...