The following pages link to (Q4808751):
Displaying 14 items.
- Confluence and convergence modulo equivalence in probabilistically terminating reduction systems (Q1726351) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- On randomised strategies in the \(\lambda \)-calculus (Q1989325) (← links)
- Confluence in probabilistic rewriting (Q2333318) (← links)
- Confluence results for a quantum lambda calculus with measurements (Q2825377) (← links)
- Probabilistic Termination by Monadic Affine Sized Typing (Q2988649) (← links)
- Strategic port graph rewriting: an interactive modelling framework (Q4629264) (← links)
- (Q5089021) (← links)
- (Q5094133) (← links)
- QMaude: quantitative specification and verification in rewriting logic (Q6174537) (← links)
- Towards logical foundations for probabilistic computation (Q6560995) (← links)
- From innermost to full almost-sure termination of probabilistic term rewriting (Q6629527) (← links)
- Curry and Howard meet Borel (Q6649480) (← links)
- A note on confluence in typed probabilistic lambda calculi (Q6661149) (← links)