Re: [GHC] #716: Unloading a dll generated by GHC doesn't free all resources

2006-03-21 Thread GHC
#716: Unloading a dll generated by GHC doesn't free all resources -+-- Reporter: [EMAIL PROTECTED] | Owner: simonmar Type: bug | Status: closed Priority: normal

Re: [GHC] #716: Unloading a dll generated by GHC doesn't free all resources

2006-03-21 Thread GHC
#716: Unloading a dll generated by GHC doesn't free all resources -+-- Reporter: [EMAIL PROTECTED] | Owner: simonmar Type: bug | Status: reopened Priority: normal

Re: [GHC] #492: Retainer and biographical profiling with STM

2006-03-21 Thread GHC
#492: Retainer and biographical profiling with STM -+-- Reporter: simonmar| Owner: simonmar Type: bug | Status: closed Priority: normal | Milestone: 6.4.2

[GHC] #731: GHCi doesn't work on powerpc64

2006-03-21 Thread GHC
#731: GHCi doesn't work on powerpc64 --+- Reporter: simonmar |Owner: Type: bug| Status: new Priority: normal |Milestone: Component: GHCi |

[GHC] #732: Error in shutdownHaskell() in Win32 DLL

2006-03-21 Thread GHC
#732: Error in shutdownHaskell() in Win32 DLL -+-- Reporter: [EMAIL PROTECTED] |Owner: Type: bug | Status: new Priority: normal|Milestone:

Re: Show-ing GHC internal data structures

2006-03-21 Thread Simon Marlow
David William Simmons-Duffin wrote: I'm working with a friend on a project that involves hacking at the GHC internals. We'd like to be able to print some of the large data structures involved -- specifically a TcGblEnv. TcGblEnv is a record with a number of fields of different types, and it

[Haskell] CFP2: Mathematically Structured Functional Programming

2006-03-21 Thread Conor McBride
SECOND CALL FOR PAPERS Workshop on Mathematically Structured Functional Programming MSFP 2006 Kuressaare, Estonia, 2 July 2006 http://cs.ioc.ee/mpc-amast06/msfp/ a satellite workshop

Re: [Haskell] Haskell as a markup language

2006-03-21 Thread shelarcy
On Wed, 01 Mar 2006 17:46:47 +0900, [EMAIL PROTECTED] wrote: We demonstrate that Haskell as it is, with no TH or other pre-processors, can rather concisely represent semi-structured documents and the rules of their processing. In short, Haskell can implement SXML (ssax.sourceforge.net), right in

Re: Ranges and the Enum class

2006-03-21 Thread Malcolm Wallace
Wolfgang Jeltsch [EMAIL PROTECTED] writes: Also, toEnum and fromEnum would make more sense mapping from and to Integer. Why do we need toEnum and fromEnum at all? As far as I know, they are merely there to help people implement things like enumFrom. They are often useful for writing

RE: Strict tuples

2006-03-21 Thread Simon Marlow
On 21 March 2006 03:10, John Meacham wrote: On Mon, Mar 20, 2006 at 09:39:41AM -0500, Manuel M T Chakravarty wrote: Apart from the syntactic issues, does anybody else support the idea of strict tuples as proposed? I just want to know whether I am alone on this before putting it on the

Re: Strict tuples

2006-03-21 Thread Josef Svenningsson
On 3/21/06, Simon Marlow [EMAIL PROTECTED] wrote: By all means have strict tuples in a library somewhere.They don't needto have special syntax.I have a module Data.Pair which provides pairs with different strictness properties. Perhaps it can be used as a startingpoint. Cheers,/Josef

Re: Strict tuples

2006-03-21 Thread Manuel M T Chakravarty
John Meacham: On Mon, Mar 20, 2006 at 09:39:41AM -0500, Manuel M T Chakravarty wrote: Apart from the syntactic issues, does anybody else support the idea of strict tuples as proposed? I just want to know whether I am alone on this before putting it on the wiki. I have a few issues

