Replacement can preserve termination-Reference-Cited by-同舟云学术

Replacement can preserve termination

Published:1997 Issue: Volume: Page:104-129
ISSN:0302-9743
Container-title:Logic Program Synthesis and Transformation
language:
Short-container-title:

Author:

Bossi Annalisa,Cocco Nicoletta

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-62718-9_7.pdf

Reference40 articles.

1. K. R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics. Elsevier, Amsterdam and The MIT Press, Cambridge, 1990.

2. K. R. Apt. Declarative programming in Prolog. In D. Miller, editor, Proceedings of the 1993 International Symposium on Logic Programming, pages 12-35. The MIT Press, 1993.

3. K. R. Apt and B. Marchiori. Reasoning about Prolog programs: from modes through types to assertions. Formal Aspects of Computing, 6(6A):743–765, 1994.

4. K. R. Apt and D. Pedreschi. Studies in Pure Prolog: termination. In J.W. Lloyd, editor, Proceedings of the Simposium in Computational Logic, pages 150–176, Berlin, 1990. Springer-Verlag.

5. Lecture Notes in Computer Science 526;K. R. Apt,1991

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

1. Transformation Systems and Nondeclarative Properties;Computational Logic: Logic Programming and Beyond;2002

2. Transformation of Left Terminating Programs;Logic-Based Program Synthesis and Transformation;2000

3. Advanced Logic Program Specialisation;Partial Evaluation;1999

4. Programs Without Failures;Logic Program Synthesis and Transformation;1998