ELAN from a rewriting logic point of view-Reference-Cited by-同舟云学术

ELAN from a rewriting logic point of view

Published:2002-08 Issue:2 Volume:285 Page:155-185
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Borovanský Peter,Kirchner Claude,Kirchner Hélène,Moreau Pierre-Etienne

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference72 articles.

1. The B-Book: Assigning Programs to Meanings;Abrial,1996

2. C. Alvarado, Q.-H. Nguyen, ELAN for equational reasoning in COQ, in: J. Despeyroux (Ed.), Proc. 2nd Workshop on Logical Frameworks and Metalanguages, Santa Barbara (California), June 2000.

3. T. Arts, Automatically proving termination and innermost normalisation of term rewriting systems, Ph.D. Thesis, Universiteit Utrecht, 1997.

4. Term Rewriting and all That;Baader,1998

5. L. Bachmair, T. Chen, I.V. Ramakrishnan, Associative–commutative discrimination nets, in: M.-C. Gaudel, J.-P. Jouannaud (Eds.), TAPSOFT ’93: Theory and Practice of Software Development, 4th Intern. Joint Conf. CAAP/FASE, Lecture Notes in Computer Science, Vol. 668, Orsay, France, April 13–17, 1993, Springer, Berlin, pp. 61–74.

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

1. Symbolic analysis and parameter synthesis for networks of parametric timed automata with global variables using Maude and SMT solving;Science of Computer Programming;2024-03

2. Reconstructing Fine-Grained Proofs of Rewrites Using a Domain-Specific Language;Form Comp Aid Design;2022

3. Strategic tree rewriting in attribute grammars;Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering;2020-11-15

4. On declarative rewriting for sound and complete union, intersection and negation types;Journal of Computer Languages;2019-02

5. Building and Combining Matching Algorithms;Lecture Notes in Computer Science;2019