/Education/Courses/svh/Slides/may-15-Obsidian-short.pdf
Regards,
Frederik
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Furthermore, can we move this thread from the Haskell mailing list
(which should not have heavy traffic) to either Haskell-Café, or
the libraries list?
Sure, moving to haskell-cafe.
Frederik
--
http://ofb.net/~frederik/
___
Haskell-Cafe mailing
the type system at compile
time.
http://ofb.net/~frederik/stla/
It is almost twice as fast as Octave on an example program, and
probably comparable to Matlab. However, it is currently very difficult
to debug some of the type errors which are emitted by GHC when using
it, and there are some outstanding
Hi Alberto,
Those are good questions, I've added some examples which hopefully
clarify the situation. Input and output of vectors is not a strong
point of the library, but I don't think there is a good alternative to
the way I do it.
http://ofb.net/~frederik/futility/src/Vector/read-example.hs
Yes, certainly... Otherwise the library would not be much use! If it
seems counterintuitive, as it did to me at first, you should check out
the Implicit Configurations paper, which uses modular arithmetic as
an example. My version of their code is in
http://ofb.net/~frederik/futility/src
this, or do I have to avoid polymorphism? I
can use 'toConstr' to find out dynamically if a particular type is a
pair, and then use unsafeCoerce, but I hear that unsafeCoerce is
unsafe.
Frederik
On Mon, Apr 03, 2006 at 05:41:55PM -0700, Ralf Lammel wrote:
Hi Ralf,
I'm looking
Hi Ralf,
I'm looking for a function like extT but with more general type:
(t a - s a) - (t b - s b) - (t a - s a)
Is there such a thing in the generics library?
Thanks,
Frederik
--
http://ofb.net/~frederik/
___
Haskell-Cafe mailing list
Haskell
?
Thanks,
Frederik
--
http://ofb.net/~frederik/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
something
to work quickly on Int, doesn't mean that I don't want it to work at
all on String. It seems that there could be a default IArray UArray
e instance which just implements a regular Array behind the scenes.
Frederik
On Fri, Mar 10, 2006 at 11:49:10PM +0100, Benjamin Franksen wrote:
On Friday 10
in advance,
Frederik
--
http://ofb.net/~frederik/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
that. I'm sorry if
I didn't read carefully. Does my approach not work? I haven't filled
in the implementation yet, but it type-checks.
Frederik
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Mon, Sep 19, 2005 at 02:22:10PM +0100, Glynn Clements wrote:
Frederik Eaton wrote:
In addition to the stack trace problems, I found: (1) a problem where
output freezes when it is being piped through 'tee' and the user
presses ^S and then ^Q
That's the terminal driver; use stty
?
Will this change soon?
Aside from that, your 'idify' in PseudoFmap2 certainly seems to have
the correct type for this application. However, the absence of
automatic derivation is somewhat of an impediment.
Thanks for your help.
Frederik
On Tue, Aug 30, 2005 at 02:25:08PM -0700, Ralf Lammel wrote:
Frederik
is
not being printed correctly by ghc (but is being printed correctly by
runghc).
However, I don't have time to reduce these to minimal test cases. Do
you want to look at them anyway?
Frederik
--
http://ofb.net/~frederik/
___
Haskell-Cafe mailing list
On Wed, Sep 14, 2005 at 02:44:11PM +0100, Simon Marlow wrote:
On 10 September 2005 21:15, Frederik Eaton wrote:
On Fri, Sep 02, 2005 at 04:40:05PM +0400, Bulat Ziganshin wrote:
Hello Nils,
Friday, September 02, 2005, 10:47:05 AM, you wrote:
Compile your program with -prof
to everybody for
the advice.
Frederik
--
http://ofb.net/~frederik/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
difficult problem that a lot
of the debuggers seem to be aimed at solving. So maybe it would be
good if GHC had basic stack trace support built in? It could be a
compiler option, which would produce slower but more debuggable
code...
Frederik
--
http://ofb.net/~frederik
more.)
What I am trying to do is an extension of a paper by Koen Claessen and
Peter Ljunglof:
http://citeseer.ist.psu.edu/claessen00typed.html
Here is the code I have written:
http://ofb.net/~frederik/GenLogVar.hs
For the part which I asked for help with, to get around my trouble
with generics, I
in helping out
with the implementation.
Frederik
--
http://ofb.net/~frederik/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
with the final install
location and final package database as arguments. But I can't figure
out how to specify the local package.conf to 'configure' or 'install',
there are just the '--user' and '--global' commands which aren't quite
enough.
Frederik
in the global location (why would one want such
behavior?). Specifying '--with-hc-pkg=ghc-pkg --user' doesn't seem
to work either, when I do this then 'install' and 'unregister'
complete without error but apparently have no effect.
Thanks in advance,
Frederik
:
http://www.haskell.org/ghc/docs/latest/html/Cabal/
Thanks,
Frederik
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I forgot to say, when I run configure like
runghc Setup.hs configure --with-hc-pkg=ghc-pkg --user --prefix=$HOME
and then run 'install', it exits with code 127 but displays no error
message. Maybe something to look into...
Frederik
On Sun, Jul 10, 2005 at 05:00:13PM -0700, Frederik Eaton wrote
question is why
isn't it permitted.
Frederik
--
http://ofb.net/~frederik/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
)
(Show a, Show b, Show c) = Show (a, b, c)
(Show a, Show b, Show c, Show d) = Show (a, b, c, d)
(Show a, Show b, Show c, Show d, Show e) = Show (a, b, c, d, e)
Frederik
--
http://ofb.net/~frederik/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
That's a neat technique. Since it's so general it would be nice if
there were a way to make it more automatic, could one use template
haskell? It seems one should be able to write
HListConstraint $(mkConstraint Show) l
to generate the declarations automatically.
Frederik
On Sun, Mar 20, 2005
the added benefit of being able to access
the internals of a tuple (e.g. make instances which concatenate
generic tuples, project elements, etc.)...?
Frederik
--
http://ofb.net/~frederik/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
-of-date condition which breaks the
dependency analysis.
Anyway, my interpreter script is here, but at least in part because I
wasn't able to get around the above problems, it isn't very good:
http://a5.repetae.net/~frederik/hs-interp
e.g.
$ cat test
#!/usr/bin/env hs-interp
main = do putStrLn
28 matches
Mail list logo
