Real or natural number interpretation and their effect on complexity

Interpretation methods have been introduced in the 70s by Lankford [1] in rewriting theory to prove termination. Actually, as shown by Bonfante et al. [2], an interpretation of a program induces a bound on its complexity. However, Lankford's original analysis depends deeply on the Archimedean p...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 585; pp. 25 - 40
Main Authors:	Bonfante, Guillaume, Deloup, Florian, Henrot, Antoine
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 20.06.2015
Subjects:	Algebra Algebraic geometry Complexity Implicit computational complexity Integers Number theory Polynomial interpretation Polynomials Real numbers Term rewriting Term rewriting Polynomial interpretation Algebraic geometry Implicit computational complexity
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!