Binary trees as a computational framework

DOI10.1016/J.CL.2013.08.002zbMath1296.68028OpenAlexW2006002823MaRDI QIDQ461478

Paul Tarau, David Haraburda

Publication date: 10 October 2014

Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cl.2013.08.002

zbMATH Keywords

arithmetic computations with binary treescomputations with balanced parenthesis languagesGödel system T typesmodeling computational abstractions with functional programming

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Functional programming and lambda calculus (68N18)

Related Items (1)

Towards a generic view of primality through multiset decompositions of natural numbers

Uses Software

• Coq
• Haskell

Cites Work

• The calculus of constructions
• Universal coalgebra: A theory of systems
• Mathematics and Computer Science: Coping with Finiteness
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• Dichotomy of the Addition of Natural Numbers
• Pure, Declarative, and Constructive Arithmetic Relations (Declarative Pearl)
• Intensional interpretations of functionals of finite type I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Binary trees as a computational framework