Another Look at Nested Recursion-Reference-Cited by-同舟云学术

Another Look at Nested Recursion

Published:2000 Issue: Volume: Page:498-518
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Slind Konrad

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44659-1_31

Reference20 articles.

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-Löf 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.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Proof Obligation Generation and Discharging for Recursive Definitions in VDM;Formal Methods and Software Engineering;2010

2. Partial and Nested Recursive Function Definitions in Higher-order Logic;Journal of Automated Reasoning;2009-12-09

3. Partial Recursive Functions in Higher-Order Logic;Automated Reasoning;2006

4. Inductive Invariants for Nested Recursion;Lecture Notes in Computer Science;2003

5. General Recursion in Type Theory;Lecture Notes in Computer Science;2003