On 13 October 2005 18:57, Tomasz Zielonka wrote:
On 10/11/05, Tomasz Zielonka [EMAIL PROTECTED] wrote:
On 10/11/05, Simon Marlow [EMAIL PROTECTED] wrote:
Ok, let's close this bikeshed. Someone want to send us a patch?
I will try to do this
On which branch of GHC should I be working?
Dear GHC users
This is an appeal for help with the
libraries/Win32 package [on Windows, obviously]
libraries/HGL package [on Windows]
Here's the situation:
* Win32 provides access to the native Windows API, which is obviously
very useful for people writing Haskell on
On Fri, 2005-10-14 at 09:20 +0100, Simon Peyton-Jones wrote:
Dear GHC users
This is an appeal for help with the
libraries/Win32 package [on Windows, obviously]
libraries/HGL package [on Windows]
Here's the situation:
* Win32 provides access to the native Windows API,
Hi,
I've a problem, I'm using this code on GHC compiler version 6.4.1:
--- BEGIN ---
module Main where
import System.IO
import Network
main = withSocketsDo $ do
handle - connectTo localhost ( PortNumber 8080 )
hSetBuffering handle LineBuffering
hClose handle
--- END ---
The problems is that
Hi all,
I have a program that uses hash tables to store word counts. It can
use few, large hash tables, or many small ones. The problem is that
it uses an inordinate amount of time in the latter case, and
profiling/-sstderr shows it is GC that is causing it (accounting for
up to 99% of the
It looks odd to me, because the service is not particularly meaningful to the transport, and thus not a crucial piece of
information. Unless I am missing something, this could be a
bug in the Network module.
You may want to try the lower-level stuff from Network.Socket instead.
Cheers,
Dinko
On
On Friday 14 Oct 2005 3:17 pm, Ketil Malde wrote:
Hi all,
I have a program that uses hash tables to store word counts. It can
use few, large hash tables, or many small ones. The problem is that
it uses an inordinate amount of time in the latter case, and
profiling/-sstderr shows it is GC
Am Freitag, 14. Oktober 2005 11:28 schrieb Duncan Coutts:
[...]
Well for the special case of the SOE library I have a re-implementation
of it based on Gtk+/cairo which should work on all platforms. [...]
Which additional stuff would one have to install on an e.g. off-the-shelf SuSE
Linux
On Oct 14, 2005, at 10:17 AM, Ketil Malde wrote:
Hi all,
I have a program that uses hash tables to store word counts. It can
use few, large hash tables, or many small ones. The problem is that
it uses an inordinate amount of time in the latter case, and
profiling/-sstderr shows it is GC
Thanks for the reply.
I don't know if the problem is the same, but when I try to run this code:
main = withSocketsDo $ do
host - getHostName
putStrLn host
the getHostName throws this exception:
getHostName: failed (Successful WSAStartup not yet performed
(WSANOTINITIALISED))
:( I'm
On Fri, Oct 14, 2005 at 04:29:37PM +0100, Simon Marlow wrote:
I'm not certain that this is your problem, but hash tables are by
definition mutable objects, and mutable objects don't work too well with
generational garbage collection, GHC's in particular. Basically every
GC, even the minor
By chance are you statically linking the program?
if you statically link a program on linux (and some other systems), it
cannot look up hostnames, protocols, or passwd entries.
you can look up the protocol number in /etc/protocols and hardcode it
and use IP addresses rather than names and it
Hello Stephane,
Thursday, October 13, 2005, 11:24:30 AM, you wrote:
SB As someone who is not an academic researcher and not a student in CS,
SB I would like to express a personal opinion; we don't need a new
SB standard. To me, Haskell needs more libraries, more users (which means
SB more
Hello Sebastian,
Thursday, October 13, 2005, 4:09:55 PM, you wrote:
(I'm specifically interested in seeing SPJ's records proposal
included, and a new module system).
SS First of all I would like to urge the people who do end up working on
SS this to seriously consider replacing H98's
On Tue, Oct 11, 2005 at 05:25:24PM -0700, [EMAIL PROTECTED] wrote:
First we define the representation of a list as a fold:
newtype FR a = FR (forall ans. (a - ans - ans) - ans - ans)
unFR (FR x) = x
It has a rank-2 type. The defining equations are: if flst is a value
of a type |FR a|,
| In that context, how well-understood is the combination of
impredicative
| types via boxy types and a proper existential quantifier at the
moment?
| It's certainly something that has many uses in an industrial context.
Stephanie Weirich, Dimitrios Vytiniotis, and I are currently re-writing
our
In article [EMAIL PROTECTED],
John Meacham [EMAIL PROTECTED] wrote:
This is a proposal for a language extension which will hopefully mitigate the
issues holding back evolution of the standard prelude as well as provide
useful class abstraction capabilities in general.
I've certainly been
In article [EMAIL PROTECTED],
Philippa Cowderoy [EMAIL PROTECTED] wrote:
A lot of users would find Mappable more intuitive than
Functor for example, and the improved error messages might make it more
practical to call fmap map again.
And Simon PJ can at last rename Monad WarmFuzzyThing...
Hello everyone,
After the Dazzle presentation at the Haskell workshop, several people
have asked us whether the source code is available. There is the
possibility of commercialising Dazzle at some point in the future and
for that reason we don't want to give away all our algorithms.
Am Donnerstag, 13. Oktober 2005 12:22 schrieb John Meacham:
[...]
although perhaps
class alias FooBar a = (Foo a, Bar a) where ...
since the new name introduced usually appears to the left of an equals
sign.
Yes, exactly.
This also solves the problems of where to put new supertype
Dear Haskell folk
One of the interesting things about ICFP was the number of times GADTs
came up, either in papers or in discussions in the breaks. Francois's
invited talk was very inspiring, and that was just the beginning.
Stephanie and Dimitrios and I are now busy revising our wobbly-types
Am Donnerstag, 13. Oktober 2005 15:58 schrieb Udo Stenzel:
[...]
Further, if classes with no methods have no use currently, this universal
instance could be compiler generated whenever a class without methods is
declared.
This does mean that you want to treat classes without methods special,
Am Donnerstag, 13. Oktober 2005 15:43 schrieb Simon Peyton-Jones:
John
Replying just to you to avoid spamming everyone.
Hmm, you did write to the list as well...
[...]
I don't agree. What do you mean by distinct types? In H98 both of
these are ok:
f :: CD a = ty
f =
On Thu, Oct 13, 2005 at 05:53:15PM -0700, John Meacham wrote:
I have revised the proposal and put it on the web here:
http://repetae.net/john/recent/out/classalias.html
changes include a new, clearer syntax, some typo fixes, and a new
section describing how class aliases interact with
Right, forgot about seq there, but the point still holds that there
are a very limited number of functions of that type, and in
particular, the functions can't decide what to do based on the type
parameter 'a'.
- Cale
On 14 Oct 2005 05:49:27 -, [EMAIL PROTECTED]
[EMAIL PROTECTED] wrote:
On Fri, Oct 14, 2005 at 03:17:12AM -0400, Cale Gibbard wrote:
Right, forgot about seq there, but the point still holds that there
are a very limited number of functions of that type, and in
particular, the functions can't decide what to do based on the type
parameter 'a'.
actually, without
Hello Sebastian,
Thursday, October 13, 2005, 2:49:46 AM, you wrote:
SS I'm wondering what incremental and moderate extension means?
SS Does it mean completely backwards compatible or can it mean
SS completely new features including ones which subsume existing ones
SS (I'm specifically interested
Hello Stephane,
Thursday, October 13, 2005, 11:24:30 AM, you wrote:
SB As someone who is not an academic researcher and not a student in CS,
SB I would like to express a personal opinion; we don't need a new
SB standard. To me, Haskell needs more libraries, more users (which means
SB more
Hello Sebastian,
Thursday, October 13, 2005, 4:09:55 PM, you wrote:
(I'm specifically interested in seeing SPJ's records proposal
included, and a new module system).
SS First of all I would like to urge the people who do end up working on
SS this to seriously consider replacing H98's
Hello Simon,
Thursday, October 13, 2005, 1:42:24 PM, you wrote:
(I'm specifically interested in seeing SPJ's records proposal
included, and a new module system).
SM Highly unlikely, IMHO. A new revision of the Haskell standard is not
SM the place for testing new research, rather it's a clear
Cale Gibbard wrote:
As an example of this sort of thing, I know that there are only 4
values of type a - Bool (without the class context). They are the
constant functions (\x - True), (\x - False), and two kinds of
failure (\x - _|_), and _|_, where _|_ is pronounced bottom and
represents
On 10/13/05, Huong Nguyen [EMAIL PROTECTED] wrote:
Hi all,
I want to write a small functionto test whether an input is a String or not.
For example,
isString::(Show a) =a -Bool
This function will return True if the input is a string and return False if
not
Any of you have idea about
If I don't cast then how do I convert this code?
doubleToInts d = runST (
do arr - newDoubleArray (1,2)
writeDoubleArray arr 1 d
i1 - readIntArray arr 1
i2 - readIntArray arr 2
return (i1,i2))
Or can I just read an array of ints from the double array using the
Em Qui, 2005-10-13 às 09:47 +0100, Bayley, Alistair escreveu:
-
*
Confidentiality Note: The information contained in this message, and any
attachments, may contain confidential and/or
So this is essentially a parsing problem. You want a user to be able
input a string and have it interpreted as an appropriate data value. I
think you may want to look at the Parsec library
(http://www.cs.uu.nl/~daan/parsec.html). I don't think the direction
you are heading will get the
Joel Reymont [EMAIL PROTECTED] writes:
If I don't cast then how do I convert this code?
Uh, what is wrong with divMod?
*Main Data.Word (100::Word64) `divMod` (2^32)
(2,1410065408)
doubleToInts d = runST ( [...]
This will only give you a headache. :-)
-k
--
If I haven't seen
From: Marco Tulio Gontijo e Silva [mailto:[EMAIL PROTECTED]
Em Qui, 2005-10-13 às 09:47 +0100, Bayley, Alistair escreveu:
*
Confidentiality Note: The information contained in this message blah blah
blah
Is this kind of notice
Am Donnerstag, 13. Oktober 2005 13:39 schrieb Stephane Bortzmeyer:
[...]
Regexps and XML are, IMHO, also must haves.
By the way, it should be possible to handle regular expressions in an
Haskell-like way. I always couldn't understand why one has to write regular
expressions as strings which
On Fri, Oct 14, 2005 at 04:20:24PM +0200,
Wolfgang Jeltsch [EMAIL PROTECTED] wrote
a message of 23 lines which said:
By the way, it should be possible to handle regular expressions in
an Haskell-like way.
If you like so, but as one more possibility, not as the only way.
I always couldn't
On Fri, Oct 14, 2005 at 04:20:24PM +0200,
Wolfgang Jeltsch [EMAIL PROTECTED] wrote
a message of 23 lines which said:
alpha = ('A' `to` 'Z') ||| ('a' `to` 'z')
If you intend to seriously specify a new language for regexps, please
consider Unicode. There are more letters than A to Z...
On Fri, 14 Oct 2005, Stephane Bortzmeyer wrote:
On Fri, Oct 14, 2005 at 04:20:24PM +0200,
Wolfgang Jeltsch [EMAIL PROTECTED] wrote
a message of 23 lines which said:
By the way, it should be possible to handle regular expressions in
an Haskell-like way.
If you like so, but as one more
joel reymont wrote:
I don't understand the syntax needed to create a new double or float
array with newArray from Data.Array.MArray. I also don't yet
understand how to cast that double array to read ints from it.
doubleToInts d = runST (
do arr - newDoubleArray (1,2)
On Fri, Oct 14, 2005 at 03:34:33PM +0100,
Jon Fairbairn [EMAIL PROTECTED] wrote
a message of 37 lines which said:
Because the language used inside these strings is standard,
multi-language, widely used and documented?
10,000 lemmings can't be wrong?
Right, disregard ASCII and specify
Joel Reymont [EMAIL PROTECTED] writes:
I must be missing something because I don't think the code below
converts a double.
Yes, sorry, my bad. I was (and is) confused about what you wanted to
do.
-k
--
If I haven't seen further, it is by standing in the footprints of giants
I'm just trying to replicate the example using the fresh syntax
that does not use readDoubleArray, readIntArray, etc.
On Oct 14, 2005, at 4:32 PM, Ketil Malde wrote:
Yes, sorry, my bad. I was (and is) confused about what you wanted to
do.
--
http://wagerlabs.com/
On 2005-10-14 at 16:56+0200 Stephane Bortzmeyer wrote:
On Fri, Oct 14, 2005 at 03:34:33PM +0100,
Jon Fairbairn [EMAIL PROTECTED] wrote:
Because the language used inside these strings is standard,
multi-language, widely used and documented?
10,000 lemmings can't be wrong?
Right,
Regexps and XML are, IMHO, also must haves.
By the way, it should be possible to handle regular expressions in an
Haskell-like way.
Harp? :-)
http://www.cs.chalmers.se/~d00nibro/harp
/Niklas
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Hi Huong,
attached you find a small program for parsing values of various (data)
types. It uses a generalized algebraic data type for representing types
and a universal data type for representing values. The parser itself is
rather simple-minded: it builds on Haskell's ReadS type.
I don't know
On 2005-10-13, Stephane Bortzmeyer [EMAIL PROTECTED] wrote:
On Thu, Oct 13, 2005 at 11:29:57AM +,
Robin Green [EMAIL PROTECTED] wrote
a message of 22 lines which said:
... and, in the case of the Standard Prelude section, or equivalent,
a specification of well-understood functions
On Thu, Oct 13, 2005 at 02:09:55PM +0200, Sebastian Sylvan wrote:
Okay then. Consider this my contribution to the discussion.
First of all I would like to urge the people who do end up working on
this to seriously consider replacing H98's records system. I may be
wrong but the impression I get
On Fri, Oct 14, 2005 at 07:15:11PM +, Aaron Denney wrote:
On 2005-10-13, Stephane Bortzmeyer [EMAIL PROTECTED] wrote:
On Thu, Oct 13, 2005 at 11:29:57AM +,
Robin Green [EMAIL PROTECTED] wrote
a message of 22 lines which said:
... and, in the case of the Standard Prelude
On Thu, Oct 13, 2005 at 10:42:24AM +0100, Simon Marlow wrote:
On 12 October 2005 23:50, Sebastian Sylvan wrote:
(I'm specifically interested in seeing SPJ's records proposal
included, and a new module system).
Highly unlikely, IMHO. A new revision of the Haskell standard is not
the place
On Fri, Oct 14, 2005 at 03:34:33PM +0100, Jon Fairbairn wrote:
On 2005-10-14 at 16:25+0200 Stephane Bortzmeyer wrote:
On Fri, Oct 14, 2005 at 04:20:24PM +0200,
Wolfgang Jeltsch [EMAIL PROTECTED] wrote
a message of 23 lines which said:
By the way, it should be possible to handle
Before you read any more, let me just say I'm fairly new to Haskell, so forgive
me if this is really basic stuff.
Hi there, I'm just wondering if there is a command for emptying a list?
Also, is there any way to incorporate list operations (concatenation in
particular) in a do-statement on
54 matches
Mail list logo
