Higher-order interpretations and program complexity, Computer Science Logic (CSL'12), vol.16, pp.62-76, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-01337728
Higher-order interpretations and program complexity, Inf. Comput, vol.248, pp.56-81, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01337728
Quasi-interpretations a way to control resources, Theoretical Computer Science, vol.412, pp.2776-2796, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00591862
Polynomial interpretations and the complexity of algorithms, In Journal of Automated Reasoning, vol.34, issue.4, pp.325-363, 2005. ,
Higher-order interpretations and program complexity, International Conference on Automated Deduction, pp.139-147, 1992. ,
Characterizations of the basic feasible functionals of finite type, Foundations of Computer Science, pp.154-159, 1989. ,
Type two computational complexity, Proc. 5th annual ACM Symposium on Theory of Computing, pp.108-121, 1973. ,
Complexité d'ordre supérieur et analyse récursive. (Higher order complexity and computable analysis), 2014. ,
Characterizing polynomial time complexity of stream programs using interpretations In Theor, Comput. Sci, vol.585, pp.41-54, 2015. ,
Higher order interpretation for higher order complexity, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, pp.269-285, 2017. ,
On characterizations of the basic feasible functionals (part II), 2002. ,
On characterizations of the basic feasible functionals (part I), Journal of Functional Programming, vol.11, issue.1, pp.117-153, 2001. ,
Complexity theory for operators in analysis, Proc. 42nd ACM Symposium on Theory of Computing, pp.495-502, 2010. ,
, Complexity Theory of Real Functions. Birkhäuser, 1991.
Handbook of metric fixed point theory, 2001. ,
On proving term rewriting systems are noetherian, 1979. ,
Polynomial and abstract subrecursive classes, Proc. 6th annual ACM Symposium on Theory of Computing, pp.96-109, 1974. ,
Foundations for programming languages, 1996. ,
On the termination of Markov algorithms, Third Hawaii International Conference on System Science, pp.789-792, 1970. ,
Synthesis of sup-interpretations: A survey, Theor. Comput. Sci, vol.467, pp.30-52, 2013. ,
A lattice-theoretical fixpoint theorem and its applications, Pacific journal of Mathematics, vol.5, issue.2, pp.285-309, 1955. ,
Termination proofs for higher-order rewrite systems, Logic, and Term Rewriting, vol.816, pp.305-325, 1993. ,
The formal semantics of programming languages: an introduction, 1993. ,