Higher-order interpretations and program complexity
From MaRDI portal
Publication:4649538
DOI10.4230/LIPICS.CSL.2012.62zbMATH Open1252.68060OpenAlexW4393967107MaRDI QIDQ4649538FDOQ4649538
Authors: Patrick Baillot, Ugo Dal Lago 
Publication date: 22 November 2012
Full work available at URL: https://hal.archives-ouvertes.fr/hal-00798298
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
Functional programming and lambda calculus (68N18) Complexity of computation (including implicit computational complexity) (03D15)
Cited In (15)
- Interpretation of stream programs: characterizing type 2 polynomial time complexity
- Title not available (Why is that?)
- Higher-order interpretations and program complexity
- Characterizing polynomial time complexity of stream programs using interpretations
- Implicit computation complexity in higher-order programming languages
- Title not available (Why is that?)
- Higher order interpretation for higher order complexity
- Static complexity analysis of higher order programs
- Analyzing the implicit computational complexity of object-oriented programs
- On basic feasible functionals and the interpretation method
- On quasi-interpretations, blind abstractions and implicit complexity
- Analysing the complexity of functional programs: higher-order meets first-order
- Theory of higher order interpretations and application to basic feasible functions
- Complexity invariance of real interpretations
- On the versatility of open logical relations. Continuity, automatic differentiation, and a containment theorem
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)
