Re: [Haskell] ANNOUNCE: binary: high performance, pure binary serialisation

Dear Donald! Donald Bruce Stewart (Fri, Jan 26, 2007 at 01:51:01PM +1100): Binary: high performance, pure binary serialisation for Haskell -- [..] Encoding and decoding are achieved by the functions:

Re: [Haskell] Re: state of HaXml?

My 2 cent: Why does seq not help? See code below. Simon Marlow (Thu, Jan 04, 2007 at 03:08:45PM +): and the original code was this: load fn = do handle - IO.openFile fn IO.ReadMode contents - IO.hGetContents handle IO.hClose handle return

[Haskell] ANN: monadic probabilistic functional programing

, -- Stefan Karrmann ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] Package mounting proposal

, -- Stefan Karrmann If A equals success, then the formula is _A = _X + _Y + _Z. _X is work. _Y is play. _Z is keep your mouth shut. -- Albert Einstein ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman

Re: [Haskell] ANN: monadic probabilistic functional programing

/19/06, Stefan Karrmann [EMAIL PROTECTED] wrote: Unfortunatly, darcs does not provide a method to extract patches as far as I know. (Hints are welcomed.) darcs diff and darcs annotate. Regards, -- Stefan Karrmann ___ Haskell mailing list Haskell

Re: [Haskell] Re: QuickCheck revival and Cabal

Koen Claessen (Wed, Apr 12, 2006 at 11:06:50AM +0200): There is currently an old QuickCheck version in the standard hierarchy in Test.QuickCheck. As the new QuickCheck is incompatible with the old one, I do not want to override that place. Rather, I would like to create my own little space in

[Haskell] Compilation of big, computed tables

-files -keep-hc-files foo.hs Regards, -- Stefan Karrmann module Foo (module Foo) where import Data.Array.IArray import Data.Array.Unboxed big1 :: UArray Int Char big1 = array (0,1000) $! map (\i - (i,toEnum i)) [0..1000] big2 = sum [0..1]::Int

Re: [Haskell] Improvements to GHC

not use staging like in Omega, cf. [1], or Template Haskell? Maybe Haskell itself can generate the compiler and system specific source? [1] http://www.cs.pdx.edu/~sheard/Omega/index.html Regards, -- Stefan Karrmann ___ Haskell mailing list Haskell

Re: [Haskell] rfc: package mounting

existing compiler command-line syntax to be used.) [...] Frederik Regards, -- Stefan Karrmann ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] instance Bounded Double

$ floatRange x min_pos_float x = encodeFloat (1) (expo - mant) where radix = floatRadix x mant = floatDigits x expo = fst $ floatRange x min_float x = - max_float x max_neg_float x = - min_pos_float x Regards -- Stefan Karrmann ___ Haskell

[Haskell] Non-terminating compilation of non-positive construction.

The compilation by the Glorious Glasgow Haskell Compilation System, version 6.2, loops on this small module. IMHO only the execution should loop or non positive constructions should be excluded. Is it a bug or is non positivity too dangerous? Sincerly, -- Stefan Karrmann

Re: time since the epoch

Dear Juanma, thanks for your remarks. Juanma Barranquero (Mon, Nov 10, 2003 at 10:54:22AM +0100): On Fri, 7 Nov 2003 19:55:47 +0100 Stefan Karrmann [EMAIL PROTECTED] wrote: I've inserted 'convert = (uncurry cFromTai) . cToTai'. Great, thanks. A fixed and checked version is appended

Re: set representation question

on the distribution of the data. Sincerly, -- Stefan Karrmann ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: time since the epoch

Dear Juanma, some last moment changes broke the library, I am sorry. Juanma Barranquero (Thu, Nov 06, 2003 at 05:03:03PM +0100): On Sat, 1 Nov 2003 17:36:11 +0100 Stefan Karrmann [EMAIL PROTECTED] wrote: a while ago time calculation was subject on this list. Now, I have

Re: time since the epoch

:-) Sincerly, -- Stefan Karrmann 2003 Copyright (C) Stefan Karrmann [EMAIL PROTECTED] All rights reserved. The rights of the GNU Library General Public Licence Version 2 are granted, for details confer http://www.fsf.org/copyleft/lgpl.html. This module provides data structures and functions

