Confluence in probabilistic rewriting
From MaRDI portal
Publication:2333318
DOI10.1016/j.entcs.2018.10.008zbMath1433.68189arXiv1708.03536OpenAlexW2748775944WikidataQ113317507 ScholiaQ113317507MaRDI QIDQ2333318
Guido Martínez, Alejandro Díaz-Caro
Publication date: 12 November 2019
Full work available at URL: https://arxiv.org/abs/1708.03536
Theory of programming languages (68N15) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)
Related Items (6)
A Lambda Calculus for Density Matrices with Classical and Probabilistic Controls ⋮ A concrete model for a typed linear algebraic lambda calculus ⋮ Confluence and convergence modulo equivalence in probabilistically terminating reduction systems ⋮ Unnamed Item ⋮ A categorical construction for the computational definition of vector spaces ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Semantics of probabilistic programs
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- On theories with a combinatorial definition of 'equivalence'
- Measurements and Confluence in Quantum Lambda Calculi With Explicit Qubits
- Confluence Results for a Quantum Lambda Calculus with Measurements
- Probabilistic operational semantics for the lambda calculus
- Probabilistic -calculus and Quantitative Program Analysis
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Complete Sets of Reductions for Some Equational Theories
- A Lambda Calculus for Quantum Computation
- A single quantum cannot be cloned
- The geometry of parallelism: classical, probabilistic, and quantum effects
- Term Rewriting and Applications
- Term Rewriting and Applications
- Typed Lambda Calculi and Applications
This page was built for publication: Confluence in probabilistic rewriting
