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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2014.10.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018805361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Optimal) duplication is not elementary recursive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic Light Affine Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new recursion-theoretic characterization of the polytime functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PolyTime Functional Language from Light Linear Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-interpretations. A way to control resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light types for polynomial time computation in lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light Logics and the Call-by-Value Lambda Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic and elementary time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On light logics, uniform encodings and polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical account of pspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Soft Type Assignment System for λ-Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate amortized resource analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear types and non-size-increasing polynomial time computation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive power of higher-order types or, life without CONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soft linear logic and polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A foundational delineation of poly-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic and polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light affine lambda calculus and polynomial time strong normalization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

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

    Identifiers