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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68N18 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6353840 / rank
 
Normal rank
Property / zbMATH Keywords
 
arithmetic computations with binary trees
Property / zbMATH Keywords: arithmetic computations with binary trees / rank
 
Normal rank
Property / zbMATH Keywords
 
Gödel system T types
Property / zbMATH Keywords: Gödel system T types / rank
 
Normal rank
Property / zbMATH Keywords
 
modeling computational abstractions with functional programming
Property / zbMATH Keywords: modeling computational abstractions with functional programming / rank
 
Normal rank
Property / zbMATH Keywords
 
computations with balanced parenthesis languages
Property / zbMATH Keywords: computations with balanced parenthesis languages / rank
 
Normal rank

Revision as of 12:55, 30 June 2023

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

    Identifiers