A deterministic rewrite system for the probabilistic λ-calculus
From MaRDI portal
Publication:5108532
DOI10.1017/S0960129519000045zbMath1434.68091OpenAlexW2990154007MaRDI QIDQ5108532
Publication date: 4 May 2020
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129519000045
Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)
Related Items (6)
A deterministic rewrite system for the probabilistic λ-calculus ⋮ Decomposing probabilistic lambda calculi ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Probabilistic Analysis of Binary Sessions
Cites Work
- Unnamed Item
- Probabilistic coherence spaces as a model of higher-order probabilistic computation
- The lambda calculus, its syntax and semantics
- Nondeterministic extensions of untyped \(\lambda\)-calculus
- Postulates for the barycentric calculus
- Probabilistic operational semantics for the lambda calculus
- The algebraic lambda calculus
- A deterministic rewrite system for the probabilistic λ-calculus
- Parallel reductions in \(\lambda\)-calculus
This page was built for publication: A deterministic rewrite system for the probabilistic λ-calculus
