cl-banner

Type Introduction for Runtime Complexity Analysis

Martin Avanzini and Bertram Felgenhauer

Proceedings of the 14th International Workshop on Termination (WST 2014), pp. 1 – 5, 2014.

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.

 

  PDF

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
}
Nach oben scrollen