Higher-order interpretations and program complexity
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 1696756 (Why is no real title available?)
- scientific article; zbMATH DE number 1722716 (Why is no real title available?)
- scientific article; zbMATH DE number 996558 (Why is no real title available?)
- scientific article; zbMATH DE number 1223626 (Why is no real title available?)
- scientific article; zbMATH DE number 512786 (Why is no real title available?)
- scientific article; zbMATH DE number 2043542 (Why is no real title available?)
- scientific article; zbMATH DE number 2084367 (Why is no real title available?)
- scientific article; zbMATH DE number 2182486 (Why is no real title available?)
- scientific article; zbMATH DE number 806752 (Why is no real title available?)
- A Soft Type Assignment System for λ-Calculus
- A combination framework for complexity
- A new recursion-theoretic characterization of the polytime functions
- A polytime functional language from light linear logic
- Algorithms with polynomial interpretation termination proof
- Analysing the complexity of functional programs: higher-order meets first-order
- Combinatory reduction systems: Introduction and survey
- Derivational complexity is an invariant cost model
- Higher type recursion, ramification and polynomial time
- Higher-order interpretations and program complexity
- Light types for polynomial time computation in lambda calculus
- Linear dependent types and relative completeness
- Linear types and non-size-increasing polynomial time computation.
- On Constructor Rewrite Systems and the Lambda-Calculus
- Orderings for term-rewriting systems
- Polynomial interpretations for higher-order rewriting
- Quasi-interpretation Synthesis by Decomposition
- Quasi-interpretations. A way to control resources
- Realizability models and implicit complexity
- Safe recursion with higher types and BCK-algebra
- The derivational complexity induced by the dependency pair method
Cited in
(18)- Analysing the complexity of functional programs: higher-order meets first-order
- Theory of higher order interpretations and application to basic feasible functions
- Analyzing the implicit computational complexity of object-oriented programs
- scientific article; zbMATH DE number 7533334 (Why is no real title available?)
- Complete and tractable machine-independent characterizations of second-order polytime
- Higher-order interpretations and program complexity
- Implicit computation complexity in higher-order programming languages
- Combining linear logic and size types for implicit complexity
- 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?)
- Quasi-interpretation Synthesis by Decomposition
- Static complexity analysis of higher order programs
- A tier-based typed programming language characterizing feasible functionals
- Analyzing Innermost Runtime Complexity Through Tuple Interpretations
- 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 Q276254)
