- -

Strong and weak operational termination of order-sorted rewrite theories

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Strong and weak operational termination of order-sorted rewrite theories

Show full item record

Lucas Alba, S.; Meseguer, J. (2014). Strong and weak operational termination of order-sorted rewrite theories. En Rewriting Logic and Its Applications. Springer Verlag (Germany). 178-194. doi:10.1007/978-3-319-12904-4_10

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/50899

Files in this item

Item Metadata

Title: Strong and weak operational termination of order-sorted rewrite theories
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
Issued date:
Abstract:
This paper presents several new results on conditional term rewriting within the general framework of order-sorted rewrite theories (OSRTs) which contains the more restricted framework of conditional term rewriting systems ...[+]
Subjects: Conditional term rewriting , Strong and weak operational termination , Irreducible terms , Normalized terms , Rewriting logic , Maude
Copyrigths: Reserva de todos los derechos
Source:
Rewriting Logic and Its Applications. (issn: 0302-9743 )
DOI: 10.1007/978-3-319-12904-4_10
Publisher:
Springer Verlag (Germany)
Publisher version: http://link.springer.com/chapter/10.1007/978-3-319-12904-4_10
Series: Lecture Notes in Computer Science;8663
Description: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-12904-4 10
Type: Capítulo de libro

This item appears in the following Collection(s)

Show full item record