The explanation given below might be a bit heavy for someone who didn't know
much
about category theory. For those individuals I'd recommend Phil Wadler's
papers:
http://homepages.inf.ed.ac.uk/wadler/topics/monads.html
I especially recommend "Monads for Functional Programming", "The Essence of
On Thu, 2005-08-18 at 15:17 +0200, Ketil Malde wrote:
> Hi,
>
> One slight annoyance using Haskell is the inability to load modules
> with type problems in the interactive environment (i.e. GHCi). When I
> have a type error, it would be nice to have an interactive way to
> explore what the compil
On 14/08/05, Carl Marks <[EMAIL PROTECTED]> wrote:
> Is there any text/article which makes precise/rigorous/explicit the connection
> between the category theoretic definition of monad with the haskell
> implementation?
Well, a monad over a category C is an endofunctor T on C, together
with a pair
Is there any text/article which makes precise/rigorous/explicit the connection
between the category theoretic definition of monad with the haskell
implementation?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
2005/8/18, John Goerzen <[EMAIL PROTECTED]>:
> I would suspect that you could find Oracle drivers for either unixODBC,
> or some custom ODBC system that is nearly API-compatible. Once you have
> that, you have HSQL.
I am planing to add support for Oracle in HSQL since now I am using it
at office,
On 2005-08-18, Brian Strand <[EMAIL PROTECTED]> wrote:
> I'm thinking about (re)writing some perl code in Haskell (for performance and
> correctness reasons). Has anyone done much with Oracle and Haskell? So far
Not Oracle specifically, but other databases, both free and proprietary.
> Before
I look at the source code and think about it... Generally I code in vi,
then run ghci, or compile and run. I find from experience the type
errors are normally easy to fix, you just look at the error, and study
the structure of the function. If I still have problems I edit the code
to return or
Hi Jake,
> program. How do most of the folks here debug their large code base?
You might have some success with Hat, http://www.haskell.org/hat/, for
debugging.
Unfortunately unless you are doing Monadic computations, breakpoints
don't really work as well as in strict imperative programs.
Thank
One slight annoyance using Haskell is the inability to load modules
with type problems in the interactive environment (i.e. GHCi). When I
have a type error, it would be nice to have an interactive way to
explore what the compiler thinks about the types involved -- as it is,
I have to resort to ad
Hi,
One slight annoyance using Haskell is the inability to load modules
with type problems in the interactive environment (i.e. GHCi). When I
have a type error, it would be nice to have an interactive way to
explore what the compiler thinks about the types involved -- as it is,
I have to resort
Christian Maeder wrote:
Keean Schupke wrote:
implementation of unify? For example can the algorithm be simplified
from my nieve attempt? Most importantly is it correct?
It will not be correct without occurs check. You may also get different
terms for the same variable in your substitu
Keean Schupke wrote:
> implementation of unify? For example can the algorithm be simplified
> from my nieve attempt? Most importantly is it correct?
It will not be correct without occurs check. You may also get different
terms for the same variable in your substitution list.
The simplest form of
Okay, I have found the missing definition (code was split by page
break), and found the type error:
type Subst = [(Var,Term)]
should be:
type Subst = [(Vname,Term)]
And have written a simple implementation of unify from a description of
the algorithm. I was wondering if anyone has any
> From: Brian Strand [mailto:[EMAIL PROTECTED]
>
> I've gotten takusen
> (http://cvs.sf.net/viewcvs.py/haskell-libs/libs/takusen/)
> to compile and run on my Suse 9.3 x86-64 box against Oracle
> 10.1.
Cool. I'm keen for feedback. I can also give general advice as far as
interfacing to Oracle i
14 matches
Mail list logo
