Efficient first order functional program interpreter with time bound certifications
From MaRDI portal
Recommendations
Cited in
(16)- Analysing the implicit complexity of programs.
- Realizability models for a linear dependent PCF
- Implicit complexity over an arbitrary structure: Quantifier alternations
- Higher-order interpretations and program complexity
- A Characterization of NC k by First Order Functional Programs
- Automated Implicit Computational Complexity Analysis (System Description)
- Polygraphic programs and polynomial-time functions
- Max-plus quasi-interpretations
- On lexicographic termination ordering with space bound certifications
- Higher-order interpretations and program complexity
- scientific article; zbMATH DE number 2182486 (Why is no real title available?)
- Safe recursion over an arbitrary structure: PAR, PH and DPH
- Quasi-interpretations. A way to control resources
- Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
- Bounded Linear Logic, Revisited
- A characterization of basic feasible functionals through higher-order rewriting and tuple interpretations
This page was built for publication: Efficient first order functional program interpreter with time bound certifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2767004)