On 2008 Nov 26, at 16:58, Matthias Kilian wrote:
On Wed, Nov 26, 2008 at 09:35:01PM +, Andrew Coppin wrote:
It is a fork of the JHC compiler, which should be easier to look up.
There is also Hugs, as you mentioned. In addition, you may want to
look at YHC and NHC.
Yeah, the
allbery:
On 2008 Nov 26, at 16:58, Matthias Kilian wrote:
On Wed, Nov 26, 2008 at 09:35:01PM +, Andrew Coppin wrote:
It is a fork of the JHC compiler, which should be easier to look up.
There is also Hugs, as you mentioned. In addition, you may want to
look at YHC and NHC.
Yeah, the
Jason Dagit [EMAIL PROTECTED] writes:
That is, if you use the optional specification of a header file for each
foreign import, and if your Haskell compiler can compile via C, then any
checking that types match between Haskell and C can be performed
automatically, by the
Bartosz Wójcik [EMAIL PROTECTED] writes:
Win32 Core2Duo 1.8GHz 1GB RAM
17 Mb total memory in use
MUT time 56.97s ( 57.02s elapsed)
%GC time 0.5%
Win32 Core2Duo 2.2GHz 2GB RAM
17 Mb total memory in use
MUT time 57.44s ( 57.53s elapsed)
%GC time 0.7%
we, the DPH team, are at the moment in the very unfortunate situation
of not having a proper machine for running our benchmarks on. Could a
kind soul maybe give us (i.e., me) access to a quadcore or 2xquadcore
x86 Linux or OS X machine? I only need to build ghc on it and run
small
On Wed, 2008-11-26 at 23:16 +, Malcolm Wallace wrote:
... to work out the C types and then map them to Haskell ones, to
check they're the same as the declared types in the .hs files.
I'd like to point out that the FFI specification already has such a
mechanism.
That is, if you use
Incidentally, Haskell is mentioned several times in the Dr. Dobbs
Journal article on the Wadler paper:
Dr. Dobb's | Old ideas form the basis of advancements in functional
programming | 12 1, 2000
http://www.ddj.com/showArticle.jhtml?articleID=184404384
Specifically:
Languages that took more
On Tue, Nov 25, 2008 at 11:07 PM, Don Stewart [EMAIL PROTECTED] wrote:
What does the code look like?
It looks like that. Of course it doesn't compute the same number as
the initial code, but it starts 3 sparks and I get the expected 100%
CPU usage instead of 50%.
parSumFibEuler :: Int - Int
2008/11/27 Galchin, Vasili [EMAIL PROTECTED]:
Hello,
I am reading re-reading Prof. Wadler paper
Proofs are Programs: 19th Century Logic and 21st Century Computing
but also want to re-read watch his video on same subject.
Is it this talk you're after?
Am 27.11.2008 um 09:23 schrieb Don Stewart:
allbery:
On 2008 Nov 26, at 16:58, Matthias Kilian wrote:
On Wed, Nov 26, 2008 at 09:35:01PM +, Andrew Coppin wrote:
It is a fork of the JHC compiler, which should be easier to
look up.
There is also Hugs, as you mentioned. In addition, you
Dear all
I'm trying to locally build the documentation for the haskell-src-exts package
and running into a bit of bother.
If I run: cabal haddock
I get the error:
haddock: parse error in doc string
so: cabal haddock -v
Doesn't really provide any extra information, it gives me the exact haddock
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/PBKDF2
Since no one took up my code review request I just did the best I
could and uploaded to hackage. There were indeed some mistakes in my
initial post, fixed now. (Code review is still wished, though!)
Alas, documentation doesn't
Ross Paterson wrote:
On Thu, Nov 27, 2008 at 11:52:04AM +, allan wrote:
I'm trying to locally build the documentation for the haskell-src-exts
package and running into a bit of bother.
If I run: cabal haddock
I get the error:
haddock: parse error in doc string
The problem is that
Hey dear Haskell-Cafe-Readers,
I tried several times to upload several images - screenshots that is - to
my HaskellWiki/Xmonad site:
http://haskell.org/haskellwiki/Image:And1_xmonad.png
I always get the error, that the connection to the site/server was
reset.
I mailed both administrators of
On Thu, Nov 27, 2008 at 11:52:04AM +, allan wrote:
I'm trying to locally build the documentation for the haskell-src-exts
package and running into a bit of bother.
If I run: cabal haddock
I get the error:
haddock: parse error in doc string
The problem is that several of the modules (not
On Thu, Nov 27, 2008 at 5:45 AM, Roman Leshchinskiy [EMAIL PROTECTED] wrote:
Hi all,
we, the DPH team, are at the moment in the very unfortunate situation of not
having a proper machine for running our benchmarks on. Could a kind soul
maybe give us (i.e., me) access to a quadcore or
I've been away. I hope others will reply to this thread too; whatever you
decide will end up in TH indefinitely. I know that Roman is interested in this.
· You focus just on type families in class declarations (which is
indeed where associated types started). But I suggest you also
Brandon S. Allbery KF8NH wrote:
On 2008 Nov 10, at 19:04, Jason Dusek wrote:
simple exe bytes args= do
(i, o, e, p)- runInteractiveProcess exe args Nothing
Nothing
hPut i bytes
s - hGetContents o
hClose i
return s
Yep, that's your problem.
On Wed, Nov 26, 2008 at 14:38:33 +, Eric Kow wrote:
In principle, the same advice applies for Windows users, with more
details hopefully to follow on how the C libz in a GHC-accesible
location. Details to follow.
As promised, here are the details for installing darcs using our
old
On Wed, 26 Nov 2008 23:48:19 -0600, Galchin, Vasili
[EMAIL PROTECTED] wrote:
Hello,
I am reading re-reading Prof. Wadler paper Proofs are Programs: 19th
Century Logic and 21st Century Computing
but also want to re-read watch his video on same subject.
???
There is a reference to the
On Thu, Nov 27, 2008 at 9:29 AM, Simon Peyton-Jones
[EMAIL PROTECTED] wrote:
Friends
GHC has embodied data type families since 6.8, and now type synonym families
(aka type functions) in 6.10. However, apart from our initial papers there
isn't much published material about how to *use* type
Claus Reinke wrote:
Do you have an example of a mutable state/ IO bound application, like,
hmm, a window manager or a revision control system or a file system...?
If you're looking for a challenge, how about this one (there used to
be lots of Haskellers into this game, any of you still
Hello Daniel,
Thursday, November 27, 2008, 4:43:08 PM, you wrote:
Another possibility is using the Amazon EC2 functionality and rent a
high-CPU instance (http://aws.amazon.com/ec2/#instance) for as long as
these are virtual cores, which isn't appropriate for measuring
performance on real 4/8
Hi Stephen,
I've now worked around this bug in Hoogle - I'm just about to rebuild
the website, and hopefully the bug will have disappeared. (Rebuilding
the website could take a few days, as I'm currently hunting for the
right compiler etc...)
Thanks
Neil
On Fri, Nov 21, 2008 at 8:21 AM,
On Thu, Nov 27, 2008 at 12:25 PM, Bulat Ziganshin
[EMAIL PROTECTED] wrote:
Hello Daniel,
Thursday, November 27, 2008, 4:43:08 PM, you wrote:
Another possibility is using the Amazon EC2 functionality and rent a
high-CPU instance (http://aws.amazon.com/ec2/#instance) for as long as
these are
Do you have an example of a mutable state/ IO bound application, like,
hmm, a window manager or a revision control system or a file system...?
If you're looking for a challenge, how about this one (there used to
be lots of Haskellers into this game, any of you still around?-):
On 2008 Nov 27, at 8:51, Simon Marlow wrote:
Brandon S. Allbery KF8NH wrote:
On 2008 Nov 10, at 19:04, Jason Dusek wrote:
simple exe bytes args= do
(i, o, e, p)- runInteractiveProcess exe args Nothing
Nothing
hPut i bytes
s - hGetContents o
hClose i
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA512
On Thu, Nov 27, 2008 at 8:11 AM, And1 wrote:
Hey dear Haskell-Cafe-Readers,
I tried several times to upload several images - screenshots that is - to
my HaskellWiki/Xmonad site:
http://haskell.org/haskellwiki/Image:And1_xmonad.png
I always
On Wed, Nov 26, 2008 at 10:28:21PM +, Duncan Coutts wrote:
On Wed, 2008-11-26 at 14:38 +, Eric Kow wrote:
Older versions of darcs can to produce gzipped files with broken CRCs.
We never noticed this because our homegrown wrapper around the C libz
library does not pick up these
On Thu, Nov 27, 2008 at 10:20 AM, Ian Lynagh [EMAIL PROTECTED] wrote:
On Wed, Nov 26, 2008 at 10:28:21PM +, Duncan Coutts wrote:
On Wed, 2008-11-26 at 14:38 +, Eric Kow wrote:
Older versions of darcs can to produce gzipped files with broken CRCs.
We never noticed this because our
Hi,
Is there a way in Parsec to check what the next token is, and if it is what
you're hoping for, leave it there.
This is an example of something which doesn't work at all:
testpar = try $
do ae - array_element
option [] $ try $ satisfy (\c - c /= '(') unexpected
http://computer-go.org/pipermail/computer-go/2008-October/016680.html
Interestingly, I did this a while ago. Here's my results:
$ ./Bench 1 10
b: 14840, w: 17143 mercy: 67982
elapsed time: 3.42s
playouts/sec: 29208
so, nearly 30k/sec random playouts on 9x9. That's using a hack that stops
Having been a happy user of QuickCheck 2 for many years, I now find it
won't build under ghc 6.10.1. Before I investigate further, has anyone
encountered this problem and has a fix?
Thanks, Dominic.
C:\Users\Dom\QuickCheckSetup build
Preprocessing library QuickCheck-2.0...
Building
Paul Keir wrote:
Is there a way in Parsec to check what the next token is, and if it is
what you're hoping for, leave it there.
Maybe you're looking for 'lookAhead'?
[...]
//Stephan
--
Früher hieß es ja: Ich denke, also bin ich.
Heute weiß man: Es geht auch so.
- Dieter Nuhr
claus.reinke:
http://computer-go.org/pipermail/computer-go/2008-October/016680.html
Interestingly, I did this a while ago. Here's my results:
$ ./Bench 1 10
b: 14840, w: 17143 mercy: 67982
elapsed time: 3.42s
playouts/sec: 29208
so, nearly 30k/sec random playouts on 9x9. That's
Indeed. The base3/base4 simultaneous install.
http://haskell.org/haskellwiki/Upgrading_packages#runhaskell
Two solutions:
cabal install quickcheck
(will determine the base dependency correct). or:
runhaskell Setup.hs configure --constraint='base4'
dominic.steinitz:
Having been a
bulat.ziganshin:
Hello circ,
Thursday, November 27, 2008, 9:59:08 PM, you wrote:
So why not {hello: 1, there: 2} ?
mymap hello:1 there:2
where mymap implementation is left to the reader :)
Hey, well, even easier:
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE
What do those folks working on parallel Haskell arrays think about the
sequential Haskell array baseline performance?
Try using a fast array library like uvector? (With no serious overhead for
tuples too, fwiw)...
I downloaded uvector a while ago, but haven't got round to trying it
(yet
'lookAhead' is exactly what I needed:
try $ array_element = \ae - lookAhead (reservedOp () return ae
Many thanks,
Paul
Maybe you're looking for 'lookAhead'?
[...]
//Stephan
--
Früher hieß es ja: Ich denke, also bin ich.
Heute weiß man: Es geht auch so.
- Dieter Nuhr
Claus Reinke wrote:
In general, I think Haskell has too many array libraries, with too
many APIs. And that doesn't even take account the overuse of
unsafe APIs, or the non-integrated type-level safety tricks - if array
accesses were properly optimized, there should be a lot less need for
the
On Thu, Nov 27, 2008 at 1:20 PM, Claus Reinke [EMAIL PROTECTED]wrote:
What do those folks working on parallel Haskell arrays think about the
sequential Haskell array baseline performance?
Try using a fast array library like uvector? (With no serious overhead for
tuples too, fwiw)...
I
On Thu, Nov 27, 2008 at 8:29 PM, Simon Peyton-Jones
[EMAIL PROTECTED] wrote:
So this message is to ask you:
can you tell us about the most persuasive, fun application
you've encountered, for type families or functional dependencies?
I only just discovered functional dependencies
In all fairness, this basically forces you to say trust me
to the compiler for something that should be verifiable
statically. A typo results in a runtime error -- in a way,
this is worse than Perl.
Quasi-quotes are really the right answer but hardly simple
in this case...
--
_jsn
I'm developing an embedded DSL in Haskell (for exact real arithmetic
work, but that's irrelevant right now.) Among other things, the
language contains functions and application, as well as various
terms. In one iteration, the abstract syntax looked kinda like this
(in spirit, don't worry about
My work on lightweight session types (modeled after this year's ICFP
paper on the same subject) used type and data families extensively for
an elegant way of connecting communicating coroutines:
Empty types are used for sessions:
data Eps -- empty session
data a :?: s -- read an a followed by
Hi again,
a big thank you to all the people who offered us machines. I think we
should be fine now. World domination is just around the corner!
Roman
On 27/11/2008, at 18:45, Roman Leshchinskiy wrote:
Hi all,
we, the DPH team, are at the moment in the very unfortunate
situation of not
Claus Reinke:
What do those folks working on parallel Haskell arrays think about the
sequential Haskell array baseline performance?
You won't like the answer. We are not happy with the existing array
infrastructure and hence have our own. Roman recently extracted some
of it as a
Hello,
I have an experimental version of a package ~/FTP/Haskell/blah. Who I
point ghci ath this experimental package version so I can poke around?
Kind regards, Vasili
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On behalf of the many, many contributors, I am pleased to announce
that the
Haskell Communities and Activities Report
(15th edition, November 2008)
http://www.haskell.org/communities/
is now available from the Haskell Communities home page in PDF
Don Stewart wrote:
bulat.ziganshin:
Hello circ,
Thursday, November 27, 2008, 9:59:08 PM, you wrote:
So why not {hello: 1, there: 2} ?
mymap hello:1 there:2
where mymap implementation is left to the reader :)
I can't see the context of the beginning of this thread, but I've always
found:
On Fri, Nov 28, 2008 at 12:04 AM, Jules Bean [EMAIL PROTECTED] wrote:
I can't see the context of the beginning of this thread, but I've always
found:
fromList [(hello,1),(there,2)]
to be a relatively simple syntax, and still checked at compile time.
I never liked that. Too much syntax
51 matches
Mail list logo
