Non-deterministic Computations in ELAN

Abstract. 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.

• Type: Conference
• Year: 1998
• Where: WADT
• Authors: Hélène Kirchner, Pierre-Etienne Moreau
• Keywords: ELAN Compiler, ELAN Language, Labelled Conditional Rewrite, Software Engineering, WADT 1998