A semantic proof of polytime soundness of light affine logic (Q987375): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-009-9210-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967535898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4457446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / 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: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase semantics and decidability of elementary 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: Q3791120 / 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: Realizability models for BLL-like languages / 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: Q2753690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385524 / rank
 
Normal rank

Revision as of 01:40, 3 July 2024

scientific article
Language Label Description Also known as
English
A semantic proof of polytime soundness of light affine logic
scientific article

    Statements

    A semantic proof of polytime soundness of light affine logic (English)
    0 references
    0 references
    0 references
    13 August 2010
    0 references
    implicit computational complexity
    0 references
    linear logic
    0 references
    realizability
    0 references

    Identifiers