On probabilistic term rewriting
From MaRDI portal
Recommendations
Cited in
(16)- Confluence and convergence modulo equivalence in probabilistically terminating reduction systems
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- On randomised strategies in the \(\lambda \)-calculus
- Probabilistic termination by monadic affine sized typing
- On the termination problem for probabilistic higher-order recursive programs
- Automated termination analysis of polynomial probabilistic programs
- Proving Positive Almost Sure Termination Under Strategies
- On lexicographic proof rules for probabilistic termination
- scientific article; zbMATH DE number 7566061 (Why is no real title available?)
- Confluence and convergence in probabilistically terminating reduction systems
- Confluence in probabilistic rewriting
- Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
- Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
- Quantum expectation transformers for cost analysis
- scientific article; zbMATH DE number 7559285 (Why is no real title available?)
- scientific article; zbMATH DE number 7456060 (Why is no real title available?)
This page was built for publication: On probabilistic term rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648879)