Re: Strict tuples

2006-03-21 Thread John Meacham
On Tue, Mar 21, 2006 at 02:27:37PM -0500, Manuel M T Chakravarty wrote: strictness does not belong in the type system in general. strictness annotations are attached to the data components and not type components in data declarations because they only affect the desugaring of the

Re: the MPTC Dilemma (please solve)

2006-03-21 Thread Claus Reinke
you're right about interactions in general. but do you think constructor classes specifically would pose any interaction problems with FDs? You have to be more careful with unification in a higher-kinded setting. I am not sure how to do that with CHRs. to quote from the ATS paper: just like

important news: refocusing discussion

2006-03-21 Thread isaac jones
Greetings, While discussion on this mailing list has been coming fast furious, actual tangible progress, even as measured on the wiki, has not been as fast. To remedy this, we propose to focus immediately and intently on a few of the most critical topics, and to focus all of our energies on

Re: Ranges and the Enum class

2006-03-21 Thread Wolfgang Jeltsch
Am Dienstag, 21. März 2006 02:47 schrieb Aaron Denney: [...] No, I use them. In my opinion, it makes much more sense to write succ n than n + 1. Agreed, for non-arithmetical types. I think, it's perfectly sensible for arithmetical types like Integer. If you mean “the next integer” then

Re: Ranges and the Enum class

2006-03-21 Thread Wolfgang Jeltsch
Am Dienstag, 21. März 2006 10:08 schrieb Malcolm Wallace: Wolfgang Jeltsch [EMAIL PROTECTED] writes: [...] Why do we need toEnum and fromEnum at all? As far as I know, they are merely there to help people implement things like enumFrom. They are often useful for writing serialisation

Re: Strict tuples

2006-03-21 Thread Wolfgang Jeltsch
Am Dienstag, 21. März 2006 11:28 schrieb Bulat Ziganshin: [...] as i said, shebang patterns allow only to specify that IMPLEMENTATION of some function is strict. this helps only when this function are called directly. they can't help when function is passed as parameter or enclosed in data

Re: Time Library

2006-03-21 Thread Taral
On 3/20/06, Ashley Yakeley [EMAIL PROTECTED] wrote: Never as far as I can imagine. The 'a' parameter will be taken by a phantom type. http://haskell.org/haskellwiki/Phantom_type Now I don't recall, but is it allowed to do: data HasResolution a = Fixed a = ...? -- Taral [EMAIL PROTECTED] You

Re: important news: refocusing discussion

2006-03-21 Thread Taral
On 3/21/06, isaac jones [EMAIL PROTECTED] wrote: I'd like to ask folks to please bring currently open threads to a close and to document the consensus in tickets. Anyone can edit tickets, so please don't be shy. Claus, can you document some of your FD work in the FunctionalDependencies

Re: Strict tuples

2006-03-21 Thread Taral
On 3/18/06, Manuel M T Chakravarty [EMAIL PROTECTED] wrote: Of course, the caller could invoke addmul using a bang patterns, as in let ( !s, !p ) = addmul x y in ... but that's quite different to statically knowing (from the type) that the two results of addmul will already be

Re: Time Library

2006-03-21 Thread Ashley Yakeley
Taral wrote: Now I don't recall, but is it allowed to do: data HasResolution a = Fixed a = ...? Not usefully. data T a = MkT a data C a = T a = MkT a It's allowed, but it doesn't do what you probably want. All it does is change the type of the constructor MkT. If the parameter a to

Re: important news: refocusing discussion

2006-03-21 Thread isaac jones
On Tue, 2006-03-21 at 15:27 -0800, Ashley Yakeley wrote: isaac jones wrote: The topics that John and I feel are critical, and rather unsolved, are: * The class system (MPTC Dilemma, etc) * Concurrency * (One more, perhaps standard libraries) Could you summarise the current state

Collections interface

