Skip to Main content Skip to Navigation
Conference papers

Termination and normalisation under strategies--Proofs in ELAN

Hélène Kirchner 1 Isabelle Gnaedig 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper, we review several methods for proving termination of rewrite programs or answer questions about normal forms. We concentrate on the methods that have been designed in ELAN and which are useful for studying termination and normal forms of ELAN programs. We address several problems: general termination of a rewrite program, innermost termination on sets of ground terms, computation or approximation of the set of normal forms, modular termination of the union of rewrite systems, estimation of the number of normal forms for a non-deterministic rewrite program with strategies. For each point we briefly present one method, explain its scope and give references to other methods concerning the same problem, before describing the implementation in ELAN. We conclude with some open questions.
Complete list of metadatas

https://hal.inria.fr/inria-00099059
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:49:13 AM
Last modification on : Thursday, January 11, 2018 - 6:19:58 AM
Document(s) archivé(s) le : Wednesday, March 29, 2017 - 12:49:13 PM

Identifiers

  • HAL Id : inria-00099059, version 1

Collections

Citation

Hélène Kirchner, Isabelle Gnaedig. Termination and normalisation under strategies--Proofs in ELAN. 3rd International Workshop on Rewriting Logic & Applications - WRLA'2000, 2000, Kanazawa, Japan, pp.93--115. ⟨inria-00099059⟩

Share

Metrics

Record views

150

Files downloads

78