crash building gtk2hs on win32 using ghc 6.5

2006-07-13 Thread Jason Dagit
[Sorry for the duplicate, I tried to submit this through the trac interface but the formatting was destroyed by trac so I'm emailing it in hopes that it preserves some formatting.] Trying to build gtk2hs-0.9.10 on win32 using ghc 6.5 (the ghc that ships with visual haskell). output of ghc -v5:

RE: STM check operation

2006-07-13 Thread Simon Peyton-Jones
'check' isn't in any public version of GHC just yet. We have the code, but have not yet gotten it into the main darcs repository. Sorry. Simon | -Original Message- | From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] | On Behalf Of S Koray Can | Sent: 13 July 2006 03:13 | To:

Re: STM check operation

2006-07-13 Thread Rodney D Price
Thanks for your reply. I'm a bit confused, however. There is a function check :: Bool - STM a in the STM library, but it appears to act differently than the one described in the paper. This version of check seems to cause a transaction to block when its (check's) first argument is False,

[Haskell] Re: ANN: TextRegexLazy 0.44

2006-07-13 Thread Bulat Ziganshin
Hello Chris, Thursday, July 13, 2006, 1:03:19 AM, you wrote: This was my first time packaging with cabal, and I am hoping it works for you. are you included Makefile? this makes building installation somewhat simpler for a user Question 2: Is there interest in getting this into an official

[Haskell] Re: ANN: TextRegexLazy 0.44

2006-07-13 Thread Chris Kuklewicz
Bulat Ziganshin wrote: Hello Chris, Thursday, July 13, 2006, 1:03:19 AM, you wrote: This was my first time packaging with cabal, and I am hoping it works for you. are you included Makefile? this makes building installation somewhat simpler for a user Yes, but the makefile is used just to

Re: [Haskell] Type-Level Naturals Like Prolog?

2006-07-13 Thread Jeremy Gibbons
On 13 Jul 2006, at 06:25, Jared Warren wrote: Haskell's type checking language is a logical programming language. The canonical logical language is Prolog. However, Idealised Prolog does not have data structures, and does Peano numbers like: natural(zero). natural(x), succ(x,y) :-

[Haskell] AngloHaskell: Gathering at Cambridge.

2006-07-13 Thread Lemmih
Greetings fellow Haskellers, As you may or may not know, the great folks at Microsoft Research are interviewing people from the end of this month to the 11th of August. In light of this event, I hereby call attention to the AngloHaskell gathering: http://haskell.org/haskellwiki/AngloHaskell

Re: [Haskell-cafe] Re: [Haskell] Type-Level Naturals Like Prolog?

2006-07-13 Thread Bulat Ziganshin
Hello Donald, Thursday, July 13, 2006, 9:33:34 AM, you wrote: Why can't Haskell (with extensions) do type-level Peano naturals in the same fashion? The code would be something like: darcs get --partial --tag '0.1' http://www.eecs.tufts.edu/~rdocki01/typenats/ -- Best regards, Bulat

Re: [Haskell-cafe] Hackathon hesitation

2006-07-13 Thread Martin Percossi
Chad Scherrer wrote: I'm interested in attending the Hackathon, but I don't have anyprevious experience working on compilers. One book I'm reading right now is Modern Compiler Implementation in ML (http://www.cs.princeton.edu/~appel/modern/ml/). The author writes a compiler of increasing

Re: [Haskell-cafe] Breaking cycles in a directed graph.

2006-07-13 Thread Jens Fisseler
Hi Daniel, R.C. Read, R.E. Tarjan. Bounds on Backtrack Algorithms for Listing Cycles, Paths and Spanning Trees. Networks 5: 237-252, 1975, section 8.3, Cycles, of Edward M. Reingold, Jurg Nievergelt, Narsing Deo. Combinatorial Algorithms: Theory and Practice. Prentice-Hall, Englewood

Re: [Haskell-cafe] Hackathon hesitation

2006-07-13 Thread Malcolm Wallace
Martin Percossi [EMAIL PROTECTED] writes: Another question regarding the hackathon: will anyone be video taping the presentations? I live in europe and travel will be prohibitive: it would be nice if the presentations where mpeg'd and dumped onto the haskell website so that anyone can

Re[2]: [Haskell-cafe] Hackathon hesitation

2006-07-13 Thread Bulat Ziganshin
Hello Jeremy, Wednesday, July 12, 2006, 10:43:22 PM, you wrote: I'm interested in attending the Hackathon, but I don't have any previous experience working on compilers. Perhaps we should start a list of pre-session recommended reading on the wiki page? I would recommend at least skimming

[Haskell-cafe] Re: [Haskell] Type-Level Naturals Like Prolog?

2006-07-13 Thread Niklas Broberg
On 7/13/06, Jared Warren [EMAIL PROTECTED] wrote: Haskell's type checking language is a logical programming language. The canonical logical language is Prolog. However, Idealised Prolog does not have data structures, and does Peano numbers like: natural(zero). natural(x), succ(x,y) :-

Re: [Haskell-cafe] Comma in the front

2006-07-13 Thread Jon Fairbairn
On 2006-07-13 at 02:29BST Neil Mitchell wrote: Hi, Are cool kids supposed to put the comma in front like this? Some cool kids do, some cool kids don't. Some do both, depending on their mood. The advantage of a leading , is that now the comma's line up, and if you want to add an item on

Re: [Haskell-cafe] Comma in the front

2006-07-13 Thread Henning Thielemann
On Thu, 13 Jul 2006, Jon Fairbairn wrote: On 2006-07-13 at 02:29BST Neil Mitchell wrote: Hi, Are cool kids supposed to put the comma in front like this? Some cool kids do, some cool kids don't. Some do both, depending on their mood. The advantage of a leading , is that now the

