Termination proofs and complexity certification
From MaRDI portal
Recommendations
Cited in
(10)- Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion
- An arithmetic for polynomial-time computation
- Automated complexity analysis of Nuprl extracted programs
- On the Computational Content of Termination Proofs
- Certifying a Termination Criterion Based on Graphs, without Graphs
- scientific article; zbMATH DE number 512849 (Why is no real title available?)
- On lexicographic termination ordering with space bound certifications
- Formalizing termination proofs under polynomial quasi-interpretations
- Certification of complexity proofs using CeTA
- Interactive Termination Proofs Using Termination Cores
This page was built for publication: Termination proofs and complexity certification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714440)