Automated higher-order complexity analysis

[1]  Ralph Benzinger,et al.  Automated complexity analysis of Nuprl extracted programs , 2001, Journal of Functional Programming.

[2]  Harry G. Mairson,et al.  Optimality and inefficiency: what isn't a cost model of the lambda calculus? , 1996, ICFP '96.

[3]  David Sands,et al.  A Naïve Time Analysis and its Theory of Cost Equivalence , 1995, J. Log. Comput..

[4]  Robert L. Constable,et al.  The semantics of reflected proof , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[5]  Mads Rosendahl,et al.  Automatic complexity analysis , 1989, FPCA.

[6]  Robert L. Constable,et al.  Proofs as programs , 1985, TOPL.

[7]  Eli Barzilay.  Quotation and Reflection in Nuprl and Scheme , 2001 .

[8]  A. Nogin.  Improving the Efficiency of Nuprl Proofs , 1997 .

[9]  Daniel Le Métayer,et al.  ACE: an automatic complexity evaluator , 1988, TOPL.

[10]  Robert L. Constable,et al.  A Note on Complexity Measures for Inductive Classes in Constructive Type Theory , 1998, Inf. Comput..

[11]  S. Holmström,et al.  A composition approach to time analysis of first order lazy functional programs , 1989, FPCA.

[12]  Robert L. Constable,et al.  Automated computational complexity analysis , 2001 .

[13]  William W. Tait,et al.  Intensional interpretations of functionals of finite type I , 1967, Journal of Symbolic Logic.

[14]  Philip Wadler,et al.  Strictness analysis aids time analysis , 1988, POPL '88.

[15]  Robert L. Constable,et al.  Constructively formalizing automata theory , 2000, Proof, Language, and Interaction.

[16]  Per Martin-Löf,et al.  Constructive mathematics and computer programming , 1984 .

[17]  Stephen A. Cook,et al.  Review: Alan Cobham, Yehoshua Bar-Hillel, The Intrinsic Computational Difficulty of Functions , 1969 .

[18]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[19]  Helmut Schwichtenberg,et al.  Higher type recursion, ramification and polynomial time , 2000, Ann. Pure Appl. Log..

[20]  Stephen A. Cook,et al.  Feasibly constructive proofs and the propositional calculus (Preliminary Version) , 1975, STOC.

[21]  Ben Wegbreit,et al.  Mechanical program analysis , 1975, CACM.

[22]  A. Haller,et al.  Automatic Program Analysis , 1974 .

[23]  Robert L. Constable.  Type Theory as a Foundation for Computer Science , 1991, TACS.

[24]  Neil D. Jones,et al.  Computational complexity via programming languages: constant factors do matter , 2000, Acta Informatica.

[25]  D. Leivant.  Ramified Recurrence and Computational Complexity I: Word Recurrence and Poly-time , 1995 .

[26]  David Sands,et al.  Complexity Analysis for a Lazy Higher-Order Language , 1989, Functional Programming.