Probabilistic coherence spaces are fully abstract for probabilistic PCF
From MaRDI portal
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)
Recommendations
- Full abstraction for probabilistic PCF
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
- Probabilistic call by push value
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases
- The concurrent game semantics of probabilistic PCF
Cited in
(35)- Semantics of quantum programming languages: Classical control, quantum control
- Strong adequacy and untyped full-abstraction for probabilistic coherence spaces
- Call-By-Push-Value from a Linear Logic Point of View
- The free exponential modality of probabilistic coherence spaces
- On higher-order probabilistic subrecursion
- Metric reasoning about -terms: the general case
- On applicative similarity, sequentiality, and full abstraction
- Full abstraction for probabilistic PCF
- Mackey-complete spaces and power series -- a topological model of differential linear logic
- Probabilistic call by push value
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases
- On higher-order probabilistic subrecursion
- Fully abstract models of the probabilistic -calculus
- Differentials and distances in probabilistic coherence spaces
- The sub-additives: a proof theory for probabilistic choice extending linear logic
- Probabilistic rewriting and asymptotic behaviour: on termination and unique normal forms
- Differentials and distances in probabilistic coherence spaces
- On the termination problem for probabilistic higher-order recursive programs
- Convexity and order in probabilistic call-by-name FPC
- The concurrent game semantics of probabilistic PCF
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
- Fooling the Parallel or Tester with Probability 8/27
- Fast and correct gradient-based optimisation for probabilistic programming via smoothing
- Towards logical foundations for probabilistic computation
- Zeta functions and the (linear) logic of Markov processes
- (Towards a) statistical probabilistic lazy lambda calculus
- Curry and Howard meet Borel
- Linear-algebraic models of linear logic as categories of modules over \(\Sigma \)-semirings
- Fixpoint constructions in focused orthogonality models of linear logic
- Solvability in a probabilistic setting (invited talk)
- A categorical treatment of open linear systems
- Coherent Taylor expansion as a bimonad
- Integration in cones
- From differential linear logic to coherent differentiation
- Classical linear logic in perfect Banach lattices
This page was built for publication: Probabilistic coherence spaces are fully abstract for probabilistic PCF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408427)
