Light logics and optimal reduction: completeness and complexity (Q627123): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2010.10.002 / rank
Normal rank
 
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.2010.10.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2158015668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light linear logic / 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: Optimizing optimal reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine 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: Typed Lambda Calculi and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753690 / 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: PELCR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality and inefficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel beta reduction is not elementary recursive / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Optimal) duplication is not elementary recursive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5397484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversible, irreversible and optimal \(\lambda\)-machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4415239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general theory of sharing graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coherence for sharing proof-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interaction combinators / 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: Typed Lambda Calculi and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of multiplicatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708316 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2010.10.002 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:46, 9 December 2024

scientific article
Language Label Description Also known as
English
Light logics and optimal reduction: completeness and complexity
scientific article

    Statements

    Light logics and optimal reduction: completeness and complexity (English)
    0 references
    0 references
    0 references
    0 references
    21 February 2011
    0 references
    lambda calculus
    0 references
    linear logic
    0 references
    optimal reduction
    0 references
    implicit computational complexity
    0 references
    proof-nets
    0 references
    light linear logic
    0 references

    Identifiers