A Aralex Aachen research explorer

June 18, 2021 conference-paper Open access

On probabilistic termination of functional programs with continuous distributions

DOI: 10.1145/3453483.3454111 Full text (OA) OpenAlex

Authors 0

Author list not loaded yet.

Cited by 5 stored of 12

Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

0

citations
Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
2025 International Symposium on Principles and Practice of Declarative Programming (PPDP) conference-paper Computer Science Logic, programming, and type systems Open access

1

citations
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

2

citations
A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems

2

citations
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

7

citations

5 results

References 0