Probabilistic coherence spaces are fully abstract for probabilistic PCF

DOI10.1145/2535838.2535865zbMath1284.68268OpenAlexW2033104047MaRDI QIDQ5408427

Christine Tasson, Michele Pagani, Thomas Ehrhard

Publication date: 10 April 2014

Published in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2535838.2535865

zbMATH Keywords

full abstractionprobabilistic pcf

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (14)

On Applicative Similarity, Sequentiality, and Full Abstraction ⋮ Semantics of quantum programming languages: Classical control, quantum control ⋮ Mackey-complete spaces and power series – a topological model of differential linear logic ⋮ The Free Exponential Modality of Probabilistic Coherence Spaces ⋮ On Higher-Order Probabilistic Subrecursion ⋮ Metric Reasoning About $$\lambda $$-Terms: The General Case ⋮ Unnamed Item ⋮ Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Call-By-Push-Value from a Linear Logic Point of View ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Probabilistic coherence spaces are fully abstract for probabilistic PCF