Termination and normalisation under strategy Proofs in ELAN

[1]  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 .

[2]  Thomas Genet,et al.  Rewriting for Cryptographic Protocol Verification , 2000, CADE.

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

[4]  José Meseguer,et al.  Reflection and strategies in rewriting logic , 1996, WRLA.

[5]  Hans Zantema,et al.  Termination of Term Rewriting by Semantic Labelling , 1995, Fundam. Informaticae.

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

[7]  Claude Kirchner,et al.  An overview of ELAN , 1998, WRLA.

[8]  Aart Middeldorp,et al.  Term Rewriting , 1999, CSL.

[9]  Hajime Sawamura,et al.  Recursive Unsolvability of Determinacy, Solvable Cases of Determinancy and their Applications to Prolog Optimization , 1985, SLP.

[10]  Jürgen Giesl,et al.  Proving Innermost Normalisation Automatically , 1997, RTA.

[11]  H. Kirchner,et al.  Induction for termination , 1999 .

[12]  M. Clavel,et al.  Principles of Maude , 1996, WRLA.

[13]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[14]  Hubert Comon,et al.  How to characterize the language of ground normal forms , 1986 .

[15]  Ataru T. Nakagawa,et al.  An overview of CAFE specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks , 1997, First IEEE International Conference on Formal Engineering Methods.

[16]  Bernhard Gramlich,et al.  On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems , 1996, Theor. Comput. Sci..

[17]  M.R.K. Kr ishna Rao,et al.  Modular Proofs for Completeness of Hierarchical Term Rewriting Systems , 1995, Theor. Comput. Sci..

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

[19]  Thomas Genet,et al.  Decidable Approximations of Sets of Descendants and Sets of Normal Forms , 1998, RTA.

[20]  Eelco Visser,et al.  A core language for rewriting , 1998, WRLA.

[21]  Pierre Lescanne,et al.  Termination of Rewriting Systems by Polynomial Interpretations and Its Implementation , 1987, Sci. Comput. Program..

[22]  Masahito Kurihara,et al.  Modular Term Rewriting Systems and the Termination , 1990, Inf. Process. Lett..

[23]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[24]  Nachum Dershowitz,et al.  Natural Termination , 1995, Theor. Comput. Sci..

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

[26]  Enno Ohlebusch,et al.  Modular Properties of Composable Term Rewriting Systems , 1995, J. Symb. Comput..

[27]  Sophie Tison,et al.  The theory of ground rewrite systems is decidable , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[28]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

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

[30]  Enno Ohlebusch,et al.  TALP: A Tool for the Termination Analysis of Logic Programs , 2000, RTA.

[31]  Jürgen Giesl,et al.  Automatically Proving Termination Where Simplification Orderings Fail , 1997, TAPSOFT.

[32]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

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

[34]  Michaël Rusinowitch,et al.  On Termination of the Direct Sum of Term-Rewriting Systems , 1987, Inf. Process. Lett..

[35]  Florent Jacquemard,et al.  Decidable Approximations of Term Rewriting Systems , 1996, RTA.

[36]  Sophie Tison,et al.  Regular Tree Languages and Rewrite Systems , 1995, Fundam. Informaticae.

[37]  Sándor Vágvölgyi,et al.  Bottom-Up Tree Pushdown Automata and Rewrite Systems , 1991, RTA.

[38]  Zoltan Somogyi,et al.  The Execution Algorithm of Mercury, an Efficient Purely Declarative Logic Programming Language , 1996, J. Log. Program..

[39]  Azuma Ohuchi,et al.  Modular term rewriting systems with shared constructors , 1991 .

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

[41]  Kai Salomaa,et al.  Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems , 1988, J. Comput. Syst. Sci..

[42]  Isabelle Gnaedig,et al.  Termination Proofs Using gpo Ordering Constraints , 1997, TAPSOFT.

[43]  Yoshihito Toyama,et al.  On the Church-Rosser property for the direct sum of term rewriting systems , 1984, JACM.

[44]  Hélène Kirchner,et al.  Non-deterministic Computations in ELAN , 1998, WADT.

[45]  Jean H. Gallier,et al.  Reductions in Tree Replacement Systems , 1985, Theor. Comput. Sci..

[46]  Bernhard Gramlich,et al.  Modular aspects of rewrite-based specifications , 1997, WADT.

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

[48]  Jürgen Giesl,et al.  Termination of term rewriting using dependency pairs , 2000, Theor. Comput. Sci..