Operational Termination of Membership Equational Programs: the Order-Sorted Way
Authors:
Open Access
- 17 June 2009
- journal article
- research article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 238 (3) , 207-225
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Proving operational termination of membership equational programsHigher-Order and Symbolic Computation, 2008
- Proving Termination of Context-Sensitive Rewriting with MU-TERMElectronic Notes in Theoretical Computer Science, 2007
- Semantic foundations for generalized rewrite theoriesTheoretical Computer Science, 2006
- Operational termination of conditional term rewriting systemsInformation Processing Letters, 2005
- Context-Sensitive Rewriting StrategiesInformation and Computation, 2002
- Specification and proof in membership equational logicTheoretical Computer Science, 2000
- Termination of term rewriting: interpretation and type eliminationJournal of Symbolic Computation, 1994
- Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operationsTheoretical Computer Science, 1992