Term Rewriting and Applications
From MaRDI portal
Publication:5703859
DOI10.1007/b135673zbMath1078.68057OpenAlexW2504734884MaRDI QIDQ5703859
Florent Garnier, Olivier Bournez
Publication date: 11 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b135673
Related Items
Learning probabilistic termination proofs ⋮ The probabilistic termination tool amber ⋮ Time-bounded termination analysis for probabilistic programs with delays ⋮ On Higher-Order Probabilistic Subrecursion ⋮ Probabilistic Termination by Monadic Affine Sized Typing ⋮ Unnamed Item ⋮ On the hardness of analyzing probabilistic programs ⋮ Correctness of sequential Monte Carlo inference for probabilistic programming languages ⋮ Automated termination analysis of polynomial probabilistic programs ⋮ On randomised strategies in the \(\lambda \)-calculus ⋮ Inferring expected runtimes of probabilistic integer programs using expected sizes ⋮ Computing expected runtimes for constant probability programs ⋮ Unnamed Item ⋮ Confluence in probabilistic rewriting
