The probability of non-confluent systems

Alejandro Díaz-Caro
Gilles Dowek

We show how to provide a structure of probability space to the set of execution traces on a non-confluent 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 non-deterministic calculus into a probabilistic one. We use as example Lambda+, a recently introduced calculus defined through type isomorphisms.

In Mauricio Ayala-Rincón, Eduardo Bonelli and Ian Mackie: Proceedings 9th International Workshop on Developments in Computational Models (DCM 2013), Buenos Aires, Argentina, 26 August 2013, Electronic Proceedings in Theoretical Computer Science 144, pp. 1–15.
Published: 30th March 2014.

ArXived at: http://dx.doi.org/10.4204/EPTCS.144.1 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org