Why the occur-check is not a problem-Reference-Cited by-同舟云学术

Why the occur-check is not a problem

Published: Issue: Volume: Page:69-86
ISSN:
Container-title:Programming Language Implementation and Logic Programming
language:
Short-container-title:

Author:

Apt Krzysztof R.,Pellegrini Alessandro

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/3-540-55844-6_128.pdf

Reference13 articles.

1. K. R. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 493–574. Elsevier, 1990. Vol. B.

2. R. Chadha and D.A. Plaisted. Correctness of unification without occur check in Prolog. Technical report, Department of Computer Science, University of North Carolina, Chapel Hill, N.C., 1991.

3. P. Deransart, G. Ferrand, and M. Téguia. NSTO programs (not subject to occur-check). In V. Saraswat and K. Ueda, editors, Proceedings of the International Logic Symposium, pages 533–547. The MIT Press, 1991.

4. P. Dembinski and J. Maluszynski. AND-parallelism with intelligent backtracking for annotated logic programs. In Proceedings of the International Symposium on Logic Programming, pages 29–38, Boston, 1985.

5. P. Deransart and J. Maluszynski. Relating Logic Programs and Attribute Grammars. Journal of Logic Programming, 2:119–156, 1985.

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

1. Scheduling Complexity of Interleaving Search;Functional and Logic Programming;2022

2. On logic programs that do not fail;Electronic Notes in Theoretical Computer Science;1999

3. A comparison of three occur-check analysers;Static Analysis;1996

4. Unification-free execution of well-moded and well-typed Prolog programs;Static Analysis;1995

5. On the occur-check-free PROLOG programs;ACM Transactions on Programming Languages and Systems;1994-05