C Okasaki [Oct 1995], "Amortization, lazy evaluation, and persistence: lists with catenation via lazy linking," in IEEE Symposium on Foundations of Computer Science, 646--654.  Home/Search   Document Details and Download   Summary   Related Articles

....would be required for a tree of booleans. We would like to be able to generalise leaves like this: 1 At least, it is easy if one is prepared to give up O(1) head and tail functions. It is possible, albeit somewhat more complex, to support append, head and tail all in constant (amortized) time (Okasaki [1995]) leavesSet : Tree a Set a leavesSet (Leaf a) singletonSet a leavesSet (Branch t1 t2) leaves t1 unionSet leaves t2 To make this work we would need to have these set operations: singletonSet : a Set a unionSet : Set a Set a Set a Bulk type polymorphism Suppose that we have ....

C Okasaki [Oct 1995], "Amortization, lazy evaluation, and persistence: lists with catenation via lazy linking," in IEEE Symposium on Foundations of Computer Science, 646--654.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC