#640: hPutArray broken in doze
-+--
Reporter: [EMAIL PROTECTED]| Owner:
Type: bug | Status: closed
Priority: normal | Milestone:
Component:
On 2005-12-19, Malcolm Wallace [EMAIL PROTECTED] wrote:
Ross Paterson [EMAIL PROTECTED] writes:
No problem for me if you switch over at any time. But how about having
a separate repository for each library package?
Seconded.
Simon, any thoughts?
We could go about this one of two ways:
On Tue, Dec 20, 2005 at 03:50:02PM +, John Goerzen wrote:
On 2005-12-19, Malcolm Wallace [EMAIL PROTECTED] wrote:
Ross Paterson [EMAIL PROTECTED] writes:
But how about having a separate repository for each library package?
Seconded.
Simon, any thoughts?
Also, if the library
Simon Marlow [EMAIL PROTECTED] writes:
The aim is to eventually switch over to using darcs for our revision
control. The point of this message is to find out what constraints
people have that will affect when we can throw the switch.
One thing it occurs to me to ask is what will be happening
Malcolm Wallace [EMAIL PROTECTED] writes:
One thing it occurs to me to ask is what will be happening to CVS commit
messages, once the switchover to darcs happens?
rss2email is one solution. It's a python script that runs from cron, so you
won't have to worry about fiddling with darcs posthooks
can't we just make 'darcs send' send the patches to a public list so
people can see them that way as they are sent in.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
Malcolm.Wallace:
Simon Marlow [EMAIL PROTECTED] writes:
The aim is to eventually switch over to using darcs for our revision
control. The point of this message is to find out what constraints
people have that will affect when we can throw the switch.
One thing it occurs to me to ask
john:
can't we just make 'darcs send' send the patches to a public list so
people can see them that way as they are sent in.
I think the problem would be that we still want multiple developers to
darcs push over ssh, don't we? Rather than darcs sending patches to a
list, for a mainatiner to
On Wed, Dec 21, 2005 at 10:56:14AM +1100, Donald Bruce Stewart wrote:
john:
can't we just make 'darcs send' send the patches to a public list so
people can see them that way as they are sent in.
I think the problem would be that we still want multiple developers to
darcs push over ssh,
Dear Haskell folk,
A month or so ago I sent a message inviting suggestions about how to
make Haskell more open, and in particular how to make it easier for
Haskell users to contribute. There was quite a bit of traffic for a
while, which has died down now. Here's a quick summary of what I
Simon Peyton-Jones [EMAIL PROTECTED] writes:
* Gour suggested using a Content Management System (e.g. Drupal
http://drupal.org/) for haskell.org's front page.
I'm not familiar with Drupal, but at least EZ publish allows users to
convert pages to PDF - could be quite useful for documentation
Simon Peyton-Jones wrote:
* We don't have a plausible way of annotating GHC's user manual. One
suggestion is a tree of Wiki pages, each linked from the corresponding
section of the manual. We'd need an automated way to generate such a
tree, and it's not clear what to do when moving from one
On Tuesday 20 December 2005 11:13, Ketil Malde wrote:
On e.g. Wikipedia, articles are neutral pieces of text, and it's very
easy to improve it in any way. In Hawiki, I feel there is a large
degree of ownership attached to each paragraph, and it makes me a bit
wary of modifying it. Is it okay
Am Dienstag, 20. Dezember 2005 10:30 schrieb Simon Peyton-Jones:
[...]
My sense is that the main action item is
how to make haskell.org a better web site
(This is with no disrespect to John and Olaf, who have done a great job.
But I know they would be only too happy to share the
Hello,
I plan to develop a library in Haskell to draw charts, such as pie charts, bar charts and line charts, to visualize data.
Functionality will be similar to gnuplot, or chart libraries that
already exist for other languages. The chart library is for (part of)
my master-thesis project and it
On Tue, 2005-12-20 at 15:14 +0100, Gerbrand van Dieijen wrote:
Hello,
I plan to develop a library in Haskell to draw charts, such as pie
charts, bar charts and line charts, to visualize data.
Functionality will be similar to gnuplot, or chart libraries that
already exist for other
Hello everyone,
Thanks for the support and encouragement for Haskell Weekly News.
However, it's become apparent that HWN is something that I don't
really have time for right now.
So, I'd like to solicit anybody that would like to take over as HWN
editor/maintainer. The job basically requires
On Tue, Dec 20, 2005 at 03:14:29PM +0100, Gerbrand van Dieijen wrote:
I plan to develop a library in Haskell to draw charts, such as pie
charts, bar charts and line charts, to visualize data. Functionality
will be similar to gnuplot, or chart libraries that already exist for
other languages.
Maybe SVG is a suitable target/intermediate format. IIRC cairo (and
thus probably gtk2hs) can render it.
On 12/20/05, David Roundy [EMAIL PROTECTED] wrote:
On Tue, Dec 20, 2005 at 03:14:29PM +0100, Gerbrand van Dieijen wrote:
I plan to develop a library in Haskell to draw charts, such as pie
Gerbrand van Dieijen writes:
There are several graphic-libraries for Haskell, but I
couldn't find any specifically for drawing charts.
Functional MetaPost is not exactly a chart library, but I
guess it might be close enough to be useful for your
purposes:
http://cryp.to/funcmp/
Peter
WORKSHOP ON LOGICS FOR RESOURCE BOUNDED AGENTS
http://www.cs.nott.ac.uk/~nza/LRBA06/
7 - 11 August 2006
organized as part of the
European Summer School on Logic, Language and Information (ESSLLI 2006)
(http://esslli2006.lcc.uma.es/)
31 July - 11 August, 2005, Malaga, Spain
Workshop organizers:
SECOND CALL FOR PAPERS
ICLP'06
22nd International Conference on Logic Programming
Seattle, Washington, USA, 17-20 August, 2006
http://www.cs.uky.edu/iclp06/
Part of Fourth Federated Logic
Dear Colleague,
Please find enclosed the second call for papers for
Trends in Functional Programming (TFP) 2006.
My apologies for duplicate copies.
Best regards,
/Henrik
--
Henrik Nilsson
School of Computer Science and Information Technology
The University of Nottingham
[EMAIL PROTECTED]
%
18th European Summer School in Logic, Language and Information
ESSLLI 2006
31 July - 11 August, 2006, Malaga, Spain
http://esslli2006.lcc.uma.es
CALL FOR PAPERS
11th International Conference on
Algebraic Methodology and Software Technology, AMAST '06
colocated with MPC '06
Kuressaare, Estonia, 5-8 July 2006
***
FIRST CALL FOR PAPERS
International Workshop on Hybrid Logic 2006 (HyLo 2006)
Affiliated with LICS 2006
August 11, 2006, Seattle, USA
Hi,
I'm pleased to announce the first alpha release (I could call it a
developer's preview, but then I don't wear a suit) of HDBC.
HDBC is the Haskell Database Connectivity library. It is patterned
after Perl's DBI. I wrote it from scratch -- this is not a
reimplementation of HSQL -- because
Hello,
I have written a simple Daytime sever using network-alt[1] (I am sorry if this
is off topic, is it ?)
The server is:
server port = do
runStreamServer (nullStreamServer {handlerSS = sendDaytime, servSS = port})
sendDaytime = handlerWithHandle $ \hs sa - do
putStrLn (show sa)
On 20.12 21:52, Pupeno wrote:
It works, but I have the following problems:
When I run server 10013 from ghci, the prompt returns immediately and if I
do a query to that port I don't get anything, until I go and press enter on
ghci and the daytime is sent to the client. Like if the prompt was
Fellow Haskellers,
I am pleased to announce the first alpha release of Shellac, a shell building
library.
== What is it?
Shellac is a framework for building read-eval-print style shells.
Shells are created by declaratively defining a set of shell commands
and an evaluation function. Shellac
Fellow Haskellers,
I am pleased to announce the first alpha release of Lambda Shell, a shell
environment for evaluating terms of the pure, untyped lambda calculus.
The Lambda Shell
-==-
== What is it?
It is a feature-rich shell environment and command-line tool for
On Tuesday 20 December 2005 23:43, Einar Karttunen wrote:
Your problem is that the ghci prompt *is* blocking everything. ghci is
builded non-threaded. Ghci uses a blocking call to read the lines
which means that all other computations are stopped.
Ok, then pressing enter each time I want one of
robdockins:
Fellow Haskellers,
I am pleased to announce the first alpha release of Lambda Shell, a shell
environment for evaluating terms of the pure, untyped lambda calculus.
I've written a lambdabot plugin for lambda shell, it's running in
#haskell right now.
15:43 Cale:: @where
| (mild) culture shock here. It is typical for people in the Haskell
| community to view things in a rather principled way. A language
| tutorial is supposed to introduce /the language/. If you want to know
| how to compile or execute a Haskell program, well then, look at the
| appropriate
Folks,
How is one to interpret the following? I'm particularly interested in
the IO $ \ s - notatoin as I have never seen that before.
allocaBytes :: Int - (Ptr a - IO b) - IO b
allocaBytes (I# size) action = IO $ \ s -
case newPinnedByteArray# size s of { (# s, mbarr# #) -
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Paul Moore
I suspect that the reference documentation is fine, and the tutorials
are great, given what they are trying to do. But there is scope for a
very prominent Getting going document. Daniel's 40-second intro to
Haskell
Converting to Ptr Word8 and storables took about an hour and gave me
a more favorable profile.
COST CENTREMODULE %time %alloc
reverse_ Script.Endian 14.4 13.4
sequ Script.Pickle 14.39.3
read
joelr1:
Folks,
How is one to interpret the following? I'm particularly interested in
the IO $ \ s - notatoin as I have never seen that before.
allocaBytes :: Int - (Ptr a - IO b) - IO b
allocaBytes (I# size) action = IO $ \ s -
case newPinnedByteArray# size s of { (# s,
Simon Peyton-Jones wrote:
I'm certain there are hurdles, but I think on the whole they are
there by accident rather than design.
Why certainly. I have never seen any on-line community that had hurdles
by design. Hurdles are usually due to the fact that the people who
design the
Folks,
It looks like I successfully squashed my time leaks and moving my
serialization to Ptr Word8 got me as close to the metal as possible.
I'm still getting wierd results, though, and they look like a time leak.
ORANGE ALERT: 0s, 6s, SrvServerInfo
ORANGE ALERT: 0s, 8s, SrvServerInfo
Hal Daume III wrote:
Daniel -- can you tell me what was missing from YAHT that wasn't
sufficient for starting to use Haskell? It was really intended to solve
these problems, at least partially, so if it's missing out, I'd like to
fix it!
I haven't read it. I refuse to give out personal
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Daniel Carrera
Hal Daume III wrote:
Daniel -- can you tell me what was missing from YAHT that wasn't
sufficient for starting to use Haskell? It was really
intended to solve
these problems, at least partially, so if
Bayley, Alistair wrote:
From this page
http://haskell.org/hawiki/LearningHaskell
there's a link to the tutorial
http://www.isi.edu/~hdaume/htut/tutorial.pdf
which seems to make no informational demands.
I suggest updating this page:
http://www.haskell.org/learning.html
To point to
On 12/20/05, Daniel Carrera [EMAIL PROTECTED] wrote:
Hi all,
I've finished a first draft of what I call First steps in Haskell.
It's intended to be the very first thing a new user sees when they
decide to try out Haskell.
http://www.haskell.org/hawiki/FirstSteps?action=show
It's a bit
Daniel -- can you tell me what was missing from YAHT that wasn't
sufficient for starting to use Haskell? It was really intended to solve
these problems, at least partially, so if it's missing out, I'd like to
fix it!
I haven't read it. I refuse to give out personal information to
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of Daniel Carrera
Hi all,
I've finished a first draft of what I call First steps in Haskell.
It's intended to be the very first thing a new user sees when they
decide to try out Haskell.
Hello all,
Trying to learn Haskell here... In a Haskell tutorial I found a function
deciding if a number is prime:
--//--
prime n = not (factors 2 n)
factors m n | m == n = False
| m n = divides m n || factors (m+1) n
divides a b = (mod a b == 0)
--//--
Reference:
Hi Daniel!
How do I know that 38466629 is prime?
What about this: 38466629 = 31 x 1240859
Regards,
Jens
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
John Peterson wrote:
Add a type signature:
prime :: Integer - Bool
It's defaulting to Int and you're getting overflows
Thanks. Hmm... it's still not working.
Btw, I mis-reported the problem. The offending number is 38466629, which
is /not/ prime but the sample program reports as prime.
Jens Fisseler wrote:
What about this: 38466629 = 31 x 1240859
Yes, I wrote backwards. The offending program says that it's prime but
it's not.
Cheers,
Daniel.
--
/\/`) http://oooauthors.org
/\/_/ http://opendocumentfellowship.org
/\/_/
\/_/I am not over-weight, I am
Hi Daniel!
You just have to change the arguments of the 'mod'-function:
old: divides a b = (mod a b == 0)
new: divides a b = (mod b a == 0)
Regards,
Jens
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Daniel,
Could it be that the arguments to either divides or mod should be reversed?
Currently it seems to be testing whether the candidate prime (n)
divides the possible factor (m).
Or am I to tired to read the code straight?
Regards,
Maarten
On 12/20/05, Daniel Carrera [EMAIL PROTECTED]
On 12/20/05, Hal Daume III [EMAIL PROTECTED] wrote:
It seems a bit unfair to say that there are no good ways of learning
information about Haskell. Yes, I'm shamelessly plugging my own tutorial,
but that's because I think it's pretty good.
I agree, it is. I read it and found it a great help
-divides a b = (mod a b == 0)
+divides a b = (mod b a == 0)
On Dec 20, 2005, at 11:09 AM, Daniel Carrera wrote:
John Peterson wrote:
Add a type signature:
prime :: Integer - Bool
It's defaulting to Int and you're getting overflows
Thanks. Hmm... it's still not working.
Btw, I
Daniel Carrera [EMAIL PROTECTED] writes:
This function seems to produce a wrong result on the number 38466629
(warning, slow computation).
Here is an easier-to-find problem: it tells me the number 4 is prime.
Regards,
Malcolm
___
Haskell-Cafe
Hi guys,
I was wondering where I should get started in learing about
how to implement a haskell compiler?
Are there papers, wiki entries, or other things people think
would be helpful or should I just start looking at the
source of one of the compilers?
Robert Dockins wrote:
-divides a b = (mod a b == 0)
+divides a b = (mod b a == 0)
Oh, thanks. My program assumed one way to define 'divides' and the
example assumed the other.
When I wrote it I was thinking of (divides a) being a function that
tells me if the input divides 'a'.
Thanks!
Henning Thielemann wrote:
factors :: Integer - Integer - Bool
factors m n | m == n = False
| m n = divides m n || factors (m+1) n
Btw. I find the recursion harder to understand than the explicit
definition:
factors n = any (divides n) [2..(n-1)]
For what it's worth, I also
On Tue, 20 Dec 2005, Bayley, Alistair wrote:
...
There should be a getting started page which says:
- download and install this interpreter (Hugs or GHCi)
- run it, type these expressions, and see the results
- create a HelloWorld program, compile and execute.
- now start the following
You are braver than me, but I must confess I've had the same desire.
Here's a great place to start:
Simon Peyton Jones, David Lester, Implementing functional languages: a tutorial
http://research.microsoft.com/Users/simonpj/Papers/pj-lester-book/
It's long, (sort of old) and written in Miranda
Donn Cave wrote:
I understand that interactive mode can be useful, I'm just wondering
whether it belongs with Hello world in the scheme of things, or if
at that first step it would be better to focus on the language.
Let's compare sample instructions:
Interactive mode:
-
1.
I've finally performed test on amd64 and result is a same as on intel.
KMP always wins. So KMP is best suited for non indexed strings
and I guess should be used in library as prefered search/replace method.
This test favors straightforward search.
[EMAIL PROTECTED] myhaskell]$ time ./KMP
== So how do I write Hello, world? ==
Well, the first thing you need to understand that in a
functional language like Haskell, this is a harder
question than it seems. Most of the code you will write
in Haskell is purely functional, which means that it
returns the same thing every
On 20 Dec 2005 19:52:31 +0100, Peter Simons [EMAIL PROTECTED] wrote:
== So how do I write Hello, world? ==
Well, the first thing you need to understand that in a
functional language like Haskell, this is a harder
question than it seems. Most of the code you will write
in Haskell
Peter Simons wrote:
In my humble
opinion, it's unfortunate that many tutorials and
introductionary texts leave the impression that monadic code
would be something utterly different than normal Haskell
code. I feel it intimidates the reader by making a monad
appear like black magic, even though
From: Daniel Carrera [EMAIL PROTECTED]
Robert Dockins wrote:
-divides a b = (mod a b == 0)
+divides a b = (mod b a == 0)
Oh, thanks. My program assumed one way to define 'divides'
and the example assumed the other.
When I wrote it I was thinking of (divides a) being a
function that
You could also learn from the code and documentation of the various
implementations of Haskell: GHC, hugs, nhc, and
- YHC (http://www-users.cs.york.ac.uk/~ndm/yhc/) (an nhc derivatibe)
including a portable bytecode compiler
With Yhc, there is also a quite useful wiki at
On 17 December 2005 21:57, Ketil Malde wrote:
Simon Marlow [EMAIL PROTECTED] writes:
On 16 December 2005 10:05, Joel Reymont wrote:
I'm trying to restrict GHC to 800Mb of heap at runtime by passing in
+RTS -M800M, the machine has 1Gb of memory and top shows free
physical memory dropping
Daniel Carrera writes:
I'm scared of monads :) I really don't know what a monad
is.
Neither do I, but that doesn't mean that I can't use just
fine. ;-)
putStrLn :: String - World - World
That seems less scary.
Things become a lot clearer when you think about how to
print _two_ lines
On Tue, 2005-12-20 at 16:53 +, Daniel Carrera wrote:
Henning Thielemann wrote:
factors :: Integer - Integer - Bool
factors m n | m == n = False
| m n = divides m n || factors (m+1) n
Btw. I find the recursion harder to understand than the explicit
definition:
On Tue, 2005-12-20 at 20:07 +0100, Sebastian Sylvan wrote:
. . .
I'm still looking for a good *practical* tutorial that I could
recommend to newcomers.
IO, data types and QuickCheck in the very first chapter, I say! Real
program examples from the get go, and go into the theory on why this
Hi,
Hugs Interpreter onlySuitable for learning. You'll need GHC for
serious work.
This is putting Hugs down quite a bit. I personally prefer Hugs, and
use it for serious work (including developing a Haskell compiler, and
4 years of academic study and counting). About the only thing
Scherrer, Chad wrote:
module Main where
import A
import B
main = A.f B.f
module A where
f = ...
module B where
f = ...
in a single file. This example is straight from chapter 5 of the Report,
and no mention is made (that I could find) about modules needing to be
in
Daniel Carrera wrote:
Hello all,
I'm trying to write the simplest possible Haskell program, and I'm not
getting anywhere.
I have installed Hugs, GHC and GHCI. I want to run the following program:
fac :: Integer - Integer
fac 0 = 1
fac n | n 0 = n * fac (n-1)
$ ghci
Prelude let {
On Tuesday 20 December 2005 20:58, Peter Simons wrote:
Daniel Carrera writes:
I'm scared of monads :) I really don't know what a monad
is.
Neither do I, but that doesn't mean that I can't use just
fine. ;-)
putStrLn :: String - World - World
That seems less scary.
Things
Scherrer, Chad wrote:
Have you used Haskell's infix notation? It can help keep the order
straight for operators like these. You can write
a `mod` b -- instead of mod a b
a `divides` b -- instead of divides a b.
This can help with readability, too.
No, I haven't. That's neat, very neat.
On Mon, Dec 19, 2005 at 01:17:35PM -, Simon Peyton-Jones wrote:
| Actually, I have sometimes wished that the various interactive Haskell
| interfaces had the possibility to enter also declarations interactively
GHCi does.
ghci let f x = hello
ghci f True
True
But there's no
I still get timeouts with 5k threads. Not as often as with 1k before,
though.
On Dec 21, 2005, at 3:35 AM, Donald Bruce Stewart wrote:
It looks like with the 1000s of threads that get run, the problem is
just getting enough cpu time for each thread. All the solutions that
appear to work
On Tue, 20 Dec 2005, John Meacham wrote:
On Tue, Dec 20, 2005 at 10:36:36AM -0600, Creighton Hogg wrote:
I was wondering where I should get started in learing about
how to implement a haskell compiler?
Snip Absolute Awesomeness
Wow! That was a great response, with more references than
From: Bulat Ziganshin [EMAIL PROTECTED]
Reply-To: Bulat Ziganshin [EMAIL PROTECTED]
To: Branimir Maksimovic [EMAIL PROTECTED]
CC: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Substring replacements
Date: Tue, 20 Dec 2005 23:55:22 +0300
Hello Branimir,
Tuesday, December 20, 2005,
Hello Neil,
Tuesday, December 20, 2005, 11:52:51 PM, you wrote:
NM Hi,
Hugs Interpreter onlySuitable for learning. You'll need GHC for
serious work.
NM This is putting Hugs down quite a bit. I personally prefer Hugs, and
NM use it for serious work (including developing a Haskell
Hello S,
Friday, December 16, 2005, 6:32:47 AM, you wrote:
SKC Why not do this: name none of those modules Main.hs, and have an empty
SKC module Main.hs with only import MainDeJour and main =
SKC MainDeJour.main so you can just edit just that file.
ghc has option -main-is which is just what
82 matches
Mail list logo
