The following pages link to On probabilistic term rewriting (Q1648879):
Displaying 13 items.
- Confluence and convergence in probabilistically terminating reduction systems (Q1671150) (← links)
- Confluence and convergence modulo equivalence in probabilistically terminating reduction systems (Q1726351) (← links)
- On randomised strategies in the \(\lambda \)-calculus (Q1989325) (← links)
- Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
- Automated termination analysis of polynomial probabilistic programs (Q2233477) (← links)
- Confluence in probabilistic rewriting (Q2333318) (← links)
- (Q5021230) (← links)
- (Q5089021) (← links)
- (Q5094133) (← links)
- (Q5129945) (← links)
- Automated Expected Amortised Cost Analysis of Probabilistic Data Structures (Q6487331) (← links)
- On lexicographic proof rules for probabilistic termination (Q6610383) (← links)
- Quantum expectation transformers for cost analysis (Q6649439) (← links)