Ehrhard, Thomas and Tasson, Christine - Probabilistic call by push value

lmcs:1537 - Logical Methods in Computer Science, January 9, 2019, Volume 15, Issue 1 -
Probabilistic call by push value

Authors: Ehrhard, Thomas and Tasson, Christine

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.

Volume: Volume 15, Issue 1
Published on: January 9, 2019
Submitted on: July 19, 2016
Keywords: Computer Science - Logic in Computer Science,F.3.2


Consultation statistics

This page has been seen 309 times.
This article's PDF has been downloaded 182 times.