Context Unification and Traversal Equations-Reference-Cited by-同舟云学术

Context Unification and Traversal Equations

Published:2001 Issue: Volume: Page:169-184
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Levy Jordi,Villaret Mateu

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45127-7_14

Reference23 articles.

1. Lect Notes Comput Sci;H. Comon,1992

2. Hubert Comon. Completion of rewrite systems with membership constraints. Journal of Symbolic Computation, 25(4):397–453, 1998.

3. Volker Diekert, Yuri Matiyasevich, and Anca Muscholl. Solving trace equations using lexicographical normal forms. In Int. Colloquium on Automata, Languages and Programming, ICALP’97, pages 336–346, Bologna, Italy, 1997.

4. Markus Egg, Joachim Niehren, Peter Ruhrberg, and Feiyu Xu. Constraints over lambda-structures in semantic underspecification. In Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and the 17th International Conference on Computational Linguistics (ACL’98), pages 353–359, Montreal, Quebec, Canada, 1998.

5. Alexander Koller, Joachim Niehren, and Ralf Treinen. Dominance constraints: Algorithms and complexity. In Proceedings of the Third Conf. on Logical Aspects of Computational Linguistics, Grenoble, France, 1998.

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

1. Simplifying the signature in second-order unification;Applicable Algebra in Engineering, Communication and Computing;2009-09-04

2. Describing Lambda Terms in Context Unification;Logical Aspects of Computational Linguistics;2005

3. Currying Second-Order Unification Problems;Rewriting Techniques and Applications;2002

4. Sequence Unification Through Currying;Lecture Notes in Computer Science