Encoding linear logic with interaction combinators (Q1854547): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The bologna optimal higher-order machine / 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: Q4945227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interaction combinators / rank
 
Normal rank
Property / cites work
 
Property / cites work: YALE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interaction nets for linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank

Latest revision as of 11:15, 5 June 2024

scientific article
Language Label Description Also known as
English
Encoding linear logic with interaction combinators
scientific article

    Statements

    Encoding linear logic with interaction combinators (English)
    0 references
    0 references
    0 references
    14 January 2003
    0 references
    0 references
    0 references