Stricts _

2004-07-13 Thread Peter Simons
ghci-6.3 (from CVS) shows me strictness information when I request :info for a data type, like: [...] Send Mailbox Stricts: _ [...] I have no idea how to read that output, and it doesn't seem to be documented in the manual either. Does the underscore signify that (in the example above)

RE: Stricts _

2004-07-13 Thread Simon Marlow
On 13 July 2004 15:02, Peter Simons wrote: ghci-6.3 (from CVS) shows me strictness information when I request :info for a data type, like: [...] Send Mailbox Stricts: _ [...] I have no idea how to read that output, and it doesn't seem to be documented in the manual either. Does the

Re: Stricts _

2004-07-13 Thread Ian Lynagh
On Tue, Jul 13, 2004 at 03:16:39PM +0100, Simon Marlow wrote: On 13 July 2004 15:02, Peter Simons wrote: ghci-6.3 (from CVS) shows me strictness information when I request :info for a data type, like: [...] Send Mailbox Stricts: _ [...] I have no idea how to read that

Re: [Haskell] type class does not compile

2004-07-13 Thread Graham Klyne
At 19:24 12/07/04 -0500, [EMAIL PROTECTED] wrote: Hi, please bear with me if my question turns out to be a stupid mistake. It has taken me hours to figure this out. class Rule r u u' m where apply :: r - u - m u' data And = And data Bin a b o = Bin a b o instance (Monad m, Rule r1 u u' m, Rule

Re: [Haskell] for large x, log (x::Integer) :: Double

2004-07-13 Thread Dylan Thurston
On Tue, Jul 13, 2004 at 05:01:32PM +0800, Dylan Thurston wrote: This library will let you use a shift instead of a division, but won't give you a constant time size function for Integers. You can easily get a logarithmic time size function from the shift. But did you see Data.Bits.bitsize?

[Haskell] Any way to change state type in a monad?

2004-07-13 Thread Ben . Yu
Hi, I'm trying to implement some rule combinators. I'm hoping my combinators can change the state type implicitly passed around. Basically, a rule should be something like: newtype Rule m u u' = ... where it takes an input u and returns type u' as the result. m represents an inner monad. For

[Haskell] SCP Special Issue on Foundations of Aspect-Oriented Programming

2004-07-13 Thread Ralf Laemmel
[ Functional programming has contributed to the foundations of AOP over the last few years. For instance, see Walker's and Wand's contributions at ICFP 2003. ] Special Issue on Foundations of Aspect-Oriented Programming Science of Computer Programming Guest Editors: Pascal Fradet and Ralf Lämmel

[Haskell] CFP: TFP04 Symp on Trends in Functional Programming

2004-07-13 Thread Hans-Wolfgang Loidl
[ Functional apologies for repeated copies of this message apply -- HWL ] CALL FOR PAPERS TFP 2004 Fifth Symposium on Trends in Functional Programming

Re: [Haskell-cafe] migrating from python

2004-07-13 Thread Graham Klyne
At 16:34 13/07/04 +0200, paolo veronelli wrote: I'm working on semantics and triples (RDF co) I've been working on something very similar, in Haskell. I also did some work in Python before moving to Haskell. My project is Swish [1]. (I've also just completed coding/testing of an RDF/XML