Some Haskell-STM benchmarks can be found here:
Dissecting Transactional Executions in Haskell
Cristian Perfumo et al
http://www.cs.rochester.edu/meetings/TRANSACT07/
Martin
-Willem Maessen writes:
On Mar 1, 2008, at 6:41 PM, Tom Davies wrote:
I'm experimenting with STM (in CAL[1]
Final Call for Papers
ICFP 2008: International Conference on Functional Programming
Victoria, BC, Canada, 22-24 September 2008
http://www.icfpconference.org/icfp2008
Submission deadline: 2 April 2008
ICFP 2008 seeks
I've used Control.Parallel and Control.Parallel.Strategies extensively in
the past, and I thought I knew what I was doing. I declared the following
function:
findSupernodes' :: S.Set Name - Int - Tree - Protein.Tree - S.Set Name
findSupernodes' set size (Node i _ _ s il ir) (Protein.Node _ pl pr
Hi all,
I have recently tried to replicate some examples from in the articles about
type families but found some possible bugs.
In [2], the example
class C a where
type S a (k :: * - *) :: *
instance C [a] where
type S [a] k = (a,k a)
does not compile under the claim that the type
2008/3/3 Hugo Pacheco [EMAIL PROTECTED]:
class C a where
type S a (k :: * - *) :: *
instance C [a] where
type S [a] k = (a,k a)
does not compile under the claim that the type variable k is not in scope.
It's not entirely syntactical sugar; I believe that when a type family
is a
jason.dusek:
I have an awkward programming problem -- I need to take a
dictionary, parse it, build a bunch of intermediate lists and
then make maps and tries out of the list. A programming
problem because it's taken me a fair amount of effort to pull
together the parser and list
I'm interested in seeing what kind of assembler my functions turn
into. Is there a means of annotating assembler output, similar to the
{#- CORE -#} pragma? Is there a trickier way of doing it?
Justin
___
Haskell-Cafe mailing list
Hi
I was playing with various versions of sorting algorithms. I know it's very
easy to create flawed benchmark and I don't claim those are good ones.
However, it really seems strange to me, that sort - library function - is
actually the worse measured function. I can hardly belive it, and I'd
Hi Justin.
try: ghc -c file -ddump-to-file -ddump-asm
You should get a .dump.asm file in the same place as file which still
has symbols named after the source functions. Keep in mind though that
the continuation passing style (CPS) conversion done in the back end of
GHC causes the code not
And to answer your actual question..
No - notes in the core language get stripped out during conversion to STG.
Ben.
Justin Bailey wrote:
I'm interested in seeing what kind of assembler my functions turn
into. Is there a means of annotating assembler output, similar to the
{#- CORE -#}
Hugo Pacheco:
I have recently tried to replicate some examples from in the
articles about type families but found some possible bugs.
In [2], the example
class C a where
type S a (k :: * - *) :: *
instance C [a] where
type S [a] k = (a,k a)
does not compile under the claim that the
I was wondering if there are any haskell packages for tagging ID3 frames in mp3
files. Or perhaps if there were any plans for developing them...
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
baseballfurlife:
I was wondering if there are any haskell packages for tagging ID3 frames in
mp3
files. Or perhaps if there were any plans for developing them...
hpodder includes the ability to write id3 tags, iirc,
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hpodder
if
Many thanks for the explanations when I was first experimenting with
Haskell. I managed to finish translating a C++ wxWidgets program into
Haskell wxHaskell, and am certainly impressed.
I've written up some reflections on my newbie experience together with
both versions, which might be helpful to
14 matches
Mail list logo
