Light affine lambda calculus and polynomial time strong normalization (Q877259): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4936120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stratified coherence spaces: A denotational semantics for light linear logic / 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: A new recursion-theoretic characterization of the polytime functions / 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: Linear logic and elementary time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded linear logic: A modular approach to polynomial-time computability / 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: Phase semantics for light linear logic / 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: Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an interpretation of safe recursion in light affine logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LIGHT AFFINE LOGIC AS A PROGRAMMING LANGUAGE: A FIRST CONTRIBUTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light affine set theory: A naive set theory of polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typability and type checking in System F are equivalent and undecidable / rank
 
Normal rank

Latest revision as of 17:50, 25 June 2024

scientific article
Language Label Description Also known as
English
Light affine lambda calculus and polynomial time strong normalization
scientific article

    Statements

    Light affine lambda calculus and polynomial time strong normalization (English)
    0 references
    0 references
    19 April 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Light logics
    0 references
    Lambda calculus
    0 references
    Polynomial time
    0 references
    0 references