Abstract

We show that the runtime complexity function of a sorted rewrite system coincides with the runtime complexity function of the underlying unsorted rewrite system.

BibTeX

@inproceedings{MABF-WST14,
  author    = "Martin Avanzini and Bertram Felgenhauer",
  title     = "Type Introduction for Runtime Complexity Analysis"
  booktitle = "Proceedings of the 14th International Workshop on
               Termination",
  editor    = "Carsten Fuhs",
  pages     = "1--5",
  year      = 2014 
}