/***
name = lics-paper-crubille
date = 29 June 2018
image = https://lics.siglog.org/lics18/images/lics-ico.png
image tag = LICS
extra link = https://arxiv.org/abs/1805.00512
for 2 weeks until 12 July 2018, priority=low
for 1 week until 12 July 2018, priority=normal
for 2 days until 11 July 2018, priority=high
notion = fully abstract
notion text = {The quest for a fully abstract model for the contextual equivalence of PCF, a paradigmatic functional language, has been influential in the area of programming languages semantics. A model is fully abstract if it is both sound and complete.
A denotational model is complete for a given notion of equivalence between programs  if equivalent programs have the same denotation, some mathematical object they are mapped to;
it is sound if programs having the same denotation are equivalent.}
***/
[[http://research.crubille.lautre.net/|Raphaëlle Crubillé]] (PhD student IRIF) will present at 
[[https://lics.siglog.org/lics18/index.php|LICS 2018]] an analytic account of the discrete probabilities fragment of a denotational model for higher-order programming with general probabilities, hopefully a first step towards proving that this model is fully abstract.