Go backward to Example
Go up to Top
Go forward to Term

Example

For every set T, the set Tree(T) is defined by

empty in Tree(T),

forall e in T, l in Tree(T), r in List(T): node(e, l, r) in Tree(T).

with constructors empty and node.

Every element of Tree(T) is of the form

node(n₀, node(n₁₁, ...), node(n₂₁, ...)),

1
2 5
3 4

node(1, node(2, node(3, empty, empty), node(4, empty, empty)), node(5, empty, empty))

Author: Wolfgang Schreiner
Last Modification: November 24, 1999