Higher-order interpretations and program complexity

Polynomial interpretations and their generalizations like quasi-interpretations have been used in the setting of first-order functional languages to design criteria ensuring statically some complexity bounds on programs [10]. This fits in the area of implicit computational complexity, which aims at...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information and computation Jg. 248; S. 56 - 81
Hauptverfasser:	Baillot, Patrick, Dal Lago, Ugo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.06.2016 Elsevier
Schlagworte:	Computer Science Implicit computational complexity Lambda-calculus Logic in Computer Science Term rewriting systems Type systems Type systems Term rewriting systems Implicit computational complexity Lambda-calculus lambda-calculus type systems implicit computational complexity term rewriting systems
ISSN:	0890-5401, 1090-2651
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!