Re: [Haskell-cafe] Re: Why is there no splitBy in the list module?

2006-07-13 Thread Jon Fairbairn
On 2006-07-12 at 23:24BST Brian Hulley wrote: Christian Maeder wrote: Donald Bruce Stewart schrieb: Question over whether it should be: splitBy (=='a') aabbaca == [,,bb,c,] or splitBy (=='a') aabbaca == [bb,c] I argue the second form is what people usually want. Yes,

Re: [Haskell-cafe] Comma in the front

2006-07-13 Thread Jon Fairbairn
On 2006-07-13 at 11:15+0200 Henning Thielemann wrote: Optimal notation of lists, because of most easiest editing, is a: b: c: [] That made me smile. In Ponder I had used up : for types, and lists could be a:: b:: c:. but when I suggested this at a Haskell meeting, Simon PJ complained

RE: [Haskell-cafe] Re: Haskore dependency trouble

2006-07-13 Thread Simon Marlow
On 12 July 2006 16:12, Bulat Ziganshin wrote: Hello Simon, Wednesday, July 12, 2006, 6:28:55 PM, you wrote: like to be able to say the following: Cabal, find and use package X if it exists. Furthermore, when CPPing source code, set a #define HAS_PACKAGE_X so I can do conditional

Re[2]: [Haskell-cafe] Re: Haskore dependency trouble

2006-07-13 Thread Bulat Ziganshin
Hello Simon, Thursday, July 13, 2006, 1:40:22 PM, you wrote: I have some changes to Cabal partly finished that will address this. Don't worry, it's coming. thanks, i will be glad to see it. but it will be GHC66-only? No, just a new version of Cabal, which will work with 6.4.x. anyway it

RE: Re[2]: [Haskell-cafe] Re: Haskore dependency trouble

2006-07-13 Thread Simon Marlow
On 13 July 2006 11:27, Bulat Ziganshin wrote: Hello Simon, Thursday, July 13, 2006, 1:40:22 PM, you wrote: I have some changes to Cabal partly finished that will address this. Don't worry, it's coming. thanks, i will be glad to see it. but it will be GHC66-only? No, just a new

[Haskell-cafe] ldap-haskell questions

2006-07-13 Thread Ferenc Wagner
Hi, to start off, I'm using ldap-haskell straight from its darcs repo under GHC-6.4.1, and it works. Just not quite like I want. First, I can't make a static compile: $ ghc --make prog.hs -o prog works without a warning, while $ ghc --make prog.hs -o prog -optl -static [...]

Re: [Haskell-cafe] Comma in the front

2006-07-13 Thread Mark T.B. Carroll
Jon Fairbairn [EMAIL PROTECTED] writes: a:: b:: c:. but when I suggested this at a Haskell meeting, Simon PJ complained that it looks like hopscotch. I've never quite understood that complaint! http://blogs.salon.com/0002296/myimages/hopscotch.jpg and

Re: [Haskell-cafe] Comma in the front

2006-07-13 Thread Jon Fairbairn
On 2006-07-13 at 09:35EDT [EMAIL PROTECTED] (Mark T.B. Carroll) wrote: Jon Fairbairn [EMAIL PROTECTED] writes: a:: b:: c:. but when I suggested this at a Haskell meeting, Simon PJ complained that it looks like hopscotch. I've never quite understood that complaint!

Re: [Haskell-cafe] Comma in the front

2006-07-13 Thread Robert Dockins
On Jul 12, 2006, at 9:18 PM, Joel Reymont wrote: Are cool kids supposed to put the comma in front like this? , foo , bar , baz Is this for historical or other reasons because Emacs formats Haskell code well enough regardless. Thanks, Joel I personally like this style. It's a

[Haskell-cafe] Re: [Haskell] Type-Level Naturals Like Prolog?

2006-07-13 Thread Greg Buchholz
Jared Warren wrote: Haskell's type checking language is a logical programming language. The canonical logical language is Prolog. Why can't Haskell (with extensions) do type-level Peano naturals in the same fashion? The code would be something like: Also of possible interest, _Fun with

Re: [Haskell-cafe] Using of C constants in Haskell sources; Determining compilation environment (Unix vs Windows)

2006-07-13 Thread John Meacham
On Wed, Jul 12, 2006 at 04:08:02PM +0400, Bulat Ziganshin wrote: I believe that it the simplest way for programmer. But is that the best way for users? i want to make building/installation as simple as possible using Cabal infrastructure. is it possible that some box will have Cabal, but not

[Haskell-cafe] Why is Day and Month bounded?

2006-07-13 Thread Johan Holmquist
I fail to see why the types Day and Month in System.Time are instances of Bounded. In my world there is no last day and the successor of Saturday is Sunday -- not an exception! :) I would like to believe there is a good reason for this boundedness, but I can't see it.

RE: [Haskell-cafe] Comma in the front

2006-07-13 Thread Tim Docker
On Jul 12, 2006, at 9:18 PM, Joel Reymont wrote: Are cool kids supposed to put the comma in front like this? , foo , bar , baz Is this for historical or other reasons because Emacs formats Haskell code well enough regardless. Thanks, Joel These layouts feel a bit artificial to

Re: [Haskell-cafe] Comma in the front

2006-07-13 Thread Tomasz Zielonka
On Fri, Jul 14, 2006 at 01:01:23AM +0100, Neil Mitchell wrote: There might be issues with tuples though, for example (1,2,) would be the (,) tuple and not the (,,) tuple, which is a bit weird. Besides, it might be a bit more natural if (1,2,) was a shorthand for (\x - (1,2,x)) Best regards