Search Results for author:
Found 3 papers, 1 papers with code
Exact Bayesian Inference on Discrete Models via Probability Generating Functions: A Probabilistic Programming Approach
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 support and continuous priors.
Leafy Automata for Higher-Order Concurrency
We show that the game semantics of any FICA term can be represented by traces of a leafy automaton.
Formal Languages and Automata Theory Programming Languages
Complete trace models of state and control
We consider a hierarchy of four typed call-by-value languages with either higher-order or ground-type references and with either callcc or no control operator. Our first result is a fully abstract trace model for the most expressive setting, featuring both higher-order references and callcc, constructed in the spirit of operational game semantics.
Logic in Computer Science Programming Languages
