> Seems like a very nice tool. Although I wonder why one needs Buddha for the
> sample Tree code treated in the User's Guide. Would it not be easier to
> just look for the string "the bug is here" and correct the problem?
I don't think I'd find this technique very useful since I often forget to
On Fri, Oct 17, 2003 at 01:38:06PM +0100, Alastair Reid wrote:
> The simplest would be to generate some C code at runtime, pass it to gcc and
> dynamically load the resulting .o file.
yeah, I considered this but want to implement an interpreter where the
user has the ability to call arbitrary C f
I have not seen any Haskell metacatamorpishm library, for banana split
constructions.
Would it not be a good start for a Template Haskell-specific library? In
fact, is there a plan to create a Template Library for Template Haskell,
somewhat homologous to the STL in C++?
/David
__
Bernie "Buddha" wrote:
> Announcing buddha version 1.0
> -
>
>www.cs.mu.oz.au/~bjpop/buddha
>
> A declarative debugger for Haskell 98. It is based on program
> transformation and works with GHC 5 and 6.
>
> buddha offers a declarative debugging algorithm and a
(We apologize for the reception of multiple copies)
LAST CALL FOR PARTICIPATION **
Second International Symposium on
Formal Methods for Components and Objects
(FMCO 2003)
DATES 4 - 7 November
The simplest would be to generate some C code at runtime, pass it to gcc and
dynamically load the resulting .o file.
Since the Storable class is for marshalling Haskell values into and out of
contiguous memory, the C code you need would read values out of contiguous
memory, pass them as argume
I need to call some dynamically linked routines recieved via
Posix.DynamicLinker but am unsure how to do this from haskell. I do not
know the types of the functions I wish to call at compile time so can't
create appropriate foreign import statements. What would be nice is
something like
callFunPtr
Announcing buddha version 1.0
-
www.cs.mu.oz.au/~bjpop/buddha
A declarative debugger for Haskell 98. It is based on program
transformation and works with GHC 5 and 6.
buddha offers a declarative debugging algorithm and a browsing mechanism.
It is useful for finding
