Probabilistic Böhm Trees and Probabilistic Separation

DOI10.1145/3209108.3209126zbMath1453.03009OpenAlexW2798427740MaRDI QIDQ5145341

Thomas Leventis

Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3209108.3209126

zbMATH Keywords

separationBöhm treesobservational equivalenceprobabilistic lambda-calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (3)

Unnamed Item ⋮ Unnamed Item ⋮ On the Taylor expansion of probabilistic λ-terms

This page was built for publication: Probabilistic Böhm Trees and Probabilistic Separation