Automated complexity analysis of Nuprl extracted programs

Journal of Functional Programming

Volumn 11, Issue 1, 2001, Pages 3-31

  Benzinger, Ralph ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035613548     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796800003865     Document Type: Article

References (34)

1. Bates, J. L. and Constable, R. L. (1985) Proofs as programs. ACM Trans. Programming Languages & Syst., 7(1).
2. Benzinger, R. (1999) Automated complexity analysis of Nuprl extracts. MPhil thesis, Cornell University.
3. Bjerner, B. and Holmström, S. (1989) A compositional approach to time analysis of first order lazy functional programs. 4th International Conference on Functional Programming Languages and Computer Architecture.
4. Bjørner, D. and Jones, C. B. (1978) The Vienna Development Method: Lecture Notes in Computer Science 61. Springer-Verlag.
5. Caldwell, J. L. (1997) Moving Proofs-as-Programs into practice. IEEE International Conference on Automated Software Engineering.
6. Constable, R. L., Allen, S. F., Bromley, H. M., Cleaveland, W. R., Cremer, J. F., Harper, R. W., Howe, D. J., Knoblock, T. B., Mendler, N. P., Panangaden, P., Sasaki, J. T. and Smith, S. F. (1986) Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall.
7. Constable, R. L., Jackson, P. B., Naumov, P. and Uribe, J. (1998) Constructively formalizing automata. Proof, Language and Interaction: Essays in honour of Robin Milner. MIT Press.
8. Coquand, T. and Huet, G. (1985) Constructions: A higher order proof system for mechanizing mathematics. Eurocal '85: Lecture Notes in Computer Science 203. Springer.
9. Flajolet, P., Salvy, B. and Zimmermann, P. (1990) Automatic average-case analysis of algorithms. Technical report 1233, INRIA, France.
10. Gordon, M. J. C. and Melham, Thomas F. (1993) Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press.
11. Greiner, J. (1997) Semantics-based parallel cost models and their use in provably efficient implementations. PhD thesis, Carnegie-Mellon University.
12. Gries, D. (1982) A note on the standard strategy for developing loop invariants and loops. Technical report, TR 82-531, Cornell University.
13. Hafizogullari, O. and Kreitz, C. (1998) Dead code elimination through type inference. Technical report, Cornell University.
14. Hickey, J. J. (2000) MetaPRL. PhD thesis, Cornell University.
15. Hickey, T. and Cohen, J. (1988) Automating program analysis. J. ACM, 35(1), 185-220.
16. Hoare, C. A. R. (1969) An axiomatic basis for computer programming. Commun. ACM, 12(10), 576-580.
17. Lawall, J. L. and Mairson, Harry G. (1996) Optimality and efficiency: What isn't a cost model of the lambda calculus? ACM International Conference on Functional Programming, pp. 92-101.
18. Levy, H. and Lessman, F. (1961) Finite Difference Equations. Macmillan.
19. Martin-Löf, P. (1979) An intuitionistic theory of types: Predicative part. Logic Colloquium.
20. Métayer, D. L. (1988) ACE: An automatic complexity evaluator. ACM Trans. Programming Languages and Syst., 10(2).
21. Nogin, Alexsey (1997) Improving the efficiency of Nuprl proofs. Technical report TR97-1643, Cornell University.
22. Owre, S., Rushby, J. M. and Shankar, N. (1992) PVS: A prototype verification system. Lecture Notes in Computer Science 607. Springer-Verlag.
23. Paulin-Mohring, C. (1989) Extraction in the calculus of constructions. PhD thesis, University of Paris VII.
24. Paulin-Mohring, C. and Werner, B. (1993) Synthesis of ML programs in the system Coq. J. Symbolic Computations, 15, 607-640.
25. Paulson, L. C. (1994) Isabelle: a generic theorem prover: Lecture Notes in Computer Science 828. Springer-Verlag.
26. Rosendahl, M. (1986) Automatic program analysis. MPhil thesis, University of Copenhagen.
27. Rosendahl, M. (1989) Automatic complexity analysis. 4th International Conference on Functional Programming Languages and Computer Architecture.
28. Sands, D. (1990) Complexity analysis for a lazy higher-order language. 3rd European symposium on programming: Lecture Notes in Computer Science 432. Springer-Verlag.
29. Sands, D. (1995) A naive time analysis and its theory of cost equivalence. J. Logic & Computation, 5(4).
30. Smith, D. R. (1990) KIDS: A semi-automatic program development system. IEEE Trans. Software Eng., 16(9), 1024-1043
31. Spivey, J. M. (1992) The Z Notation: A reference manual. Second edn. International Series in Computer Science. Prentice-Hall.
32. Wadler, P. (1989) Strictness analysis aids time analysis. Fourth International Conference on Functional Programming Languages and Computer architecture.
33. Wegbreit, B. (1975) Mechanical program analysis. Comm. ACM, 18(9).
34. Wolfram, S. (1996) The Mathematica Book, 3rd edn.