scientific article; zbMATH DE number 7533341

DOI10.4230/LIPIcs.CSL.2018.16MaRDI QIDQ5079740

Hugo Paquet, Pierre Clairambault

Publication date: 28 May 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

\(\lambda\)-calculusfull abstractiongame semanticsprobabilistic programmingrelational model

Mathematics Subject Classification ID

Logic in computer science (03B70)

Related Items (2)

The geometry of Bayesian programming ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed probabilistic and quantum strategies
• Probabilistic coherence spaces as a model of higher-order probabilistic computation
• CPO's of measures for nondeterminism
• On full abstraction for PCF: I, II and III
• Event Structures with Symmetry
• A lambda-calculus foundation for universal probabilistic programming
• Thin Games with Symmetry and Concurrent Hyland-Ong Games
• Asynchronous Games: Innocence Without Alternation
• Not Enough Points Is Enough
• Symmetry in concurrent games
• The Parallel Intensionally Fully Abstract Games Model of PCF
• A deterministic rewrite system for the probabilistic λ-calculus
• The concurrent game semantics of Probabilistic PCF
• Probabilistic Böhm Trees and Probabilistic Separation
• Weighted Relational Models of Typed Lambda-Calculi
• Probabilistic game semantics
• Innocent game models of untyped \(\lambda\)-calculus

This page was built for publication: