Realizability models and implicit complexity (Q534712): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Intuitionistic Light Affine Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher type recursion, ramification and polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional interpretations of feasibly constructive arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semantic proof of polytime soundness of light affine logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weak lambda calculus as a reasonable machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994895 / 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: Linear types and non-size-increasing polynomial time computation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability models for BLL-like languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A small complete category / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5344164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soft linear logic and polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385524 / rank
 
Normal rank

Revision as of 00:28, 4 July 2024

scientific article
Language Label Description Also known as
English
Realizability models and implicit complexity
scientific article

    Statements

    Realizability models and implicit complexity (English)
    0 references
    0 references
    0 references
    10 May 2011
    0 references
    implicit computational complexity
    0 references
    realizability
    0 references
    linear logic
    0 references
    polymorphism
    0 references
    modality
    0 references
    inductive datatypes
    0 references

    Identifiers