Re: View on true ad-hoc overloading.

types. What is it that existential types allow me to do? I thought they allow me to define different arbitrary function bodies for the same type signature and dynamically invoke those functions from a single call site. Is this not ad hoc polymorphism? -- Patrick Logan mailto:[EMA

RE: View on true ad-hoc overloading.

s of an object. But I am no Haskell expert. Is there a way to do this kind of dynamic programming-in-the-large today in Haskell that is not as error prone as building tuples of functions? -- Patrick Logan mailto:[EMAIL PROTECTED] Voice 503-533-3365Fax 503-629-8556 Gemstone Systems, Inc http://www.gemstone.com

Re: Haskell as a relational database language

emented in Erlang where the "query language" is based on list (table) comprehensions. That may serve as an example for what a Haskell database may be like. -- Patrick Logan mailto:[EMAIL PROTECTED] Voice 503-533-3365Fax 503-629-8556 Gemstone Systems, Inc http://www.gemstone.com

Haskell and Java (Was: Re: Current state of GUI...)

w, all the other languages can take advantage of it to create more complex GUIs. -- Patrick Logan mailto:[EMAIL PROTECTED] Voice 503-533-3365Fax 503-629-8556 Gemstone Systems, Inc http://www.gemstone.com

Re: GHC/Hugs Status (was Re: simple interface to web?)

;... http://research.microsoft.com/research/cambridge/luca/Papers/ServiceCombinators.ps -- Patrick Logan mailto:[EMAIL PROTECTED] Voice 503-533-3365Fax 503-629-8556 Gemstone Systems, Inc http://www.gemstone.com

Re: GHC/Hugs Status (was Re: simple interface to web?)

em in different combinations. -- Patrick Logan mailto:[EMAIL PROTECTED] Voice 503-533-3365Fax 503-629-8556 Gemstone Systems, Inc http://www.gemstone.com

Exceptions and return

east in this context. The Scheme community wrote about these issues 15-20 years ago or so... Guy Steele's "Lambda the Ultimate...", etc. and some papers from Friedman, Wand, et al. at Indiana. -- Patrick Logan mailto:[EMAIL PROTECTED] Voice 503-533-3365

Gofer vs. Haskell 1.4 vs.Standard Haskell vs. implementations

al.'s "monad transformers" from their 1995 paper directly in Hugs or HBC or ???. Thanks -- Patrick Logan mailto:[EMAIL PROTECTED] Voice 503-533-3365Fax 503-629-8556 Gemstone Systems, Inc http://www.gemstone.com

Referential transparency of I/O

indicates to the >>= function to bind some input to s1, and then getLine indicates to the >>= function to bind some more input to s2". But do x and y, above, have different values? How can that be rationalized as referentially transparent? Thanks from a beginner. -- Patrick Loga

Another question about monads and linearity

ion of, say, Haskell 1.3. If I attempt to do something in Haskell, and I fail, I am not sure whether it is the compiler telling me my goal is impossible or if it is telling me I haven't stated my goal correctly. Thanks from a beginner. -- Patrick Logan mailto:[EMAIL PROT

Monads and Linear Logic

r to "garbage collect" them at compile time because the compiler knows exactly how they are used. I assume the same can be done for monads? Is this done in the good Haskell compilers? In general laymen's terms, what are the performance and expressiveness issues in comparing monads with l

misfit hardware (was Re: Stumped without mutation...)

sting suggestion from Henry Baker was to support generating all kinds of constants on the CPU in the instruction stream. This would eliminate the need to go off the CPU to fetch a constant in RAM (or disk! or in the Age of Java and the Web, a remote server!) -- Patrick Logan mailto:[EM

Re: Stumped without mutation...

ot;The Architect's Trap". The issue is how does a hardware architect break out of the trap of designing for currently popular languages and styles in order to better support potentially more productive languages and styles? -- Patrick Logan mailto:[EMAIL PROTECTED] Voice