Light types for polynomial time computation in lambda calculus (Q1004289): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.ic.2008.08.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989132974 / 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: Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic / 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: Stratified coherence spaces: A denotational semantics for light linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type inference for light affine logic via constraints on words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708316 / 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: A new recursion-theoretic characterization of the polytime functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an intuitionistic modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typed Lambda Calculi and Applications / 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: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical linear logic of implications / 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: Static prediction of heap space usage for first-order functional programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soft linear logic and polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic and polynomial time / 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: Q4222777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778836 / 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: Light affine lambda calculus and polynomial time strong normalization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:24, 29 June 2024

scientific article
Language Label Description Also known as
English
Light types for polynomial time computation in lambda calculus
scientific article

    Statements

    Light types for polynomial time computation in lambda calculus (English)
    0 references
    0 references
    0 references
    2 March 2009
    0 references
    linear logic
    0 references
    light linear logic
    0 references
    lambda calculus
    0 references
    type system
    0 references
    implicit computational complexity
    0 references
    polynomial time complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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