Skip Navigation

The Computer Journal 1991 34(1):16-19; doi:10.1093/comjnl/34.1.16
© 1991 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Dick, A. J. J.
Right arrow Articles by Watson, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Order-sorted Term Rewriting

A. J. J. Dick1 * and P. Watson2 §

1 Bull SA, 68 route de Versailles, 78430 Louveciennes, France, 2 University of Glasgow, UK

In this article we look at the motivation for order-sorted term rewriting by considering some of the very natural equational theories in which single-sorted (unsorted) and many-sorted rewriting lack sufficient expressiveness, for various reasons. However, order-sorted rewriting is not without problems of its own, and we consider some of these along with a brief description in each case of some current approaches to their solution.

Received August 1990.

* Information Dept, Systems Engineering Divisons, Rutherford Appleton Laboratory, Chilton, Didcot, Oxon OX14 4LZ.{ddagger}

§ RHNBC, University of London (now at University of Glasgow).

Now at: Bull SA, 68 route de Versailles, 78430 Louveciennes, France


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.