Higher-order annotated terms for proof search-Reference-Cited by-同舟云学术

Higher-order annotated terms for proof search

Published:1996 Issue: Volume: Page:399-413
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Smaill Alan,Green Ian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0105418

Reference25 articles.

1. R. Aubin. Some generalization heuristics in proofs by induction. In G. Huet and G. Kahn, editors, Actes du Colloque Construction: Amélioration et vérification de Programmes. Institut de recherche d'informatique et d'automatique, 1975.

2. H. P. Barendregt. The Lambda Calculus. Elsevier, 1985.

3. David Basin and Toby Walsh. A calculus for and termination of rippling. Technical report, MPI, 1994. To appear in special issue of the Journal of Automated Reasoning.

4. David Basin and Toby Walsh. A calculus for rippling. In Proceedings of CTRS-94, 1994.

5. David Basin and Toby Walsh. Termination orders for rippling. In Alan Bundy, editor, 12th Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, Vol. 814, pages 466–83, Nancy, France, 1994. Springer-Verlag.

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

1. The Use of Embeddings to Provide a Clean Separation of Term and Annotation for Higher Order Rippling;Journal of Automated Reasoning;2010-05-13

2. Case-Analysis for Rippling and Inductive Proof;Interactive Theorem Proving;2010

3. Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery;Verification, Induction, Termination Analysis;2010

4. Poitín: Distilling Theorems From Conjectures;Electronic Notes in Theoretical Computer Science;2006-03

5. Best-First Rippling;Reasoning, Action and Interaction in AI Theories and Systems;2006