Applications of polytypism in theorem proving

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

Volumn 2758, Issue , 2003, Pages 103-119

  Slind, Konrad ^a   Hurd, Joe ^b  

^a Department of Electrical and Computer Engineering   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; FUNCTIONAL PROGRAMMING; FUNCTIONS; RECURSIVE FUNCTIONS;

AUTOMATED TERMINATION PROOFS; BINARY FORMAT; DATATYPES; ENCODING AND DECODING; HIGHER ORDER LOGIC; POLYTYPIC FUNCTIONS; POLYTYPISM; RECURSIVE TYPES;

THEOREM PROVING;

EID: 21144455772     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10930755_7     Document Type: Article

References (26)

1. A. Biere, A. Cimatti, E. Clarke, O. Strichman, and Y. Zhu, Bounded model checking, To appear in Advances in Computers, Number 58.
2. Bruno Barras, Proving and computing in HOL, Theorem Proving in Higher Order Logics, 13th International Conference, TPHOLs 2000, Portland, Oregon, USA, August 14-18, 2000, Proceedings (Mark Aagaard and John Harrison, eds.), Lecture Notes in Computer Science, vol. 1869, Springer, 2000, pp. 17-37.
3. U. Berger and H. Schwichtenberg, An inverse of the evaluation functional for typed λ-calculus, Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science LICS'91 (Amsterdam), IEEE Computer Society Press, July 1991, pp. 203-211.
4. Stefan Berghofer and Tobias Nipkow, Executing higher order logic, Types for Proofs and Programs (TYPES 2000) (P. Callaghan, Z. Luo, J. McKinna, and R. Pollack, eds.), Lecture Notes in Computer Science, vol. 2277, Springer Verlag, 2002, pp. 24-40.
5. Stefan Berghofer and Markus Wenzel, Inductive datatypes in HOL - lessons learned in Formal-Logic Engineering, Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'99) (Nice) (Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin, and L. Thery, eds.), LNCS, no. 1690, Springer-Verlag, 1999.
6. Richard Boulton and Konrad Slind, Automatic derivation and application of induction schemes for mutually recursive functions, Proceedings of the First International Conference on Computational Logic (CL2000) (London, UK), July 2000.
7. Venanzio Capretta, Recursive families of inductive types, Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000 (J. Harrison and M. Aagaard, eds.), Lecture Notes in Computer Science, vol. 1869, Springer-Verlag, 2000, pp. 73-89.
8. A. Filinski, Normalization by evaluation for the computational lambda calculus, Typed Lambda Calculi and Applications 5th International Conference, TLCA 2001 (Krakow, Poland) (S. Abramsky, ed.), LNCS, vol. 2044, Springer Verlag, May 2001.
9. A. Fox, A HOL specification of the ARM instruction set architecture, Tech. Report 545, University of Cambridge Computer Laboratory, June 2001.
10. _, Formal verification of the ARM6 micro-architecture, Tech. Report 548, University of Cambridge Computer Laboratory, November 2002.
11. Juergen Giesl, Termination analysis for functional programs using term orderings, Proceedings of the 2nd International Static Analysis Symposium (Glasgow, Scotland), Springer-Verlag, 1995.
12. Jürgen Giesl, Automatisierung von terminieringsbeweisen für rekursiv defininierte algorithmen, Ph.D. thesis, Technische Hochshule Darmstadt, 1995.
13. Michael J. C. Gordon, Programming combinations of deduction and BDD-based symbolic calculation, LMS Journal of Computation and Mathematics 5 (2002), 56-76.
14. Mike Gordon, PuzzleTool: an example of programming computation and deduction, Theorem Proving in Higher Order Logics, 15th International Conference, TPHOLs 2002, Hampton, Virginia, USA, August 2002, Proceedings (V. A Carreno, C. A. Munoz, and S. Tahar, eds.), Lecture Notes in Computer Science, vol. 2410, Springer, 2002, pp. 214-229.
15. Mike Gordon and Tom Melham, Introduction to HOL, a theorem proving environment for higher order logic, Cambridge University Press, 1993.
16. Benjamin Grégoire and Xavier Leroy, A compiled implementation of strong reduction, International Conference on Functional Programming 2002, ACM Press, 2002.
17. E. L. Gunter, A broader class of trees for recursive type definitions for HOL, Higher Order Logic Theorem Proving and its Applications: 6th International Workshop (HUG'93) (J. J. Joyce and C.-J. H. Seger, eds.), Lecture Notes in Computer Science, no. 780, Springer-Verlag, Vancouver, B.C., August 11-13 1994, pp. 141-154.
18. John Harrison, Inductive definitions: automation and application, Proceedings of the 1995 International Workshop on Higher Order Logic theorem proving and its applications (Aspen Grove, Utah) (E. Thomas Schubert, Phillip J. Windley, and James Alves-Foss, eds.), LNCS, no. 971, Springer-Verlag, 1995, pp. 200-213.
19. R. Hinze, J. Jeuring, and A. Loeh, Type-indexed data types, Mathematics of Program Construction 6th International Conference, MPC 2002 Proceedings (Dagstuhl Castle, Germany) (E.A. Boiten and B. Moeller, eds.), LNCS, no. 2386, Springer Verlag, July 2002, pp. 98-114.
20. Ralf Hinze, A new approach to generic functional programming, 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'00) (Boston, Massachusetts), ACM Press, 2000.
21. Tom Melham, Automating recursive type definitions in higher order logic, Current Trends in Hardware Verification and Automated Theorem Proving (Graham Birtwistle and P.A. Subrahmanyam, eds.), Springer-Verlag, 1989, pp. 341-386.
22. J Moore, Symbolic simulation: An ACL2 approach, Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design (FM-CAD'98) (G. Gopalakrishnan and P. Windley, eds.), vol. LNCS 1522, Springer-Verlag, November 1998, pp. 334-350.
23. M. Norrish and K. Slind, A thread of HOL development, The Computer Journal 45 (2002), no. 1, 37-45.
24. N. Shankar, Static analysis for safe destructive updates in a functional language, Logic Based Program Synthesis and Transformation, 11th International Workshop, LOPSTR 2001, Paphos, Cyprus, November 28-30, 2001, Selected Papers (Alberto Pettorossi, ed.), Lecture Notes in Computer Science, vol. 2372, Springer Verlag, 2001, pp. 1-24.
25. Konrad Slind, Reasoning about terminating functional programs, Ph.D. thesis, Institut für Informatik, Technische Universität München, 1999, http:/tumb1.biblio.tu-muenchen.de/publ/diss/in/1999/slind.html.
26. Stephanie Weirich, Higher-order intensional type analysis, Programming Languages and Systems: 11th European Symposium on Programming, ESOP 2002 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002 (Daniel Le Métayer, ed.), 2002, pp. 98-114.