scientific article; zbMATH DE number 7559285
From MaRDI portal
Publication:5089021
DOI10.4230/LIPIcs.FSCD.2019.19MaRDI QIDQ5089021
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Confluence and convergence modulo equivalence in probabilistically terminating reduction systems ⋮ Unnamed Item ⋮ Topological rewriting systems applied to standard bases and syntactic algebras
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The weak lambda calculus as a reasonable machine
- Combinatory weak reduction in lambda calculus
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- On probabilistic term rewriting
- Confluence and convergence in probabilistically terminating reduction systems
- Transfinite reductions in orthogonal term rewriting systems
- Termination of nondeterministic probabilistic programs
- Confluence in probabilistic rewriting
- Nondeterministic extensions of untyped \(\lambda\)-calculus
- On theories with a combinatorial definition of 'equivalence'
- Probabilistic Termination
- 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
- Proving Positive Almost Sure Termination Under Strategies
- Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms
- Stochastic lambda calculus and monads of probability distributions
- A probabilistic language based upon sampling functions
- The geometry of parallelism: classical, probabilistic, and quantum effects
- Random Descent
- Probabilistic automata
- Computability by Probabilistic Turing Machines
- Term Rewriting and Applications
This page was built for publication:
