Higher order interpretation for higher order complexity

DOI10.29007/1TKWMaRDI QIDQ4645740zbMATH OpenOpenAlexFDO

Authors Emmanuel Hainry, Romain Péchoux

Publication date 10 January 2019

Published in EPiC Series in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.29007/1tkw

zbMATH Keywords

basic feasible functionalshigher-order complexityinterpretations

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Higher-order interpretations and program complexity
• Higher-order interpretations and program complexity
• Tuple Interpretations for Higher-Order Complexity.
• Higher-order computability
• Automated higher-order complexity analysis
• scientific article; zbMATH DE number 66471
• Complexity analysis in presence of control operators and higher-order functions
• scientific article; zbMATH DE number 65741
• Intensional computation with higher-order functions
• Complexity hierarchies and higher-order cons-free rewriting

Cited in

(10)

• Automated higher-order complexity analysis
• Higher-order interpretations and program complexity
• Interpretation of stream programs: characterizing type 2 polynomial time complexity
• Quasi-interpretation Synthesis by Decomposition
• scientific article; zbMATH DE number 1332637 (Why is no real title available?)
• scientific article; zbMATH DE number 1761898 (Why is no real title available?)
• Higher-order interpretations and program complexity
• A tier-based typed programming language characterizing feasible functionals
• Theory of higher order interpretations and application to basic feasible functions
• Degrees of second- and higher-order polynomials

This page was built for publication: Higher order interpretation for higher order complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645740)