A Aralex Aachen research explorer

November 23, 2019 article Open access

On the Termination Problem for Probabilistic Higher-Order Recursive Programs

Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna)

DOI: 10.23638/lmcs-16(4:2)2020 Full text (OA) OpenAlex

Authors 0

Author list not loaded yet.

Cited by 1 stored of 2

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

1 result

References 0