Higher-order interpretations and program complexity
From MaRDI portal
Publication:4649538
Recommendations
- Higher-order interpretations and program complexity
- Higher order interpretation for higher order complexity
- On quasi-interpretations, blind abstractions and implicit complexity
- Theory of higher order interpretations and application to basic feasible functions
- scientific article; zbMATH DE number 1696756
Cited in
(15)- Analysing the complexity of functional programs: higher-order meets first-order
- Theory of higher order interpretations and application to basic feasible functions
- Higher-order interpretations and program complexity
- Analyzing the implicit computational complexity of object-oriented programs
- On the versatility of open logical relations. Continuity, automatic differentiation, and a containment theorem
- Implicit computation complexity in higher-order programming languages
- Characterizing polynomial time complexity of stream programs using interpretations
- On quasi-interpretations, blind abstractions and implicit complexity
- scientific article; zbMATH DE number 1696756 (Why is no real title available?)
- Interpretation of stream programs: characterizing type 2 polynomial time complexity
- scientific article; zbMATH DE number 139626 (Why is no real title available?)
- Static complexity analysis of higher order programs
- On basic feasible functionals and the interpretation method
- Higher order interpretation for higher order complexity
- Complexity invariance of real interpretations
This page was built for publication: Higher-order interpretations and program complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649538)
