Strong adequacy and untyped full-abstraction for probabilistic coherence spaces

DOI10.1007/978-3-030-17127-8_21MaRDI QIDQ2289088zbMATH OpenOpenAlexFDO

Authors Thomas Leventis, Michele Pagani

Publication date 28 January 2020

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-17127-8_21

zbMATH Keywords

denotational semanticslambda-calculusprobabilistic functional programming

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Recommendations

• Probabilistic coherence spaces are fully abstract for probabilistic PCF
• Full abstraction for probabilistic PCF
• Probabilistic coherence spaces as a model of higher-order probabilistic computation
• Probabilistic call by push value
• The free exponential modality of probabilistic coherence spaces

Cited in

(2)

• Quantum expectation transformers for cost analysis
• scientific article; zbMATH DE number 7559292 (Why is no real title available?)

This page was built for publication: Strong adequacy and untyped full-abstraction for probabilistic coherence spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289088)