48 citations · 112 across the 21 of their papers we have counts for
11 papers · 1 filter
Isomorphism Theorems between Models of Mixed Choice (Revised)
Jean Goubault-Larrecq
We relate the so-called powercone models of mixed non-deterministic and probabilistic choice proposed by Tix, Keimel, Plotkin, Mislove, Ouaknine, Worrell, Morgan, and McIver, to ou…
Separating minimal valuations, point-continuous valuations and continuous valuations
Jean Goubault-Larrecq, Xiaodong Jia
We give two concrete examples of continuous valuations on dcpo's to separate minimal valuations, point-continuous valuations and continuous valuations: (1) Let be the…
A Domain-Theoretic Approach to Statistical Programming Languages
Jean Goubault-Larrecq, Xiaodong Jia, Clément Théron
We give a domain-theoretic semantics to a statistical programming language, using the plain old category of dcpos, in contrast to some more sophisticated recent proposals. Remarkab…
The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering
Jean Goubault-Larrecq, Simon Halfon, Prateek Karandikar +2
Elegant and general algorithms for handling upwards-closed and downwards-closed subsets of WQOs can be developed using the filter-based and ideal-based representation for these set…
Fooling the Parallel Or Tester with Probability
Jean Goubault-Larrecq
It is well-known that the higher-order language PCF is not fully abstract: there is a program - the so-called parallel or tester, meant to test whether its input behaves as a paral…
A Probabilistic and Non-Deterministic Call-by-Push-Value Language
Jean Goubault-Larrecq
There is no known way of giving a domain-theoretic semantics to higher-order probabilistic languages, in such a way that the involved domains are continuous or quasi-continuous - t…