Indexed metadata
Implicit computation complexity in higher-order programming languages
U. Dal Lago
Source record
Source: Crossref
Published: Mar 15, 2022
DOI: 10.1017/s0960129521000505
Open original source ↗Source abstract
Abstract 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.