32 citations · 61 across the 17 of their papers we have counts for
7 papers · 1 filter
Contextual MetaML: Syntax and Full Abstraction
Haoxuan Yin, Andrzej S. Murawski, C. -H. Luke Ong
MetaML-style metaprogramming languages allow programmers to construct, manipulate and run code. In the presence of higher-order references for code, ensuring type safety is challen…
Guaranteed Bounds on Posterior Distributions of Discrete Probabilistic Programs with Loops
Fabian Zaiser, Andrzej S. Murawski, C. -H. Luke Ong
We study the problem of bounding the posterior distribution of discrete probabilistic programs with unbounded support, loops, and conditioning. Loops pose the main difficulty in th…
Saturating automata for game semantics
Alex Dixon, Andrzej S. Murawski
Saturation is a fundamental game-semantic property satisfied by strategies that interpret higher-order concurrent programs. It states that the strategy must be closed under certain…
Exact Bayesian Inference on Discrete Models via Probability Generating Functions: A Probabilistic Programming Approach
Fabian Zaiser, Andrzej S. Murawski, Luke Ong
We present an exact Bayesian inference method for discrete statistical models, which can find exact solutions to a large class of discrete inference problems, even with infinite su…
Higher-Order Linearisability
Andrzej S. Murawski, Nikos Tzevelekos
Linearisability is a central notion for verifying concurrent libraries: a given library is proven safe if its operational history can be rearranged into a new sequential one which,…
Block structure vs scope extrusion: between innocence and omniscience
Andrzej S. Murawski, Nikos Tzevelekos
We study the semantic meaning of block structure using game semantics. To that end, we introduce the notion of block-innocent strategies and characterise call-by-value computation…