Non-deterministic computations in ELAN - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

Non-deterministic computations in ELAN


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 non-deterministic 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.
No file

Dates and versions

inria-00098483 , version 1 (25-09-2006)


  • HAL Id : inria-00098483 , version 1


Hélène Kirchner, Pierre-Etienne Moreau. Non-deterministic computations in ELAN. Recent Developments in Algebraic Development Techniques. 13th International Workshop - WADT'98, Jose Luiz Fiadeiro, 1998, Lisbone, 15 p. ⟨inria-00098483⟩
34 View
0 Download


Gmail Facebook Twitter LinkedIn More