Termination of narrowing revisited-Reference-Cited by-同舟云学术

Termination of narrowing revisited

Published:2009-11 Issue:46 Volume:410 Page:4608-4625
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Alpuente María,Escobar Santiago,Iborra José

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference50 articles.

1. Abstract diagnosis of functional programs;Alpuente,2003

2. A declarative debugging scheme for functional logic programs;Alpuente,2002

3. M. Alpuente, S. Escobar, J. Iborra, Modular termination of basic narrowing and equational unification, Journal of Algorithms in Cognition, Informatics and Logic, 2009 (in press). Preliminary version in Proc. 19th International Conference on Rewriting Techniques and Applications, RTA, Lecture Notes in Computer Science, vol. 5117

4. Narrowing as an incremental constraint satisfaction algorithm;Alpuente,1991

5. The semantics of equational logic programming as an instance of CLP;Alpuente,1993

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

1. Optimizing Maude Programs via Program Specialization;Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems;2023

2. Symbolic Specialization of Rewriting Logic Theories with Presto;Theory and Practice of Logic Programming;2022-02-11

3. A Non-Deterministic Multiset Query Language;Fundamenta Informaticae;2022-01-31

4. Variant-based Equational Unification under Constructor Symbols;Electronic Proceedings in Theoretical Computer Science;2020-09-19

5. Most General Variant Unifiers;Electronic Proceedings in Theoretical Computer Science;2019-09-19