Type inference for light affine logic via constraints on words (Q703485): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 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.tcs.2004.08.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2155879600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic Light Affine Logic / 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: Higher type recursion, ramification and polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4457451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic and elementary 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: 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: Soft linear logic and polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4457461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light affine lambda calculus and polynomial time strong normalization / 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

Revision as of 16:09, 7 June 2024

scientific article
Language Label Description Also known as
English
Type inference for light affine logic via constraints on words
scientific article

    Statements

    Type inference for light affine logic via constraints on words (English)
    0 references
    0 references
    11 January 2005
    0 references
    Implicit computational complexity
    0 references
    Linear logic
    0 references
    Light affine logic
    0 references
    Lambda-calculus
    0 references
    Type inference
    0 references
    Polynomial time complexity
    0 references
    Constraints
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references