A Note on Confluence in Typed Probabilistic Lambda Calculi

Rafael Romero
Alejandro Díaz-Caro

On the topic of probabilistic rewriting, there are several works studying both termination and confluence of different systems. While working with a lambda calculus modelling quantum computation, we found a system with probabilistic rewriting rules and strongly normalizing terms. We examine the effect of small modifications in probabilistic rewriting, affine variables, and strategies on the overall confluence in this strongly normalizing probabilistic calculus.

In Mauricio Ayala-Rincon and Eduardo Bonelli: Proceedings 16th Logical and Semantic Frameworks with Applications (LSFA 2021), Buenos Aires, Argentina (Online), 23rd - 24th July, 2021, Electronic Proceedings in Theoretical Computer Science 357, pp. 18–24.
Published: 8th April 2022.

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