ELAN
The ELAN system provides an environment for specifying and prototyping deduction systems in a language based on rules controlled by strategies. Its purpose is to support the design of theorem provers, logic programming languages, constraints solvers and decision procedures and to offer a modular framework for studying their combination. Its purpose is to support the design of theorem provers, logic programming languages, constraints solvers and decision procedures and to offer a modular framework for studying their combination. ELAN takes from functional programming the concept of abstract data types and the function evaluation principle based on rewriting. But rewriting is inherently non-deterministic since several rules can be applied at different positions in a same term, and in ELAN, a computation may have several results. This aspect is taken into account through choice operations and a backtracking capability. One of the main originality of the language is to provide strategy constructors to specify whether a function call returns several, at-least one or only one result. This declarative handling of non-determinism is part of a strategy language allowing the programmer to specify the control on rules application. This is in contrast to many existing rewriting-based languages where the term reduction strategy is hard-wired and not accessible to the designer of an application. The strategy language offers primitives for sequential composition, iteration, deterministic and non-deterministic choices of elementary strategies that are labelled rules. From these primitives, more complex strategies can be expressed. In addition the user can introduce new strategy operators and define them by rewrite rules. Evaluation of strategy application is itself based on rewriting. So the simple and well-known paradigm of rewriting provides both the logical framework in which deduction systems can be expressed and combined, and the evaluation mechanism of the language. The purpose of these pages is to summarize ELAN features, library and environment and to provide a guide to the literature on the language.
Keywords for this software
References in zbMATH (referenced in 84 articles , 2 standard articles )
Showing results 1 to 20 of 84.
Sorted by year (- Lucas, Salvador; Meseguer, José: Dependency pairs for proving termination properties of conditional term rewriting systems (2017)
- Ciobanu, Gabriel; Koutny, Maciej; Steggles, Jason: Strategy based semantics for mobility with time and access permissions (2015)
- Gnaedig, Isabelle; Kirchner, Hélène: Proving weak properties of rewriting (2011)
- Alpuente, M.; Ballis, D.; Correa, F.; Falaschi, M.: An integrated framework for the diagnosis and correction of rule-based programs (2010)
- Shankar, Natarajan: Rewriting, inference, and proof (2010)
- Şerbănuţă, Traian Florin; Roşu, Grigore; Meseguer, José: A rewriting logic approach to operational semantics (2009)
- Brabrand, Claus; Schwartzbach, Michael I.: The metafront system: safe and extensible parsing and transformation (2007)
- Cirstea, Horatiu; Faure, Germain; Kirchner, Claude: A $\rho$-calculus of explicit constraint application (2007)
- Erwig, Martin; Ren, Deling: An update calculus for expressing type-safe program updates (2007)
- Conchon, Sylvain; Krstić, Sava: Strategies for combining decision procedures (2006)
- May, Jonathan; Knight, Kevin: Tiburon: a weighted tree automata toolkit (2006)
- Rossi, Francesca (ed.); van Beek, Peter (ed.); Walsh, Toby (ed.): Handbook of constraint programming. (2006)
- Tratt, Laurence: Model transformations and tool integration (2005) ioport
- Verdejo, Alberto; Martí-Oliet, Narciso: Two case studies of semantics execution in Maude: CCS and LOTOS (2005)
- Visser, Eelco: A survey of strategies in rule-based program transformation systems (2005)
- Feuillade, Guillaume; Genet, Thomas; Viet Triem Tong, Valérie: Reachability analysis over term rewriting systems (2004)
- Fissore, Olivier; Gnaedig, Isabelle; Kirchner, Hélène: Outermost ground termination (2004)
- Kirchner, Claude; Kirchner, Hélène: Rule-based programming and proving: The ELAN experience outcomes (2004)
- Marin, Mircea; Kutsia, Temur: A rule-based approach to the implementation of evaluation strategies (2004)
- Thati, Prasanna; Sen, Koushik; Martí-Oliet, Narciso: An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0 (2004)