Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases

DOI10.1016/j.jlamp.2014.09.003zbMath1304.68026MaRDI QIDQ478400

Jean Goubault-Larrecq

Publication date: 3 December 2014

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2014.09.003

zbMATH Keywords

full abstraction; domain theory; PCF

Mathematics Subject Classification ID

68N15: Theory of programming languages

68Q55: Semantics in the theory of computing

Related Items

Unnamed Item, Linear logic in normed cones: probabilistic coherence spaces and beyond, Separating minimal valuations, point-continuous valuations, and continuous valuations, Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular, Isomorphism theorems between models of mixed choice, Kantorovich-Rubinstein quasi-metrics. II: Hyperspaces and powerdomains, Core-compactness, consonance and the Smyth powerspaces, QPCF: higher-order languages and quantum circuits

Cites Work

• Retracted: Semantic domains for combining probability and non-determinism
• The probabilistic powerdomain for stably compact spaces
• Notions of computation and monads
• An abstract framework for environment machines
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• The way-below relation of function spaces over semantic domains
• Topology, domain theory and theoretical computer science
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Kripke logical relations and PCF
• A relational account of call-by-value sequentiality
• Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting
• Domain-Theoretic Foundations of Functional Programming
• De Groot duality and models of choice: angels, demons and nature
• Continuous Previsions
• Parametricity and local variables
• Continuous Lattices and Domains
• Non-Hausdorff Topology and Domain Theory
• Isomorphism theorems between models of mixed choice
• Computer Science Logic
• Probabilistic coherence spaces are fully abstract for probabilistic PCF
• Prevision Domains and Convex Powercones
• Probabilistic game semantics
• Demonic, angelic and unbounded probabilistic choices in sequential programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item