Re: [mercury-users] pragma compiled_memo for compile-time tabled evaluation

André Platzer (Fri, Sep 05, 2003 at 04:03:42PM +0200): Hello Mercury users! Is there any way to extend tabled evaluation to compile-time? As far as I understand, normal tabled evaluation memorises values computed at run-time. On an invocation with the same arguments, then mercury reuses

Re: Proposal for a new I/O library design

Ben Rudiak-Gould (Sun, Jul 27, 2003 at 09:35:41PM -0700): module System.ProposedNewIOModel (...) where I assume that all I/O occurs in terms of octets. I think that this holds true of every platform on which Haskell is implemented or is likely to be implemented. type Octet = Word8

Re: Function composition and currying

for this? unzip :: [t *] - c [*] (Maybe only with n instead of * forall n.) -- Stefan Karrmann ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

[OT] Re: time since the epoch

Peter Thiemann (Mon, Feb 10, 2003 at 04:36:17PM -0800): Stefan == Stefan Karrmann [EMAIL PROTECTED] writes: Stefan Peter Thiemann (Thu, Feb 06, 2003 at 12:40:14PM -0800): John's code illustrates TimeDiff's deficiencies perfectly: There is also a more fundamental problem

Re: two easy questions

++ show d ++ show e You can write a printf-like function in Haskell, s.t. output = construct-printf.hs google it, since I do not remember the location of the paper. -- ? Thanks for the help. -mike -- Stefan Karrmann ___ Haskell mailing list [EMAIL

Re: time since the epoch

formats (which is what I ended up writing myself for the ISO8601 format). Cheers, -- Stefan Karrmann ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: time since the epoch

' -- a leap year Suppose a leap second: floorTimeAdd '2000-01-31.23:59:60' (Minute 1) == '2000-02-01.00:00:59' Cheers, -- Stefan Karrmann ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: time since the epoch

. o Only, programs that run several month have to update the leap-seconds table more than once. On UTCtime we can build ISO, Gregorian, Julian, etc. calendars. Cheers, -- Stefan Karrmann ___ Haskell mailing list [EMAIL PROTECTED] http

Re: time since the epoch

Keith Wansbrough (Thu, Feb 06, 2003 at 05:46:22PM +): Stefan Karrmann [EMAIL PROTECTED] writes: A sound base for a Time implementation should use TAI (temps atomique international), c.f. http://cr.yp.to/libtai.html. I disagree; I think UTC is quite sufficient, and will match

Re: time since the epoch

thing that only an expert can implement the spec! -- Stefan Karrmann ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Text in Haskell: a second proposal

. You can even have 3.32 bits if hmax h returns 10. Using type 5 as a lowest level a library can provide higher level access with standard or special encodings. Sincerly, -- Stefan Karrmann ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org

Dependent types (Was: Re: BAL paper available)

C T McBride schrieb folgendes am Wed, May 16, 2001 at 01:03:25PM +0100: On Wed, 16 May 2001, Stefan Karrmann wrote: On Tue, May 15, 2001 at 09:14:02PM +0300, Dylan Thurston wrote: On Tue, May 15, 2001 at 06:33:41PM +0200, Jerzy Karczmarczuk wrote: ... you really need types that depend

Re: BAL paper available

). -- Stefan Karrmann ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Proposal: module namespaces.

disappear. Other may be needed in later versions of the library. Regards, -- Stefan Karrmann ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: binary files in haskell

bits. -- Stefan Karrmann ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Are anonymous type classes the right model at all? (replying to Re: Are fundeps the right model at all?)

A syntax to choose the active instances may be useful, too. E.g.: use EccenticOrd, SetCollection in exp then in exp the instances EccenticOrd, SetCollection are known (or preferred). This is similiar to the open syntax in Cayenne. -- Stefan Karrmann

Re: Haskell Clean

Am Fri, Jan 14, 2000 at 02:23:00PM +0800 schrieb Nguyen Phan Dung: So what are the important differences between Clean Haskell? What are the pros and cons of unique typing with multiple environments vs. the IO monad? Thanks, -- Stefan Karrmann.

State - IO Monad

Hi, it used to be a big problem in functional programming languages (FP) to handle with input, output and state. Irrefutable patterns, unique types, continuation passing style and IO monad programming solves this problem. In Haskell the IO monad has won the competition between these solutions.