Implicit computation complexity in higher-order programming languages A Survey in Memory of Martin Hofmann

This paper is meant to be a survey about implicit characterizations of complexity classes by fragments of higher-order programming languages, with a special focus on type systems and subsystems of linear logic. Particular emphasis will be put on Martin Hofmann’s contributions to the subject, which v...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematical structures in computer science Ročník 32; číslo 6; s. 760 - 776
Hlavní autor: Dal Lago, U.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cambridge Cambridge University Press 01.06.2022
Témata:
Algebra
Algorithms
Calculus
Complexity
Complexity theory
Computer science
Programming languages
Subsystems
ISSN:0960-1295, 1469-8072
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!
Popis
Shrnutí:This paper is meant to be a survey about implicit characterizations of complexity classes by fragments of higher-order programming languages, with a special focus on type systems and subsystems of linear logic. Particular emphasis will be put on Martin Hofmann’s contributions to the subject, which very much helped in shaping the field.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0960-1295
1469-8072
DOI:10.1017/S0960129521000505