Wellfounded schematic definitions

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1831, Issue , 2000, Pages 45-63

  Slind, Konrad ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; MACHINERY; RECURSIVE FUNCTIONS; THEOREM PROVING;

FORMAL PROGRAMS; FORMAL PROOFS; FREE VARIABLE; FUNCTION DEFINITIONS; PROGRAM SCHEMES; PROGRAM TRANSFORMATIONS; RIGHT-HAND SIDES; TAIL RECURSIVE;

PROGRAM TRANSLATORS;

EID: 42649144810     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/10721959_4     Document Type: Conference Paper

References (33)

1. Penny Anderson and David Basin. Program development schemata as derived rules. Journal of Symbolic Computation, 2000. To appear.
2. Lennart Augustsson. Compiling pattern matching. In J.P. Jouannnaud, editor, Conference on Functional Programming Languages and Computer Architecture (LNCS 201), pages 368-381, Nancy, France, 1985.
3. Bruno Barras, Samuel Boutin, Cristina Cornes, Judicael Courant, Yann Coscoy, David Delahaye, Daniel de Rauglaudre, Jean-Christophe Filliatre, Eduardo Gimenez, Hugo Herbelin, Gerard Huet, Henri Laulhere, Cesar Munoz, Chetan Murthy, Catherine Parent-Vigouroux, Patrick Loiseleur, Christine Paulin-Mohring, Amokrane Saibi, and Benjamin Werner. The Coq Proof Assis-Tant Reference Manual. INRIA, 6.3.1 edition, December 1999. Accessible at http://pauillac.inria.fr/coq/doc/main.html.
4. Richard Bird. Functional algorithm design. In B. Moeller, editor, Mathematics of Program Construction, Third International Conference, (MPC'95), volume LNCS 947, pages 2-17, Kloster Irsee, Germany, July 17-21 1995.
5. Robert S. Boyer and J Strother Moore. A Computational Logic. Academic Press, 1979.
6. Rod Burstall and John Darlington. A transformation system for developing recursive programs. Journal of the Association for Computing Machinery, 24 (1) : 44-67, January 1977.
7. Alonzo Church. A formulation of the Simple Theory of Types. Journal of Symbolic Logic, 5: 56-68, 1940.
8. Nachum Dershowitz and Zohar Manna. Proving termination with multiset orderings. CACM, 22 (8) : 465-476, 1979.
9. Axel Dold. Representing, verifying and applying software development steps using the PVS system. In V.S. Alagar and Maurice Nivat, editors, Proceedings of the Fourth International Conference on Algebraic Methodology and Software Tech-nology, AMAST'95, Montreal, volume 936 of Lecture Notes in Computer Science, pages 431-435. Springer-Verlag, 1995.
10. Axel Dold. Software development in PVS using generic development steps. To appear in Springer LNCS, Proceedings of a Seminar on Generic Programming, April 1998.
11. William Farmer. Recursive definitions in IMPS. Available by anonymous FTP at ftp.harvard.edu, in directory imps/doc, file name recursivedefinitions. dvi.gz, 1997.
12. P. Flener, K.-K. Lau, and M. Ornaghi. On correct program schemas. In N.E. Fuchs, editor, Proceedings of LOPSTR'97 (LNCS 1463), pages 124-143. Springer-Verlag, 1998.
13. Mike Gordon and Tom Melham. Introduction to HOL, a theorem proving environ-ment for higher order logic. Cambridge University Press, 1993.
14. Hardware Verification Group. Hol98 User's Manual. University of Cambridge, December 1999. Accessible at http://www.ftp.cl.cam.ac.uk/ftp/hvg/hol98.
15. John Harrison. Inductive definitions: automation and application. In E. Thomas Schubert, Phillip J. Windley, and James Alves-Foss, editors, Proceedings of the 1995 InternationalWorkshop on Higher Order Logic theorem proving and its appli-cations, number 971 in LNCS, pages 200-213, Aspen Grove, Utah, 1995. Springer-Verlag.
16. John Harrison. HOL-Light: A tutorial introduction. In Proceedings of the First International Conference on Formal Methods in Computer-Aided Design (FM-CAD'96), volume LNCS 1166, pages 265-269. Springer-Verlag, 1996.
17. John Harrison. Theorem Proving with the Real Numbers. CPHC/BCS Distinguished Dissertations. Springer, 1998.
18. Gerard Huet and Bernhard Lang. Proving and applying program transformations expressed with second-order patterns. Acta Informatica, 11: 31-55, 1978.
19. Jeéry R. Lewis, Mark B. Shields, Erik Meijer, and John Launchbury. Implicit parameters: Dynamic scoping with static types. In Tom Reps, editor, ACM Sym-posium on Principles of Programming Languages, Boston, Massachusetss, USA, January 2000. ACM Press.
20. Luc Maranget. Two techniques for compiling lazy pattern matching. Technical Report 2385, INRIA, October 1994.
21. Tom Melham. A package for inductive relation definitions in HOL. In M. Archer, J. J. Joyce, K. N. Levitt, and P. J. Windley, editors, Proceedings of the 1991 InternationalWorkshop on the HOL Theorem Proving System and its Applications, pages 350-357. IEEE Computer Society Press, Davis, California, USA, August 1991.
22. S. Owre, J. M. Rushby, N. Shankar, and D.J. Stringer-Calvert. PVS Sys-Tem Guide. SRI Computer Science Laboratory, September 1998. Available at http://pvs.csl.sri.com/manuals.html.
23. Helmut A. Partsch. Specification and Transformation of Programs: A Formal Ap-proach to Software Development. Texts and Monographs in Computer Science. Springer-Verlag, 1990.
24. Lawrence Paulson. A fixedpoint approach to implementing (co) inductive definitions. In Alan Bundy, editor, 12th International Conference. on Automated Deduc-Tion (CADE), volume LNAI 814, pages 148-161. Springer-Verlag, 1994. Revised version available at http://www.cl.cam.ac.uk/users/lcp/papers/recur.html under title 'A Fixedpoint Approach to (Co) inductive and Co (datatype) Definitions'.
25. Lawrence Paulson. Isabelle : A Generic Theorem Prover. Number 828 in LNCS. Springer-Verlag, 1994. Up-To-date reference manual can be found at http://www.cl.cam.ac.uk/Research/HVG/Isabelle/dist/.
26. Peter Pepper and Douglas R. Smith. A high-level derivation of global search algorithms (with constraint propagation). Science of Computer Programming, 28 (2-3) : 247-271, April 1997.
27. Henrik Persson. Type Theory and the Integrated Logic of Programs. PhD thesis, Chalmers University of Technology, June 1999.
28. Piotr Rudnicki and Andrzej Trybulec. On equivalents of well-foundedness. Journal of Automated Reasoning, 23 (3) : 197-234, 1999.
29. Natarajan Shankar. Steps towards mechanizing program transformations using PVS. In B. Moeller, editor, Mathematics of Program Construction, Third Interna-Tional Conference, (MPC'95), number 947 in Lecture Notes in Computer Science, pages 50-66, Kloster Irsee, Germany, July 17-21 1995.
30. Konrad Slind. Function definition in higher order logic. In Theorem Proving in Higher Order Logics, number 1125 in Lecture Notes in Computer Science, Abo, Finland, August 1996. Springer-Verlag.
31. Konrad Slind. Derivation and use of induction schemes in higher order logic. In Theorem Proving in Higher Order Logics, number 1275 in Lecture Notes in Computer Science, Murrary Hill, New Jersey, USA, August 1997. Springer-Verlag.
32. Konrad Slind. Reasoning about Terminating Functional Programs. PhD thesis, Institut für Informatik, Technische Universität München, 1999. Accessible at http://www.cl.cam.ac.uk/users/kxs/papers.
33. Mitchell Wand. Continuation-based program transformation strategies. Journal of the ACM, 1 (27) : 164-180, January 1980.