Next:
Introduction
Up:
Distributed Recursive Datatypes
Previous:
Call graph of a
Naming the Nodes
Introduction
An example
The Problem
Normalised Paths
The Algorithm
Correctness Proof
c
<
min
(
k
,
q
)
p
<
k
+1
q
=
k
Timothy Lewis
11/12/1997
