Towards a domain theory for termination proofs-Reference-Cited by-同舟云学术

Towards a domain theory for termination proofs

Published:1995 Issue: Volume: Page:241-255
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Kahrs Stefan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-59200-8_60.pdf

Reference9 articles.

1. H. P. Barendregt. Lambda calculi with types. In Handbook of Logic in Computer Science, Vol.2, pages 117–309. Oxford Science Publications, 1992.

2. M. C. F. Ferreira and H. Zantema. Total termination of term rewriting. In Rewriting Techniques and Applications, pages 213–227, 1993. LNCS 690.

3. R. Gandy. Proofs of strong normalization. In J. Seldin and J. Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 457–477. Academic Press, 1980.

4. G. Hessenberg. Grundbegriffe der Mengenlehre. Abhandlungen der Fries'schen Schule, pages 479–706, 1906.

5. S. MacLane. Categories for the Working Mathematician. Springer, 1971.

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

1. Size-based termination of higher-order rewriting;Journal of Functional Programming;2018

2. Disunification for Ultimately Periodic Interpretations;Logic for Programming, Artificial Intelligence, and Reasoning;2010

3. New Directions for Syntactic Termination Orderings;Symbolic Rewriting Techniques;1998

4. TEA: Automatically proving termination of programs in a non-strict higher-order functional language;Static Analysis;1997

5. Strong normalisation in higher-order action calculi;Lecture Notes in Computer Science;1997