Complexity analysis of term rewriting systems

Complexity (forthcoming)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,829

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Term Rewriting Systems.Jürgen Giesl - 2004 - Bulletin of Symbolic Logic 10 (2):223-225.
Termination and confluence in infinitary term rewriting.P. H. Rodenburg - 1998 - Journal of Symbolic Logic 63 (4):1286-1296.
Chapter 1: Term rewriting systems.J. W. Klop - 1992 - In S. Abramsky, D. Gabbay & T. Maibaurn (eds.), Handbook of Logic in Computer Science. Oxford University Press. pp. 1--116.
A lexicographic path order with slow growing derivation bounds.Naohi Eguchi - 2009 - Mathematical Logic Quarterly 55 (2):212-224.
Types of I -free hereditary right maximal terms.Katalin Bimbó - 2005 - Journal of Philosophical Logic 34 (5/6):607 - 620.

Analytics

Added to PP
2014-03-18

Downloads
43 (#369,055)

6 months
1 (#1,467,486)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references