On 3/6/06, Lennart Augustsson <[EMAIL PROTECTED]> wrote: > Can it be implemented efficiently?
Section 8, p. 8: "This leads to a simple compilation scheme that gives constant access to labels, but avoids the many runtime parameters for extension. The extension operation is done dynamically but since it is O(n) anyway, we expect that the runtime penalty is negligible." Jim _______________________________________________ Haskell-prime mailing list Haskell-prime@haskell.org http://haskell.org/mailman/listinfo/haskell-prime
