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

Full description

Saved in:
Bibliographic Details
Published in:Mathematical structures in computer science Vol. 32; no. 6; pp. 760 - 776
Main Author: Dal Lago, U.
Format: Journal Article
Language:English
Published: Cambridge Cambridge University Press 01.06.2022
Subjects:
Algebra
Algorithms
Calculus
Complexity
Complexity theory
Computer science
Programming languages
Subsystems
ISSN:0960-1295, 1469-8072
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0960-1295
1469-8072
DOI:10.1017/S0960129521000505