ELAN from a rewriting logic point of view

ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or to describe and execute deterministic as well as non-deterministic rule-based processes. With the general goal to make precise a rewriting logic-based semantics of ELAN, this paper has three contributions: a presentation of the concepts of rules and strategies available in ELAN, an expression of rewrite rules with matching conditions in conditional rewriting logic, and finally an enrichment mechanism of a rewrite theory into a strategy theory in conditional rewriting logic.

[1]  Claude Kirchner,et al.  A Functional View of Rewriting and Strategies for a Semantics of ELAN , 1998, Fuji International Symposium on Functional and Logic Programming.

[2]  Claude Kirchner,et al.  Controlling rewriting by rewriting , 1996, WRLA.

[3]  Jean-Marie Hullot,et al.  Associative Commutative Pattern Matching , 1979, IJCAI.

[4]  Hélène Kirchner,et al.  Termination of Rewriting with Local Strategies , 2001, Electron. Notes Theor. Comput. Sci..

[5]  Dov M. Gabbay,et al.  Handbook of Philosophical Logic , 2002 .

[6]  Hélène Kirchner,et al.  Prototyping Completion with Constraints Using Computational Systems , 1995, RTA.

[7]  Wayne Snyder,et al.  Basic Paramodulation , 1995, Inf. Comput..

[8]  Hélène Kirchner,et al.  Rule Based Programming with Constraints and Strategies , 1999, New Trends in Constraints.

[9]  Claude Kirchner,et al.  Using Rewriting and Strategies for Describing the B Predicate Prover , 1998 .

[10]  Peter Borovanský.  Le contrôle de la réécriture : étude et implantation d'un formalisme de stratégies , 1998 .

[11]  S. Eker,et al.  Metalevel computation in Maude , 1998, WRLA.

[12]  Laurent Vigneron.  Déduction automatique avec contraintes symboliques dans les théories équationnelles. (Automated deduction with symbolic constraints in equational theories) , 1994 .

[13]  Q. Nguyen,et al.  ELAN for equational reasoning in Coq , 2000 .

[14]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[15]  Horatiu Cirstea.  Specifying Authentication Protocols Using Rewriting and Strategies , 2001, PADL.

[16]  Hélène Kirchner,et al.  Under Consideration for Publication in J. Functional Programming Promoting Rewriting to a Programming Language: a Compiler for Non-deterministic Rewrite Programs in Associative-commutative Theories , 2022 .

[17]  Hendrik Pieter Barendregt,et al.  Autarkic Computations in Formal Proofs , 2002, Journal of Automated Reasoning.

[18]  Jean-Louis Lassez,et al.  Computational logic: essays in honor of Alan Robinson , 1991 .

[19]  Christophe Ringeissen.  Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language , 1997, RTA.

[20]  Claude Kirchner,et al.  Combining Higher-Order and First-Order Computation Using Rho Calculus: Towards a Semantics of ELAN , 1998 .

[21]  Eric Domenjoud.  A technical note on AC-unification. The number of minimal unifiers of the equation a x 1 +c+ a x p = d AC b y 1 +c+ b y q , 1992 .

[22]  Claude Marché,et al.  Normalised rewriting and normalised completion , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[23]  Quang Huy Nguyen,et al.  Certifying Term Rewriting Proofs in ELAN , 2001, RULE@PLI.

[24]  Narciso Martí-Oliet,et al.  Rewriting Logic as a Logical and Semantic Framework , 1996 .

[25]  J. M. Hvllot.  Associative commutative pattern matching , 1979, IJCAI 1979.

[26]  Carlos Castro,et al.  Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies , 1998, Fundam. Informaticae.

[27]  Claude Kirchner,et al.  Theorem Proving Modulo , 2003, Journal of Automated Reasoning.

[28]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

[29]  Hélène Kirchner,et al.  Completion of a Set of Rules Modulo a Set of Equations , 1986, SIAM J. Comput..

[30]  Claude Kirchner,et al.  Matching Power , 2001, RTA.

[31]  José Meseguer,et al.  Axiomatizing Reflective Logics and Languages , 1996 .

[32]  Michaël Rusinowitch,et al.  Automated deduction with associative commutative operators , 1991, FAIR.

[33]  Paliath Narendran,et al.  Complexity of Matching Problems , 1987, J. Symb. Comput..

