NJC
2000
13 years 4 months ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
NJC
2000
13 years 4 months ago
2000
NJC
2000
13 years 4 months ago
2000
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...