The weak lambda calculus as a reasonable machine (Q930866): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5397484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processes, Terms and Cycles: Steps on the Road to Infinity / 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: Logical Approaches to Computational Barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5667469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3858241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational efficacy of finite-field arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality and inefficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: On global dynamics of optimal graph reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric parameter passing \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385524 / rank
 
Normal rank

Revision as of 11:29, 28 June 2024

scientific article
Language Label Description Also known as
English
The weak lambda calculus as a reasonable machine
scientific article

    Statements

    The weak lambda calculus as a reasonable machine (English)
    0 references
    0 references
    0 references
    24 June 2008
    0 references
    lambda calculus
    0 references
    computational complexity
    0 references
    invariance thesis
    0 references
    cost model
    0 references

    Identifiers