[34]  Patrick Viry.  Input/Output for ELAN , 1996, WRLA.

[35]  Hélène Kirchner,et al.  ELAN: A logical framework based on computational systems , 1996, WRLA.

[36]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[37]  Peter Borovanský,et al.  Implementation of Higher-Order Unification Based on Calculus of Explicit Substitution , 1995, SOFSEM.

[38]  Thomas Genet.  Contraintes d'ordre et automates d'arbres pour les preuves de terminaison. (Ordering constraints and tree automata for proving termination) , 1998 .

[39]  54506 Vandoeuvre.  Implementation of Higher-order Uniication Based on Calculus of Explicit Substitution , 1995 .

[40]  T. Arts.  Automatically proving termination and innermost normalisation of term rewriting systems , 2001 .

[41]  Claude Kirchner,et al.  Rule-Based Constraint Programming , 1998, Fundam. Informaticae.

[42]  Claude Kirchner,et al.  Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[43]  Carlos Castro,et al.  Solving binary CSP using computational systems , 1996, WRLA.

[44]  Eric Domenjoud,et al.  A technical note on AC-Unification. The number of minimal unifiers of the equation αx1 + ⋯ + αxp ≐AC βy1 + ⋯ + βyq , 1992, Journal of Automated Reasoning.

[45]  Hélène Kirchner,et al.  A Compiler for Rewrite Programs in Associative-Commutative Theories , 1998, PLILP/ALP.

[46]  MeseguerJosé.  Conditional rewriting logic as a unified model of concurrency , 1992 .

[47]  Mark E. Stickel,et al.  Complete Sets of Reductions for Some Equational Theories , 1981, JACM.

[48]  Pascal Van Hentenryck,et al.  Principles and practice of constraint programming: The Newport papers , 1996, Computers & Mathematics with Applications.

[49]  Emmanuel Kounalis,et al.  Compilation of Pattern Matching with Associative-Commutative Functions , 1991, TAPSOFT, Vol.1.

[50]  I. V. Ramakrishnan,et al.  Associative-Commutative Discrimination Nets , 1993, TAPSOFT.

[51]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..

[52]  Paul Klint,et al.  A meta-environment for generating programming environments , 1989, TSEM.

[53]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[54]  Claude Kirchner,et al.  The Rho Cube , 2001, FoSSaCS.

[55]  Denis Lugiez,et al.  Tree Automata Help One To Solve Equational Formulae In AC-Theories , 1994, J. Symb. Comput..

[56]  Horatiu Cirstea,et al.  Calcul de réécriture : fondements et applications , 2000 .

[57]  Robert Nieuwenhuis,et al.  Saturation of First-Order (Constrained) Clauses with the Saturate System , 1993, RTA.

[58]  Bernhard Gramlich.  On Proving Termination by Innermost Termination , 1996, RTA.

[59]  Hélène Kirchner,et al.  Induction for termination with local strategies , 2001 .

[60]  Jean-Raymond Abrial,et al.  The B-book - assigning programs to meanings , 1996 .

[61]  S. M. Eker,et al.  Associative-Commutative Matching Via Bipartite Graph Matching , 1995, Comput. J..

[62]  Hélène Kirchner,et al.  Objects, rules and strategies in ELAN , 1999 .

[63]  Marian Vittek.  Elan : un cadre logique pour le prototypage de langages de programmation avec contraintes , 1994 .

[64]  Carlos Castro.  COLETTE, Prototyping CSP Solvers Using a Rule-Based Language , 1998, AISC.

[65]  Johan Jeuring,et al.  Merging Monads and Folds for Functional Programming , 1995, Advanced Functional Programming.

[66]  Robin Milner,et al.  Edinburgh lcf: a mechanized logic of computation , 1978 .

[67]  Claude Kirchner,et al.  The simply typed rewriting calculus , 2000, WRLA.

[68]  Michael J. C. Gordon,et al.  Edinburgh LCF: A mechanised logic of computation , 1979 .

[69]  Peter Borovanský,et al.  Cooperation of constraint solvers: using the new process control facilities of ELAN , 1998, WRLA.

[70]  Claude Kirchner,et al.  Rewriting with Strategies in ELAN: A Functional Semantics , 2001, Int. J. Found. Comput. Sci..

[71]  Hélène Kirchner,et al.  Some Extensions of Rewriting , 1993, Term Rewriting.