Automatic verification of functions with accumulating parameters

Journal of Functional Programming

Volumn 9, Issue 2, 1999, Pages 225-245

  Ireland, Andrew ^a   Bundy, Alan ^b  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033459078     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796899003408     Document Type: Article

References (30)

1. Aubin, R. (1976) Mechanizing structural induction. PhD thesis, University of Edinburgh.
2. Basin, D. and Walsh, T. (1996). A calculus for and termination of rippling. J. Automated Reasoning, 16(1-2), 147-180.
3. Bird, R. (1998) Introduction to Functional Programming using Haskell. Prentice Hall.
4. Bird, R. and Wadler, P. (1988) Introduction to Functional Programming. Prentice Hall.
5. Boyer, R. S. and Moore, J. S. (1979) A Computational Logic. Academic Press (ACM monograph series).
6. Boyer, R. S. and Moore, J. S. (1988) A Computational Logic Handbook. Academic Press (Perspectives in Computing, Vol 23).
7. Bundy, A. (1988) The use of explicit plans to guide inductive proofs. In: Lusk, R. and Overbeek, R. (eds), 9th Conference on Automated Deduction, pp. 111-120. Springer-Verlag.
8. Bundy, A., van Harmelen, F., Horn, C. and Smaill, A. (1990) The Oyster-Clam system. In: Stickel, M. E. (ed), 10th International Conference on Automated Deduction: Lecture Notes in Artificial Intelligence 449., pp. 647-648. Springer-Verlag.
9. Bundy, A, Stevens, A., van Harmelen, F., Ireland, A. and Smaill, A. (1993) Rippling: A heuristic for guiding inductive proofs. Artificial intelligence, 62, 185-253.
10. Gordon, M. J., Milner, A. J. and Wadsworth, C. P. (1979) Edinburgh LCF - a mechanised logic of computation: Lecture Notes in Computer Science 78. Springer-Verlag.
11. Henderson, P. (1980) Functional Programming. Prentice Hall.
12. Hesketh, J., Bundy, A. and Smaill, A. (1992) Using middle-out reasoning to control the synthesis of tail-recursive programs. In: Kapur, D. (ed), 11th Conference on Automated Deduction: Lecture Notes in Artificial Intelligence 607, pp. 310-324. Springer-Verlag.
13. Hesketh, J. T. (1991) Using middle-out reasoning to guide inductive theorem proving. PhD thesis, University of Edinburgh.
14. Hutter, D. and Kohlhase, M. (1997) A colored version of the λ-Calculus. In: McCune, W. (ed), 14th Conference on Automated Deduction, pp. 291-305. Springer-Verlag.
15. Hutter, D. and Sengler, C. (1996) INKA: The Next Generation. In: McRobbie, M. A. and Slaney, J. K. (eds), Proceedings of CADE-13: Lecture Notes in Artificial Intelligence 1104. Springer-Verlag.
16. Ireland, A. (1992) The Use of Planning Critics in Mechanizing Inductive Proofs. In: Voronkov, A. (ed), International Conference on Logic Programming and Automated Reasoning - IPAR 92: Lecture Notes in Artificial Intelligence 624, pp. 178-189. St. Petersburg. Springer-Verlag.
17. Ireland, A. and Bundy, A. (1996) Productive Use of Failure in Inductive Proof. J. Automated Reasoning, 16(1-2), 79-111.
18. Ireland, A. and Stark, J. (1997) On the Automatic Discovery of Loop Invariants. Proc. 4th NASA Langley Formal Methods Workshop. NASA Conference Publication 3356.
19. Ireland, A., Jackson, M. and Reid, G. (1997) A collaborative approach to theorem proving. Proc. 1st International Workshop on Proof Transformation and Presentation (PTP-97).Schloss Dagstuhl, Germany.
20. Kaldewaij, A. (1990) Programming: The derivation of algorithms. Prentice Hall.
21. Kapur, D. and Zhang, H. (1995) An Overview of Rewrite Rule Laboratory (RRL). J. Computer & Mathematics with Applic., 29(2), 91-114.
22. Kaufmann, M. and Moore, J. (1997) An industrial strength theorem prover for a logic based on Common Lisp. IEEE Trans. Software Eng., 23(4), 203-213.
23. Kreisel, G. (1965) Mathematical logic. In: Saaty, T. L. (ed), Lectures on Modern Mathematics, vol III, pp. 95-195. Wiley.
24. Michaelson, G. and Scaife, N. (1995) Prototyping a parallel vision system in Standard ML. J. Functional Programming, 5, 345-382.
25. Miller, D. and Nadathur, G. (1988) An overview of λProlog. In: Bowen, K. and Kowalski, R. (eds), Proc. 5th International Logic Programming Conference/5th Symposium on Logic Programming. MIT Press.
26. ORA (1996) Introduction to EVES: Eercises and Notes. Odyssey Research Associates, Ottawa Ontario, Canada.
27. Owre, S., Rushby, J. M. and Shankar, N. (1992) PVS: An integrated approach to specification and verification. Forthcoming. SRI International.
28. Pierre, L. (1995) An automatic generalization method for the inductive proof of replicated and parallel architectures. In: Kropf, R. and Kumar, T. (eds), Theorem Provers in Circuit Design: Lecture Notes in Computer Science 901. Springer-Verlag.
29. Smaill, A. and Green, I. (1996) Higher-Order Annotated Terms for Proof Search. Proceedings of TPHOLS'96.
30. Turner, R. (1991) Constructive Foundations for Functional Languages. McGraw-Hill.