Binary trees as a computational framework (Q461478): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The calculus of constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal coalgebra: A theory of systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intensional interpretations of functionals of finite type I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematics and Computer Science: Coping with Finiteness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy of the Addition of Natural Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3584061 / rank
 
Normal rank

Latest revision as of 03:13, 9 July 2024

scientific article
Language Label Description Also known as
English
Binary trees as a computational framework
scientific article

    Statements

    Binary trees as a computational framework (English)
    0 references
    0 references
    0 references
    10 October 2014
    0 references
    arithmetic computations with binary trees
    0 references
    Gödel system T types
    0 references
    modeling computational abstractions with functional programming
    0 references
    computations with balanced parenthesis languages
    0 references
    0 references
    0 references

    Identifiers