On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123)

From MaRDI portal
Revision as of 09:47, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    4 May 2015
    0 references
    0 references
    implicit computational complexity
    0 references
    linear logic
    0 references
    lambda-calculus
    0 references
    polynomial time complexity
    0 references
    type systems
    0 references