Inferring program specifications in polynomial-time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1145, Issue , 1996, Pages 205-219

  Givan, Robert ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Functional programming; Induction; Type inference; Verification

Indexed keywords

APPLICATION PROGRAMS; FUNCTIONAL PROGRAMMING; POLYNOMIAL APPROXIMATION; SPECIFICATIONS; VERIFICATION;

FUNCTIONAL PROGRAMS; INDUCTION; POLYNOMIAL-TIME; PROGRAM SPECIFICATION; TYPE INFERENCES; TYPE SYSTEMS;

STATIC ANALYSIS;

EID: 84957609841     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61739-6_43     Document Type: Conference Paper

References (15)

1. A. Aiken and E. Wimmers. Soft typing with conditional types. In ACM Symposium on Principles of Programming Languges, pages 163-173, 1994.
2. Alexander Aiken and Edward Wimmers. Type inference with set constraints. Research Report 8956, IBM, 1992.
3. J. A. Brzozowski and E. Leiss. On equations for regular languages, finite automata, and sequential networks. Theoretical Computer Science, 10:19-35, 1980.
4. R. L. Constable et. al. Implementing Mathematics with the Nuprl Development system. Prentice-Hall, 1986.
5. Robert Givan. Automatically Inferring Properties of Computer Programs. PhD thesis, Massachusetts Institute of Technology, 1996. http://www.ai.mit.edu- /people/rig/pap ers/thesis.ps.
6. P. Jouvelot and D. Gifford. Algebraic reconstruction of types and effects. In Proceedings of ACM Conference on Principles of Programming Languages, 1991.
7. D. McAllester and K. Arkoudas. Walther recursion. Submitted to CADE-13, available at http://www.ai.mit.edu/people/dam/termination.html, 1996.
8. D. McAllester and R. Givan. Taxonomic syntax for first order inference. JACM, 40(2):246-283, April 1993. internet file ftp.ai.mit.edu:/pub/users/dam/jacml.ps.
9. J. McCarthy. A basis for a math, theory of computation. P. Braffort & D. Hirsch- berg, eds., Computer Programing & Formal Systems. North-Holland, 1967.
10. Robin Milner. Type polymorphism in programming. JCSS, 17:348-375, 1978.
11. John C. Mitchell. A type inference appproach to reduction properties and semantics of polymorphic expressions. In Proceedings 1986 ACM Symposium on Lisp and Functional Programming, pages 308-319, 1986.
12. P. Mishra and U. S. Reddy. Declaration-free type checking. In Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pages 7-21. ACM, 1985.
13. John C. Reynolds. Towards a theory of type structure. In Proceedings Colloque sur la Programmation. Springer-Verlag, 1974.
14. J.W. Thatcher. Tree automata: an informal survey. In A. V. Aho, editor, Currents in Theory of Computation, pages 143-172. Prentice-Hall, 1973.
15. W. Thomas. Automata on infinite objects. In Handbook of Theoretical Computer Science, Volume B, Formal Methods and Semantics, pp. 133-164. MIT Press, 1990.