RE: [Haskell-cafe] Exceptions

2004-10-04 Thread Simon Peyton-Jones
Actually GHC does exactly that when you compile with -prof -auto-all. Then if you run with +RTS -xc, you get a backtrace of sorts. (I have not tested this recently!) The backtrace is not yet reified into a data structure that can be examined, but that'd be quite doable if someone wanted to try.

[Haskell-cafe] Predicate logic (FOL) reasoning in Haskell

2004-10-04 Thread Graham Klyne
I was recently passed this reference, which I thought was worthy of sharing here... I've not yet read it myself in detail, but at a glance it looks very readable. http://staff.science.uva.nl/~bcate/core/rwt.pdf [[ Reasoning with Tableaux Jan van Eijck CWI and ILLC, Amsterdam, Uil-OTS, Utrecht

Re: [Haskell-cafe] Optmiization of recursion

2004-10-04 Thread Fergus Henderson
On 28-Sep-2004, John Goerzen [EMAIL PROTECTED] wrote: As I'm investigating Haskell, it's occured to me that most of the Haskell tutorials out there have omitted something that was quite prominent in the OCaml material I had read: making functions properly tail-recursive. The OCaml compiler

Re: [Haskell-cafe] Rethinking OO idioms

2004-10-04 Thread Mikael Brockman
John Goerzen [EMAIL PROTECTED] writes: I've worked with languages with object-oriented features for awhile now. Python and OCaml, the two with which I work the most, both have OO. One of my first projects in Haskell would be to write a Haskell version of Python's ConfigParser[1] class. I

Re: [Haskell-cafe] Rethinking OO idioms

2004-10-04 Thread Mike Burns
--- John Goerzen mumbled on 2004-09-29 20.29.47 + --- The next thing that occured to me is that, unlike OCaml and Python classes, Haskell has no mutable variables. A call like config.setOption(main, initpath, /usr) in Python -- which alters the state of the config object and returns

Re: [Haskell-cafe] Optmiization of recursion

2004-10-04 Thread Jon Cast
Fergus Henderson [EMAIL PROTECTED] held forth: On 28-Sep-2004, John Goerzen [EMAIL PROTECTED] wrote: As I'm investigating Haskell, it's occured to me that most of the Haskell tutorials out there have omitted something that was quite prominent in the OCaml material I had read: making

[Haskell-cafe] How do I get a long iteration to run in constant space

2004-10-04 Thread W M
Hi, I'm starting to learn haskell, and I was considering it for a simulation I've been designing, but I ran into this problem with a simple numerical calculation. The attached program is supposed to solve a stiff differential equation, and you have to use a very small stepsize and lots of steps

Re: [Haskell-cafe] How do I get a long iteration to run in constant space

2004-10-04 Thread Malcolm Wallace
W M [EMAIL PROTECTED] writes: I suppose in my ODE example it's building up expressions somewhere for lazy evaluation, Exactly right. The trick is spotting which expressions. Until you have some experience of likely causes, rather than guessing I can recommend

Re: [Haskell-cafe] Including registered packages for GHC using Eclipse

2004-10-04 Thread Leif Frenzel
Hi Geoff, you have hit a weak point there ;-) You cannot yet specify packages in the Eclipse plugin. It will be possible in the next release, though, which will allow to specify additional options that are passed to the compiler. I hope to get that version (0.5) out at the end of October.

Re: [Haskell-cafe] Exceptions

2004-10-04 Thread John Meacham
On Mon, Oct 04, 2004 at 09:30:22AM +0100, Simon Peyton-Jones wrote: Actually GHC does exactly that when you compile with -prof -auto-all. Then if you run with +RTS -xc, you get a backtrace of sorts. (I have not tested this recently!) The backtrace is not yet reified into a data structure