Q3869322 (Q3869322): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Abstract computational complexity and cycling computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4096921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Independent Theory of the Complexity of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3869322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5565113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5686017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive functions of symbolic expressions and their computation by machine, Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4141104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4171548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical logic without variables. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Types in combinatory logic / rank
 
Normal rank

Latest revision as of 03:44, 13 June 2024

scientific article
Language Label Description Also known as
English
No label defined
scientific article

    Statements

    0 references
    1978
    0 references
    weak combinatory logic
    0 references
    reduction complexity
    0 references
    rewriting process
    0 references
    reduction of applicative combinations of proper combinators
    0 references
    upper and lower bounds on the length of the reduction
    0 references
    normal form
    0 references

    Identifiers