Probabilistic Böhm Trees and Probabilistic Separation-Reference-Cited by-同舟云学术

Probabilistic Böhm Trees and Probabilistic Separation

Published:2018-07-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Leventis Thomas¹

Affiliation:

1. IRIF, Univ Paris Diderot, Sorbonne Paris Cité, Paris, France

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3209108.3209126

Reference9 articles.

1. H. P. Barendregt The lambda calculus. Its syntax and semantics Studies in logic and foundations of mathematics vol. 103. North-Holland Publishing Company Amsterdam New York and Oxford 1981 xiv + 615 pp. H. P. Barendregt The lambda calculus. Its syntax and semantics Studies in logic and foundations of mathematics vol. 103. North-Holland Publishing Company Amsterdam New York and Oxford 1981 xiv + 615 pp.

2. P. Billingsley Probability and Measure third edition Wiley Series in Probability and Mathematical Statistics 1995. P. Billingsley Probability and Measure third edition Wiley Series in Probability and Mathematical Statistics 1995.

3. On Probabilistic Applicative Bisimulation and Call-by-Value λ-Calculi

4. Nondeterministic Extensions of Untyped λ-Calculus

5. M. Dezani-Ciancaglini and E. Giovannett From Böhm's Theorem to Observational Equivalences: an Informal Account Electronic Notes in Theoretical Computer Science 2001. M. Dezani-Ciancaglini and E. Giovannett From Böhm's Theorem to Observational Equivalences: an Informal Account Electronic Notes in Theoretical Computer Science 2001.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Benefit of Being Non-Lazy in Probabilistic λ-calculus;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08

2. Taylor subsumes Scott, Berry, Kahn and Plotkin;Proceedings of the ACM on Programming Languages;2020-01

3. Decomposing Probabilistic Lambda-Calculi;Lecture Notes in Computer Science;2020

4. Effectful Normal Form Bisimulation;Programming Languages and Systems;2019

5. Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces;Lecture Notes in Computer Science;2019