An overview of ELAN

Electronic Notes in Theoretical Computer Science

Volumn 15, Issue , 1998, Pages 55-70

  Borovanský, Peter ^a   Kircliner, Claude ^a   Kircliner, Hélène ^a   Moreau, Pierre Etienne ^a   Ringeissen, Christophe ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

BIBLIOGRAPHIC REFERENCES; RULE-BASED PROGRAMMING;

BIBLIOGRAPHIC RETRIEVAL SYSTEMS;

EID: 84874257101     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)82552-6     Document Type: Conference Paper

References (29)

1. P. Borovansky. The Control of Rewriting: Study and Implementation of a Strategy Formalism. This volume.
2. P. Borovansky. Implementation of higher-order unification based on calculus of explicit substitutions. In Proceedings of SOFSEM'95, Lecture Notes in Computer Science, pages 363-368. Springer-Verlag, 1995. (Pubitemid 126003885)
3. P. Borovansky. Le controls de la reecriture: etude et implantation d'un formalisme de strategies. These de Doctorat d'Universite, Universite Henri Poincare-Nancy 1, octobre 1998.
4. P. Borovansky and C. Castro. Cooperation of Constraint Solvers: Using the New Process Control Facilities of ELAN. This volume.
5. P. Borovansky, S. Jamoussi, P.-E. Moreau, and C. Ringeissen. Handling ELAN Rewrite Programs via an Exchange Format. This volume.
6. P. Borovansky, C. Kirchner, and H. Kirchner. Controlling Rewriting by Rewriting. In J. Meseguer, editor, Proc. First Intl. Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science, Asilomar (California), September 1996. Elsevier.
7. P. Borovansky, C. Kirchner, and H. Kirchner. Rewriting as a Unified Specification Tool for Logic and ControhThe ELAN Language. In Proceedings of International Workshop on Theory and Practice of Algebraic Specifications ASF+SDF 97, Workshops in Computing, Amsterdam, September 1997. Springer-Verlag.
8. P. Borovansky, C. Kirchner, and H. Kirchner. A functional view of rewriting and strategies for a semantics of ELAN. In M. Sato and Y. Toyama, editors, The Third Fuji International Symposium on Functional and Logic Programming, pages 143-167, Kyoto, April 1998. World Scientific.
9. P. Borovansky, C. Kirchner, H. Kirchner, P.-E. Moreau, and M. Vittek. ELAN: A logical framework based on computational systems. In J. Meseguer, editor, Proc. First Intl. Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science, Asilomar (California), September 1996. Elsevier.
10. P. Borovansky, C. Kirchner, H. Kirchner, P.-E. Moreau, and M. Vittek. ELAN V 3.0 User Manual. Inria Lorraine & Loria, Nancy (France), second edition, January 1998.
11. P. Borovansky and H. Kirchner. Strategies of ELAN: meta-interpretation and partial evaluation. In Proceedings of International Workshop on Theory and Practice of Algebraic Specifications ASF+SDF 97, Workshops in Computing, Amsterdam, September 1997. Springer-Verlag.
12. C. Castro. Binary CSP Solving as an Inference Process. In Proceedings of the Eighth International Conference on Tools in Artificial Intelligence, ICTAF96, Toulouse, France, pages 462-463, November 1996.
13. C. Castro. Solving Binary CSP using Computational Systems. In J. Meseguer, editor, Proc. First Intl. Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science, Asilomar (California), September 1996. Elsevier.
14. C. Castro. Constraint Manipulation using Rewrite Rules and Strategies. In A. Drewery, G.-J. M. Kruijff, and R. Zuber, editors, Proceedings of the Second ESSLLI Student Session, 9th European Summer School in Logic, Language and Information, ESSLLI'97, pages 45-56, Aix-en-Provence, France, August 1997.
15. C. Castro. Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies. Fundamenta Informaticae, 34(3):263-293, September 1998. (Pubitemid 128434060)
16. T. Genet. Decidable Approximations of Sets of Descendants and Sets of Normal Forms. In Proceedings 9th Conference on Rewriting Techniques and Applications, Tsukuba (Japan), volume 1379 of Lecture Notes in Computer Science, pages 151-165. Springer-Verlag, 1998. (Pubitemid 128054452)
17. T. Genet and I. Gnaedig. Termination Proofs using gpo Ordering Constraints. In M. Bidoit and M. Dauchet, editors, Proceedings 22nd International Colloquium, on Trees in Algebra and Programming, Lille (France), volume 1214 of Lecture Notes in Computer Science, pages 249-260. Springer-Verlag, 1997. (Pubitemid 127053350)
18. C. Kirchner, H. Kirchner, and M. Vittek. Designing Constraint Logic Programming Languages using Computational Systems. In P. Van Hentenryck and V. Saraswat, editors, Principles and Practice of Constraint, Programming. The Newport Papers., pages 131-158. MIT press, 1995.
19. C. Kirchner and C. Ringeissen. Rule-Based Constraint Programming. Fundamenta Informaticae, 34(3):225-262, September 1998. (Pubitemid 128434059)
20. H. Kirchner and P.-E. Moreau. Prototyping completion with constraints using computational systems. In J. Hsiang, editor, Proceedings 6th Conference on Rewriting Techniques and Applications, Kaiserslautern (Germany), volume 914 of Lecture Notes in Computer Science, pages 438-443. Springer-Verlag, 1995.
21. H. Kirchner and P.-E. Moreau. A reflective extension of ELAN. In J. Meseguer, editor, Proc. First Intl. Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science, Asilomar (California), September 1996. Elsevier.
22. H. Kirchner and P.-E. Moreau. Non-deterministic Computations in ELAN, 1998. Submitted.
23. P. Moreau and H. Kirchner. A compiler for rewrite programs in associative-commutative theories. In C. Palamidessi, H. Glaser, and K. Meinke, editors, Principles of Declarative Programming, number 1490 in Lecture Notes in Computer Science, pages 230-249. Springer-Verlag, September 1998. (Pubitemid 128136309)
24. P.-E. Moreau. A choice-point library for backtrack programming. JICSLP'98 Post-Conference Workshop on Implementation Technologies for Programming Languages based on Logic, June 1998.
25. P.-E. Moreau and H. Kirchner. Compilation Techniques for Associative-Commutative Normalisation. In Proceedings of International Workshop on Theory and Practice of Algebraic Specifications ASF+SDF 97, Workshops in Computing, Amsterdam, September 1997. Springer-Verlag.
26. C. Ringeissen. Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language. In Proceedings 8th Conference on Rewriting Techniques and Applications, Sitges (Spain), volume 1232 of Lecture Notes in Computer Science, pages 323-326. Springer-Verlag, 1997. (Pubitemid 127105930)
27. P. Viry. Input/Output for ELAN. In J. Meseguer, editor, Proc. First Intl. Workshop on Rewriting Logic and its Applications, volume 4 of Electronic Notes in Theoretical Computer Science, Asilomar (California), September 1996. Elsevier.
28. M. Vittek. ELAN: Un cadre logique pour le prototypage de langages de programmation avec contraintes. These de Doctorat d'Universite, Universite Henri Poincare-Nancy 1, octobre 1994.
29. M. Vittek. A Compiler for Nondeterministic Term Rewriting Systems. In H. Ganzinger, editor, Proceedings 7th Conference on Rewriting Techniques and Applications, New Brunswick (New Jersey, USA), volume 1103 of Lecture Notes in Computer Science, pages 154-168. Springer-Verlag, July 1996. (Pubitemid 126101681)