Fully abstract models of the probabilistic -calculus

DOI10.4230/LIPICS.CSL.2018.16MaRDI QIDQ5079740zbMATH OpenFDO

Authors Pierre Clairambault, Hugo Paquet

Publication date 28 May 2022

zbMATH Keywords

full abstractiongame semantics\(\lambda\)-calculusprobabilistic programmingrelational model

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

• Full abstraction for probabilistic PCF
• On quantum and probabilistic linear lambda-calculi (extended abstract)
• Lambda calculus and probabilistic computation
• Probabilistic coherence spaces are fully abstract for probabilistic PCF
• The Benefit of Being Non-Lazy in Probabilistic λ-calculus

Cites work

• scientific article; zbMATH DE number 3875232 (Why is no real title available?)
• scientific article; zbMATH DE number 1223612 (Why is no real title available?)
• scientific article; zbMATH DE number 2134913 (Why is no real title available?)
• A deterministic rewrite system for the probabilistic \(\lambda\)-calculus
• A lambda-calculus foundation for universal probabilistic programming
• Asynchronous Games: Innocence Without Alternation
• CPO's of measures for nondeterminism
• Distributed probabilistic and quantum strategies
• Event structures with symmetry
• Innocent game models of untyped \(\lambda\)-calculus
• Not Enough Points Is Enough
• On full abstraction for PCF: I, II and III
• Probabilistic Böhm trees and probabilistic separation
• Probabilistic coherence spaces as a model of higher-order probabilistic computation
• Probabilistic game semantics
• Symmetry in concurrent games
• The Parallel Intensionally Fully Abstract Games Model of PCF
• The concurrent game semantics of probabilistic PCF
• Thin games with symmetry and concurrent Hyland-Ong games
• Weighted relational models of typed lambda-calculi

Cited in

(10)

• scientific article; zbMATH DE number 7559292 (Why is no real title available?)
• 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
• On higher-order cryptography
• Solvability in a probabilistic setting (invited talk)
• From thin concurrent games to generalized species of structures (extended version)
• 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)