Re: Dynamic scopes in Haskell

[Ch. A. Herrmann]

I had just a fast look at the following I found at the 
page "http://www.cse.ogi.edu/PacSoft/projects/Hugs/hugsman/exts.html"
for dynamic scoping:

   min :: [a] -> a
   min  = least with ?cmp = (<=)

Actually, I'm not sure how referential transparency can be established
with these implicit parameters. Assume min to be called at two places
with a different value for cmp, but with the same input list. Or is it
the case that the type a is bound to a particular cmp all over the program?

Please note, that referential transparency is one main advantage Haskell
has in contrast to other languages .....

-- 
 Christoph Herrmann
 E-mail:  [EMAIL PROTECTED]
 WWW:     http://brahms.fmi.uni-passau.de/cl/staff/herrmann.html