2006-03-21 Thread Jim Apple
I have created a ticket to make a standard collection interface. It is here: http://hackage.haskell.org/trac/haskell-prime/ticket/97 Obviously, it will be tough to figure out what the library can look like without knowing what MPTC's will look like. Jim

Re: Restricted Data Types Now

2006-03-21 Thread Jim Apple
On 2/8/06, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote: It seems we can emulate the restricted data types in existing Haskell. I have proposed this for Haskell' libraries. See http://hackage.haskell.org/trac/haskell-prime/ticket/98 Jim ___

MonadPlus Reform

2006-03-21 Thread Ashley Yakeley
Does this come under the standard libraries topic? I would like to see the MonadPlus class disambiguated: class Monad m = MonadZero m where mzero :: m a class MonadZero m = MonadPlus m where mplus :: m a - m a - m a class MonadZero m = MonadOr m where morelse :: m a - m a - m a

Re: Time Library

2006-03-21 Thread Taral
On 3/21/06, Ashley Yakeley [EMAIL PROTECTED] wrote: Not usefully. data T a = MkT a data C a = T a = MkT a It's allowed, but it doesn't do what you probably want. All it does is change the type of the constructor MkT. I think it also allows the inference of HasResolution a from Fixed a,

[Haskell-cafe] Re: strange ghc program behaviour

2006-03-21 Thread Christian Maeder
I remember that we had problems with HaXml producing empty or truncated files, too. I think with ghc-6.4.1 and HaXml-1.13 this problem was solved. (The deprecated stuff is definitely not the cause). The problem must have been related to the output handle being either stdout or a file (and

[Haskell-cafe] strange ghc program behaviour

2006-03-21 Thread Koen . Roelandt
Hi, I'm a Haskell newbie using HaXml for the conversion of xml files into html files. I'm using GHC 6.4 to compile the program. When I run the program, it will not convert the whole file: the document tree is incomplete and will stop when the limit of e.g. 8k has been reached. E.g. An xml

Re: [Haskell-cafe] strange ghc program behaviour

2006-03-21 Thread Malcolm Wallace
[EMAIL PROTECTED] wrote: E.g. An xml file of 12.3k will result in a file of 8k and will stop at 8k An xml file of 15.7k will result in a file of 16k An xml file of 36k will result in a file of 24k From ghc-6.4, the runtime system no longer flushes open files; it truncates them instead. You

[Haskell-cafe] Porting GHC to OSX86?

2006-03-21 Thread Deling Ren
Hi there, Has anyone made any attempt to port GHC to Mac OS X on x86? Wolfgang Thaller’s binary package runs over Rosetta but slow (not surprising). It can not be used to compile a native version either (I got some errors related to machine registers). I tried to do a bootstrap but can't

[Haskell-cafe] Re: Associated types and data constructors (was: the MPTC Dilemma (please solve))

2006-03-21 Thread Manuel M T Chakravarty
David Menendez: This is something I've been wondering about for a while. Can you do that sort of thing with associated types? As another example, consider this type class for composible continuation monads: class Monad m = MonadCC p sk m | m - p sk where newPrompt :: m (p

[Haskell-cafe] Re: Returning a list element?

2006-03-21 Thread Dominic Steinitz
Robert Dockins robdockins at fastmail.fm writes: FYI, putStrLn will automatically insert a newline for you, and the final 'return ()' is unnecessary. My favorite idiom for this kind of thing is: mainMenu = putStr $ unlines [ line 1 , line 2 , line 3 ] Or how about

Re: [Haskell-cafe] Re: Returning a list element?

2006-03-21 Thread Donald Bruce Stewart
dominic.steinitz: Robert Dockins robdockins at fastmail.fm writes: FYI, putStrLn will automatically insert a newline for you, and the final 'return ()' is unnecessary. My favorite idiom for this kind of thing is: mainMenu = putStr $ unlines [ line 1 , line 2 ,