On probabilistic term rewriting

DOI10.1007/978-3-319-90686-7_9OpenAlexW2788405769MaRDI QIDQ1648879FDOQ1648879

Authors: Martin Avanzini, Ugo Dal Lago, Akihisa Yamada 

Publication date: 9 July 2018

Full work available at URL: https://arxiv.org/abs/1802.09774

Recommendations

• Term Rewriting and Applications
• Proving Positive Almost Sure Termination Under Strategies
• Termination of term rewriting by interpretation
• Matrix interpretations for proving termination of term rewriting
• Matrix Interpretations for Proving Termination of Term Rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (14)

• Title not available (Why is that?)
• 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
• Automated termination analysis of polynomial probabilistic programs
• On lexicographic proof rules for probabilistic termination
• Proving Positive Almost Sure Termination Under Strategies
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• PMaude
• Nagoya Termination Tool
• NaTT

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)