LeafTree

Binary trees whose terminal leaves also carry values.
Table of Contents

Types

LeafTree

(inductive)
Binary trees whose terminal leaves also carry values.
inductive LeafTree a

Constructors

For each type in this module: inductive types list their declared constructors; opaque types list any local function whose name starts with mk and which returns a value of that type.

LeafTree (inductive)

leaf

constructor
(LeafTree a)

node

constructor
(LeafTree a)

Functions

map

def map (f : (x : a) → b) (tree : (LeafTree a)) : (LeafTree b)