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...

Full description

Bibliographic Details

Published in:	Information and computation Vol. 248; pp. 56 - 81
Main Authors:	Baillot, Patrick, Dal Lago, Ugo
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.06.2016 Elsevier
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!