Case-analysis for rippling and inductive proof

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

Volumn 6172 LNCS, Issue , 2010, Pages 291-306

  Johansson, Moa ^a   Dixon, Lucas ^b   Bundy, Alan ^b  

^a UNIVERSITY OF VERONA   (Italy)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATATYPES; INDUCTIVE THEOREM PROVING; ISABELLE; PROOF METHODS;

PROBLEM SOLVING;

THEOREM PROVING;

EID: 77955233330     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14052-5_21     Document Type: Conference Paper

References (20)

1. Aderhold, M.: Improvements in formula generalization. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 231-246. Springer, Heidelberg (2007)
2. Armando, A., Smaill, A., Green, I.: Automatic synthesis of recursive programs: The proof-planning paradigm. Automated Software Engineering 6(4), 329-356 (1999) (Pubitemid 30529041)
3. Boyer, R.S., Moore, J.S.: A Computational Logic. ACM monograph series. Academic Press, London (1979)
4. Bundy, A.: The automation of proof by mathematical induction. In: Handbook of Automated Reasoning, vol. 1. Elsevier, Amsterdam (2001)
5. Bundy, A., Basin, D., Hutter, D., Ireland, A.: Rippling: Meta-level Guidance for Mathematical Reasoning. Cambridge Tracts in Theoretical Computer Science, vol. 56. Cambridge University Press, Cambridge (2005)
6. Bundy, A., Dixon, L., Gow, J., Fleuriot, J.: Constructing induction rules for deductive synthesis proofs. In: CLASE at ETAPS-8. ENTCS, vol. 153, pp. 3-21 (2006)
7. Bundy, A., Stevens, A., van Harmelen, F., Ireland, A., Smaill, A.: Rippling: A heuristic for guiding inductive proofs. Artificial Intelligence 62(2), 185-253 (1993) (Pubitemid 23698136)
8. Bundy, A., van Harmelen, F., Horn, C., Smaill, A.: The Oyster-Clam system. In: Stickel, M.E. (ed.) CADE 1990. LNCS (LNAI), vol. 449, pp. 647-648. Springer, Heidelberg (1990)
9. Dixon, L.: A Proof Planning Framework for Isabelle. PhD thesis, University of Edinburgh (2006)
10. Dixon, L., Fleuriot, J.D.: IsaPlanner: A prototype proof planner in Isabelle. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 279-283. Springer, Heidelberg (2003)
11. Dixon, L., Fleuriot, J.D.: Higher order rippling in IsaPlanner. In: Slind, K., Bunker, A., Gopalakrishnan, G.C. (eds.) TPHOLs 2004. LNCS, vol. 3223, pp. 83-98. Springer, Heidelberg (2004)
12. Huet, G.: The zipper. Journal of Functional Programming 7(5), 549-554 (1997)
13. Ireland, A., Bundy, A.: Productive use of failure in inductive proof. JAR 16(1-2), 79-111 (1996) (Pubitemid 126820793)
14. Kaufmann, M., Moore, J.S.: An industrial strength theorem prover for a logic based on common Lisp. IEEE Transactions on Software Engineering 23(4), 203-213 (1997)
15. Nipkow, T., Paulson, L.C., Wenzel, M.T. (eds.): Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)
16. Paulson, L.C.: Isabelle: A generic theorem prover. Springer, Heidelberg (1994)
17. Richardson, J.D.C., Smaill, A., Green, I.: System description: proof planning in higher-order logic with Lambda-Clam. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS (LNAI), vol. 1421, pp. 129-133. Springer, Heidelberg (1998)
18. Smaill, A., Green, I.: Higher-order annotated terms for proof search. In: vonWright, J., Harrison, J., Grundy, J. (eds.) TPHOLs 1996. LNCS, vol. 1125, pp. 399-413. Springer, Heidelberg (1996)
19. Walther, C., Schweitzer, S.: About VeriFun. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 322-327. Springer, Heidelberg (2003)
20. Wilson, S., Fleuriot, J., Smaill, A.: Automation for dependently typed functional programming. Special Issue on Dependently Typed Programming of Fundamental Informaticae (2009)