Pages that link to "Item:Q5408426"
From MaRDI portal
The following pages link to On coinductive equivalences for higher-order probabilistic functional programs (Q5408426):
Displaying 10 items.
- Effectful applicative similarity for call-by-name lambda calculi (Q1989333) (← links)
- On bisimilarity in lambda calculi with continuous probabilistic choice (Q2133169) (← links)
- Program equivalence in an untyped, call-by-value functional language with uncurried functions (Q2693299) (← links)
- On Equivalences, Metrics, and Polynomial Time (Q2947890) (← links)
- Metric Reasoning About $$\lambda $$-Terms: The General Case (Q2988646) (← links)
- On Applicative Similarity, Sequentiality, and Full Abstraction (Q3449626) (← links)
- The geometry of Bayesian programming (Q5076392) (← links)
- (Q5089028) (← links)
- (Q5129945) (← links)
- Program equivalence in a typed probabilistic call-by-need functional language (Q6052951) (← links)