Higher-order interpretations and program complexity

DOI10.4230/LIPICS.CSL.2012.62MaRDI QIDQ4649538zbMATH OpenOpenAlexFDO

Authors Patrick Baillot, Ugo Dal Lago

Publication date 22 November 2012

Full work available at URL https://hal.archives-ouvertes.fr/hal-00798298

zbMATH Keywords

higher-order rewritingimplicit complexityquasi-interpretations

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Functional programming and lambda calculus (68N18)

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

(16)

• Characterizing polynomial time complexity of stream programs using interpretations
• Higher-order interpretations and program complexity
• scientific article; zbMATH DE number 1696756 (Why is no real title available?)
• On quasi-interpretations, blind abstractions and implicit complexity
• Analysing the complexity of functional programs: higher-order meets first-order
• Interpretation of stream programs: characterizing type 2 polynomial time complexity
• Analyzing the implicit computational complexity of object-oriented programs
• Complexity invariance of real interpretations
• scientific article; zbMATH DE number 139626 (Why is no real title available?)
• Higher order interpretation for higher order complexity
• On the versatility of open logical relations. Continuity, automatic differentiation, and a containment theorem
• Theory of higher order interpretations and application to basic feasible functions
• Static complexity analysis of higher order programs
• Implicit computation complexity in higher-order programming languages
• On basic feasible functionals and the interpretation method
• A characterization of basic feasible functionals through higher-order rewriting and tuple 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)