Fully abstract models of the probabilistic -calculus
From MaRDI portal
Publication:5079740
DOI10.4230/LIPICS.CSL.2018.16MaRDI QIDQ5079740FDOQ5079740
Authors: Pierre Clairambault, Hugo Paquet 
Publication date: 28 May 2022
Recommendations
Cites Work
- On full abstraction for PCF: I, II and III
- Distributed probabilistic and quantum strategies
- Event structures with symmetry
- Asynchronous Games: Innocence Without Alternation
- Symmetry in concurrent games
- Not Enough Points Is Enough
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
- Title not available (Why is that?)
- Probabilistic game semantics
- CPO's of measures for nondeterminism
- Title not available (Why is that?)
- Innocent game models of untyped \(\lambda\)-calculus
- Title not available (Why is that?)
- Weighted relational models of typed lambda-calculi
- A lambda-calculus foundation for universal probabilistic programming
- Thin games with symmetry and concurrent Hyland-Ong games
- The Parallel Intensionally Fully Abstract Games Model of PCF
- The concurrent game semantics of probabilistic PCF
- A deterministic rewrite system for the probabilistic \(\lambda\)-calculus
- Probabilistic Böhm trees and probabilistic separation
Cited In (7)
- Title not available (Why is that?)
- The Benefit of Being Non-Lazy in Probabilistic λ-calculus
- A Type Theory for Probabilistic $$\lambda $$–calculus
- Zeta functions and the (linear) logic of Markov processes
- Towards a structural proof theory of probabilistic \(\mu\)-calculi
- Probabilistic approach to the lambda definability for fourth order types
- The geometry of Bayesian programming
This page was built for publication: Fully abstract models of the probabilistic \(\lambda\)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079740)
