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

Celý popis

Podrobná bibliografie

Vydáno v:	Information and computation Ročník 248; s. 56 - 81
Hlavní autoři:	Baillot, Patrick, Dal Lago, Ugo
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Inc 01.06.2016 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!