Another look at nested recursion

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

Volumn 1869, Issue , 2000, Pages 498-518

  Slind, Konrad ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

CLASSICAL HIGHER-ORDER LOGIC; NESTED RECURSION; PROGRAM SCHEMES; RECURSIONS; TERMINATION CONDITION;

THEOREM PROVING;

EID: 84949210465     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44659-1_31     Document Type: Conference Paper

References (20)

1. S. Agerholm. LCF examples in HOL. The Computer Journal, 38(2):121-130, July 1995.
2. Richard Boulton and Konrad Slind. Automatic derivation and application of induction schemes for mutually recursive functions. In Proceedings of the First International Conference on Computational Logic (CL2000), London, UK, July 2000. To appear. Available at http://www. cl. cam. ac. uk/users/kxs/papers/mutual.html.
3. Ana Bove. Programming in Martin-L6f Type Theory. Unification: A non-trivial Example. Master's thesis, Chalmers University of Technology, 1999. Licentiate Thesis.
4. Robert S. Boyer and J Strother Moore. A Computational Logic. Academic Press, 1979.
5. Robert S. Boyer and J Strother Moore. A Computational Logic Handbook. Academic Press, 1988.
6. Simon Finn, Mike Fourman, and John Longley. Partial functions in a total setting. Journal of Automated Reasoning, 18(1):85-104, February 1997.
7. Juergen GLesl. Termination of nested and mutually recursive algorithms. Journal of Automated Reasoning, 19(1):1-29, August 1997.
8. Jiirgen Giesl. Automatisierung von Terminieringsbeweisen fur rekursiv defininierte Algorithmen. PhD thesis, Technische Hochshule Darmstadt, 1995.
9. Deepak Kapur and M. Subramaniam. Automating induction over mutually recursive functions. In Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology (AMAST'96), volume 1101 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
10. Zohar Manna and Richard Waldinger. Deductive synthesis of the unification algorithm. Science of Computer Programming, 1:5-48, 1981.
11. Conor McBride. Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh, 1999.
12. Bengt Nordstrom. Terminating general recursion. BIT, 28:605-619, 1988.
13. S. Owre, J. M. Rushby, N. Shankar, and D.J. Stringer-Calvert. PVS System Guide. SRI Computer Science Laboratory, September 1998. Available at http://pvs.csl.sri.com/manuals.html.
14. Lawrence Paulson. Verifying the unification algorithm in LCF. Science of Computer Programming, 3:143-170, 1985.
15. Lawrence Paulson. ML for the working programmer. Cambridge University Press, second edition, 1996.
16. Joseph Rouyer. Developpement d'algorithme d'unification dans le Calcul des Constructions avecs types inductifs. Technical Report 1795, INRIA-Lorraine, November 1992.
17. Konrad Slind. Function definition in higher order logic. In Theorem Proving in Higher Order Logics, number 1125 in Lecture Notes in Computer Science, Turku, Finland, August 1996. Springer-Verlag.
18. 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.
19. Konrad Slind. Reasoning about Terminating Functional Programs. PhD thesis, Institut fur Informatik, Technische Universitat Miinchen, 1999. Accessible at http://www.cl.cam.ac.uk/users/kxs/papers.
20. Konrad Slind. Wellfounded schematic definitions. In David McAUester, editor, Proceedings of the Seventeenth International Conference on Automated Deduction CADE-17, volume 1831, Pittsburgh, Pennsylvania, June 2000. Springer-Verlag.