On coinductive equivalences for higher-order probabilistic functional programs-Reference-Cited by-同舟云学术

On coinductive equivalences for higher-order probabilistic functional programs

Published:2014-01-08 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
language:
Short-container-title:

Author:

Dal Lago Ugo¹,Sangiorgi Davide¹,Alberti Michele²

Affiliation:

1. Università di Bologna & INRIA, Bologna, Italy

2. CNRS & Université d'Aix-Marseille, Marseille, France

Publisher

ACM

Link

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

Reference44 articles.

1. Full Abstraction in the Lazy Lambda Calculus

2. Distributive semantics for nondeterministic typed λ-calculi

3. H. P. Barendregt . The Lambda Calculus -- Its Syntax and Semantics volume 103 of Studies in Logic and the Foundations of Mathematics . North-Holland 1984 . H. P. Barendregt. The Lambda Calculus -- Its Syntax and Semantics volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland 1984.

4. A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences

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

1. Program equivalence in a typed probabilistic call-by-need functional language;Journal of Logical and Algebraic Methods in Programming;2023-10

2. Allegories of Symbolic Manipulations;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

3. Program equivalence in an untyped, call-by-value functional language with uncurried functions;Journal of Logical and Algebraic Methods in Programming;2023-04

4. Analyzing Divergence for Nondeterministic Probabilistic Models;2023

5. On Feller continuity and full abstraction;Proceedings of the ACM on Programming Languages;2022-08-29