Probabilistic call by push value

Resource type
Authors/contributors
Title
Probabilistic call by push value
Abstract
We introduce a probabilistic extension of Levy's Call-By-Push-Value. This extension consists simply in adding a " flipping coin " boolean closed atomic expression. This language can be understood as a major generalization of Scott's PCF encompassing both call-by-name and call-by-value and featuring recursive (possibly lazy) data types. We interpret the language in the previously introduced denotational model of probabilistic coherence spaces, a categorical model of full classical Linear Logic, interpreting data types as coalgebras for the resource comonad. We prove adequacy and full abstraction, generalizing earlier results to a much more realistic and powerful programming language.
Publication
arXiv:1607.04690 [cs]
Date
2018
DOI
10/ggdk8z
Accessed
2019-11-27T20:51:36Z
Library Catalog
Extra
ZSCC: 0000013[s0] arXiv: 1607.04690
Citation
Ehrhard, T., & Tasson, C. (2018). Probabilistic call by push value. ArXiv:1607.04690 [Cs]. https://doi.org/10/ggdk8z
CATEGORICAL LOGIC
Attachment
Processing time: 0.02 seconds

Graph of references

(from Zotero to Gephi via Zotnet with this script)
Graph of references