On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123): Difference between revisions
From MaRDI portal
Latest revision as of 00:35, 10 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy |
scientific article |
Statements
On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (English)
0 references
4 May 2015
0 references
implicit computational complexity
0 references
linear logic
0 references
lambda-calculus
0 references
polynomial time complexity
0 references
type systems
0 references