Loading...
Please wait, while we are loading the content...
Similar Documents
S-finite Kernels and Game Semantics for Probabilistic Programming
| Content Provider | Semantic Scholar |
|---|---|
| Author | Ong, Luke Vákár, Matthijs |
| Copyright Year | 2018 |
| Abstract | ion We can define a (call-by-name) small-step operational semantics for PIA as a finite kernel if we equip the syntax with a measurable space structure as described in, for instance, [8]. We can note that this induces a big-step semantics which is an s-finite kernel, as a supremum of anω-chain of finite kernels. We note that our denotational semantics is adequate with respect to this operational semantics. Our definability result now implies for the usual reasons that our model is fully abstract. Note that this in particular implies that deterministic program contexts of type void determine observational equivalence entirely. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://users.ox.ac.uk/~magd3996/research/pps2018poster.pdf |
| Alternate Webpage(s) | https://pps2018.soic.indiana.edu/files/2018/01/pps18-game-sem-prob-prog.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
