Probabilistic Böhm trees and probabilistic separation
From MaRDI portal
Publication:5145341
Recommendations
- On probabilistic applicative bisimulation and call-by-value \(\lambda \)-calculi
- Probabilistic operational semantics for the lambda calculus
- On coinductive equivalences for higher-order probabilistic functional programs
- The Benefit of Being Non-Lazy in Probabilistic λ-calculus
- A deterministic rewrite system for the probabilistic \(\lambda\)-calculus
Cited in
(4)
This page was built for publication: Probabilistic Böhm trees and probabilistic separation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145341)