Binary trees as a computational framework (Q461478): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
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 | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Coq / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Haskell / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.cl.2013.08.002 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2006002823 / rank | |||
Normal rank | |||
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 | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 04: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
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