Completion of a set of rules modulo a set of equations
SIAM Journal on Computing
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
A meta-environment for generating programming environments
ACM Transactions on Software Engineering and Methodology (TOSEM)
OPAL: design and implementation of an algebraic programming language
Proceedings of the international conference on Programming languages and system architectures
Search and imperative programming
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Rule-based constraint programming
Fundamenta Informaticae - Special issue on foundations of constraint programming
Building constraint satisfaction problem solvers using rewrite rules and strategies
Fundamenta Informaticae - Special issue on foundations of constraint programming
A Compiler for Rewrite Programs in Associative-Commutative Theories
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Prototyping Completion with Constraints Using Computational Systems
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
A Compiler for Nondeterministic Term Rewriting Systems
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for experimenting their combination.The ELAN language is based on rewriting logic and evaluation of labelled conditional rewrite rules. ELAN has two originalities with respect to several other algebraic languages, namely to handle nondeterministic computations and to provide a user-defined strategy language for controlling rule application. We focus in this paper on these two related aspects and explain how non-determinism is used in ELAN programs and handled in the ELAN compiler.