Linear types and non-size-increasing polynomial time computation. (Q1401943): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A syntactical analysis of non-size-increasing polynomial time computation / 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: Light linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe recursion with higher types and BCK-algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strength of non-size increasing computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Region-based memory management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static prediction of heap space usage for first-order functional programs / rank
 
Normal rank

Revision as of 09:57, 6 June 2024

scientific article
Language Label Description Also known as
English
Linear types and non-size-increasing polynomial time computation.
scientific article

    Statements

    Linear types and non-size-increasing polynomial time computation. (English)
    0 references
    0 references
    19 August 2003
    0 references
    0 references
    Complexity theory
    0 references
    Type system
    0 references
    Linear types
    0 references
    Higher-order function
    0 references
    Resources
    0 references