Implicit computation complexity in higher-order programming languages

Autor:	Ugo Dal Lago
Rok vydání:	2022
Předmět:	Mathematics (miscellaneous) Computer Science Applications
Zdroj:	Mathematical Structures in Computer Science. 32:760-776
ISSN:	1469-8072 0960-1295
DOI:	10.1017/s0960129521000505
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::eb10f1691fb3890c01b417a02f82b387 https://doi.org/10.1017/s0960129521000505 Zobrazit plný text záznamu