Proving Operational Termination of Membership Equational Programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Higher-Order and Symbolic Computation Year : 2008

Proving Operational Termination of Membership Equational Programs


Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for advanced features such as evaluation strategies, rewriting modulo, use of extra variables in conditions, partiality, and expressive type systems (possibly including polymorphism and higher-order). However, many of those features are, at best, only partially supported by current term rewriting termination tools (for instance MU-TERM, CiME, APROVE, TTT, TERMPTATION, etc.) while they may be essential to ensure termination. We present a sequence of theory transformations that can be used to bridge the gap between expressive membership equational programs and such termination tools, and prove the correctness of such transformations. We also discuss a prototype tool performing the transformations on MAUDE equational programs and sending the resulting transformed theories to some of the aforementioned standard termination tools.
Fichier principal
Vignette du fichier
duran08hosc.pdf (225.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00431474 , version 1 (12-11-2009)


  • HAL Id : inria-00431474 , version 1


Francisco Durán, Salvador Lucas, Claude Marché, José Meseguer, Xavier Urbain. Proving Operational Termination of Membership Equational Programs. Higher-Order and Symbolic Computation, 2008, 21 (1-2), pp.59-88. ⟨inria-00431474⟩
243 View
261 Download


Gmail Facebook X LinkedIn More