Sent: Friday, December 09, 2005 3:59 PM
On Fri, Dec 09, 2005 at 05:49:15AM +0100, [EMAIL PROTECTED] wrote:
> On Thu, Dec 08, 2005 at 09:59:25PM +0100, [EMAIL PROTECTED] wrote:
> > p.s.: Strangely, Tomasz's reply again appears as being sent from my address
> > in the archive. Anyone knows why?
>
>
From: Daniel Fischer <[EMAIL PROTECTED]>
To: "Branimir Maksimovic" <[EMAIL PROTECTED]>
CC: Haskell-Cafe@haskell.org
Subject: Re: Differences in optimisiation with interactive and compiled mo
Date: Fri, 9 Dec 2005 23:27:00 +0100
Still doesn't work, though:
*Main> searchr "hahal" "jupp" "hahah
Check section 6.2 of the ghc user's guide, under "How do I find out a
function's strictness" :) It's in the .hi files.
joelr1:
> Duncan,
>
> How do you find out the strictness that ghc infers for functions?
>
> Thanks, Joel
>
> On Dec 8, 2005, at 8:09 PM, Duncan Coutts wrote:
>
> >For ex
> Hmmm I thought that arrays in Python have no reason to be boxed. Lists,
> yes, since they are untyped, so they are arrays of pointers, but arrays are
> homogeneous.
Python has a different meaning for "list" than the rest of the world.
When python says "list", read "boxed array" (heterogeneo
Thanks, this is very helpful.
John Velman
On Fri, Dec 09, 2005 at 02:29:33PM -0500, Cale Gibbard wrote:
> A "box" is a cell representing some value in a program. It generally
> ...
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskel
Still doesn't work, though:
*Main> searchr "hahal" "jupp" "hahahalala"
"hahahalala"
The problem is that the string to replace may contain a repeated pattern
and the pattern that begins the actual occurence might be consumed before a
failure is detected.
And is
*Main> searchr "bla" "" "remove bla
Tomasz Zielonka:
...
there are other reasons to box values besides implementing laziness,
like for simplifying the memory model (which can simplify GC
implementation), allowing to intermix values of different types
(different kinds of polymorphism) or allow variable sized values (think
strings,
On Fri, Dec 09, 2005 at 02:29:33PM -0500, Cale Gibbard wrote:
> A "box" is a cell representing some value in a program. It generally
> contains a pointer to code (a thunk), or to a proper value. When
> evaluation of that box is forced for the first time, the code
> executes, and when it is done, it
Hello Brian,
Thursday, December 08, 2005, 10:54:29 PM, you wrote:
BM> I need to extract text from a structed binary file. Its a local
BM> database for a commercial app of proprietary structure, though the
BM> structure has been determined. So I need to move along a number of
BM> bytes, take a f
A "box" is a cell representing some value in a program. It generally
contains a pointer to code (a thunk), or to a proper value. When
evaluation of that box is forced for the first time, the code
executes, and when it is done, it updates the pointer with a pointer
to the result value. There are a n
I've tried google and google scholar, wikipedia, and planetMath. Can't
find a description. Can someone point me to a freely available reference?
Thanks,
John Velman
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
Hi,
I've just looked through this discussion, since I'm working on my own
library, I wanted to see what people are doing.
It's something like this, using the Prepose (Implicit Configurations)
paper:
data L n = L Int deriving (Show, Eq, Ord)
-- singleton domain
type S = L Zero
class (Bounded a,
Duncan,
How do you find out the strictness that ghc infers for functions?
Thanks, Joel
On Dec 8, 2005, at 8:09 PM, Duncan Coutts wrote:
For example it's not currently convenient to find out the strictness
that ghc infers for functions (though it is possible). Ideally an
IDE or
some
On Fri, Dec 09, 2005 at 08:23:47PM +0200, raptor wrote:
> Is there a function like "map (map f) list" i.e. map of map ?
Yes, it's "map (map f) list" :-)
Best regards
Tomasz
--
I am searching for a programmer who is good at least in some of
[Haskell, ML, C++, Linux, FreeBSD, math] for work in Wa
Hello Branimir,
Friday, December 09, 2005, 12:24:16 PM, you wrote:
BM> Just to say my algorithm takes some optimisation opportunities.
look at http://haskell.org/hawiki/RunTimeCompilation
--
Best regards,
Bulatmailto:[EMAIL PROTECTED]
___
On Friday 09 December 2005 17:31, Christian Maeder wrote:
> raptor wrote:
> > And second why when I try do do function composition i.e. :
> >
> > newf = map . f
> >
> > But this works :
> >
> > newf x = map (f x)
>
> Does f has constraints? It should work with a type signature.
To elaborate this v
My apology to those who don't care about
Java. Please trash this note.
I recently published two open source
Java projects that are based on the Monad computation model learned from
Haskell community.
1. A port for Parsec. This library is
called Jparsec. It implements monadic parser combinator in
raptor wrote:
And second why when I try do do function composition i.e. :
newf = map . f
But this works :
newf x = map (f x)
Does f has constraints? It should work with a type signature.
HTH Christian
___
Haskell-Cafe mailing list
Haskell-Cafe@has
hi,
Is there a function like "map (map f) list" i.e. map of map ?
And second why when I try do do function composition i.e. :
newf = map . f
But this works :
newf x = map (f x)
thanx
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.h
On Fri, 9 Dec 2005, raptor wrote:
hi,
I imported :
import Data.Map as Map
but now anywhere when I want ot use "map" it complains for
name clashes, so I have to specifiy Prelude.map all the time.
If at all, better use List.map instead of Prelude.map
_
Benjamin Franksen <[EMAIL PROTECTED]> writes:
>> import Data.Map as Map
>>
>> but now anywhere when I want ot use "map" it complains for
>> name clashes, so I have to specifiy Prelude.map all the time.
>> Is there a way to specify that i mean Prelude not Data 'map' (but not
>> fqn) I use Hugs, 'ca
On Fri, Dec 09, 2005 at 05:49:15AM +0100, [EMAIL PROTECTED] wrote:
> On Thu, Dec 08, 2005 at 09:59:25PM +0100, [EMAIL PROTECTED] wrote:
> > p.s.: Strangely, Tomasz's reply again appears as being sent from my address
> > in the archive. Anyone knows why?
>
> Maybe mailman is somehow confused by th
On Thursday 08 December 2005 23:24, raptor wrote:
> hi,
>
> I imported :
>
> import Data.Map as Map
>
> but now anywhere when I want ot use "map" it complains for
> name clashes, so I have to specifiy Prelude.map all the time.
> Is there a way to specify that i mean Prelude not Data 'map' (but not
On Thu, Dec 08, 2005 at 05:31:37PM -0500, Thomas Jger wrote:
> Since you're already using GADTs, why not also use them to witness type
> equality:
Thanks for the suggestion! This just illustrates the rule that when using
GADTs the solution to every problem is to introduce another GADT. It
amazes
On 12/8/05, David Roundy <[EMAIL PROTECTED]> wrote:
> So is there some other approach that I can use for easily coercing phantom
> types based on runtime checks? Any suggestions?
None here. Since H-M uses type unification to do type inference, you
can't auto-create a program based on the inferred
From: Henning Thielemann <[EMAIL PROTECTED]>
To: Branimir Maksimovic <[EMAIL PROTECTED]>
CC: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Differences in optimisiation with interactive
and compiled mo
Date: Fri, 9 Dec 2005 09:23:53 +0100 (MET)
On Thu, 8 Dec 2005, Branimir Maksimovic
GHC now has a Wiki http://cvs.haskell.org/trac/ghc/wiki, so I've started
a new page to give pointers to material on concurrent programming using
GHC. (The link is near the bottom.)
Please add to it.
Simon
| -Original Message-
| From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behal
On Thu, 8 Dec 2005, Branimir Maksimovic wrote:
From: Henning Thielemann <[EMAIL PROTECTED]>
To: Branimir Maksimovic <[EMAIL PROTECTED]>
CC: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Differences in optimisiation with interactive
and compiled mode
Date: Thu, 8 Dec 2005 18:38:45 +0100
28 matches
Mail list logo