64 citations · 65 across the 7 of their papers we have counts for
10 papers · 1 filter
Finitary Semantics for Full Ground Local State
Orpheas van Rooij, Ohad Kammar, Sam Lindley +1
Full ground local state (FGLS) refers to dynamically allocated mutable state that allows storing ground values and references. It is a key ingredient in many imperative algorithms…
NSynC: Normalised Synthesis of Computation
Zoey Shepherd, Ohad Kammar, Elizabeth Polgreen
Inductive program synthesis algorithms search a space of programs to find one that meets some specification. Enumerating according to the syntax of a programming language leads to…
An Equational Axiomatization of Dynamic Threads via Algebraic Effects: Presheaves on Finite Relations, Labelled Posets, and Parameterized Algebraic Theories
Ohad Kammar, Jack Liell-Cock, Sam Lindley +2
We use the theory of algebraic effects to give a complete equational axiomatization for dynamic threads. Our method is based on parameterized algebraic theories, which give a concr…
Modular abstract syntax trees (MAST): substitution tensors with second-class sorts
Marcelo P. Fiore, Ohad Kammar, Georg Moser +1
We adapt Fiore, Plotkin, and Turi's treatment of abstract syntax with binding, substitution, and holes to account for languages with second-class sorts. These situations include pr…
Coverage Semantics for Dependent Pattern Matching
Joseph Eremondi, Ohad Kammar
Dependent pattern matching is a key feature in dependently typed programming. However, there is a theory-practice disconnect: while many proof assistants implement pattern matching…
Two-sorted algebraic decompositions of Brookes's shared-state denotational semantics
Yotam Dvir, Ohad Kammar, Ori Lahav +1
We use a two sorted equational theory of algebraic effects to model concurrent shared state with preemptive interleaving, recovering Brookes's seminal 1996 trace-based model precis…