The probability of nonconfluent systems
Abstract
We show how to provide a structure of probability space to the set of execution traces on a nonconfluent abstract rewrite system, by defining a variant of a Lebesgue measure on the space of traces. Then, we show how to use this probability space to transform a nondeterministic calculus into a probabilistic one. We use as example Lambda+, a recently introduced calculus defined through type isomorphisms.
 Publication:

arXiv eprints
 Pub Date:
 March 2014
 arXiv:
 arXiv:1404.0081
 Bibcode:
 2014arXiv1404.0081D
 Keywords:

 Computer Science  Logic in Computer Science
 EPrint:
 In Proceedings DCM 2013, arXiv:1403.7685