15-399, 80-317/617
Constructive Logic
Lecture 15: Trees
As a further example of inductive data types, we consider the type of trees labelled by elements of an arbitrary type. Examples of recursively defined functions and operations on trees are given in detail.
[ Home
| Schedule
| Assignments
| Handouts
| Software
| Overview
]
|