On Thu, Jun 05, 2003 at 09:08:03AM +1200, Tom Pledger wrote:
| I am sorry, I misunderstood the problem.
You're too modest. :-)
There *is* a solution in that direction.
Yes, I knew I could use a State monad or a Writer monad, but I thought
that it would be an overkill. Fold is more
On Fri, May 30, 2003 at 07:57:57PM -0700, [EMAIL PROTECTED] wrote:
The context:
http://www.haskell.org/pipermail/haskell-cafe/2003-February/003912.html
Furthermore, if GHCi can (after some prodding by the user) launch ghc
to compile a module and then load the resulting .o file in and
On Wed, Jun 04, 2003 at 02:46:59PM +0200, [EMAIL PROTECTED] wrote:
Now I want to print part of the record. What I would like to do is the
following
putStrLn $ concatMap show [a,c,d]
!!! bang !!!
So what I actually do is
putStrLn $ concat [show a, show c, show d]
Works, but a
On Wed, Jun 04, 2003 at 04:43:10PM +0200, [EMAIL PROTECTED] wrote:
Yes, this would work, thanks.
But let me extent my question: what if all the types would be in a
class FakeClass which has function specialID :: a - ID and
I would like to do
foo $ map specialID [a,b,c,d]
?
Well, in
On Wed, Jun 11, 2003 at 09:39:24AM -0700, Hal Daume III wrote:
It depends how much you mean like :). Usually whatever you would solve
using a while loop in an imperative language is solved with recursion in
Haskell.
The problem with directly having 'while' is that such a statement
depends
On Fri, Jun 13, 2003 at 10:34:53AM -0400, Dean Herington wrote:
`seq` guarantees only enough evaluation to determine whether its first
argument is bottom. That's why your commented code reads only the first
character. You need to evaluate the entire string. As someone else
suggested,
On Fri, Jun 13, 2003 at 10:57:21AM -0400, Dean Herington wrote:
Tomasz Zielonka wrote:
One can also use Strategies module that comes with GHC (in package
concurrent), for example:
Could you tell me more specifically where to find the Strategies module in
GHC? I couldn't find
On Thu, Jun 19, 2003 at 11:11:00AM +0200, mies wrote:
Hello, i'm a haskell newbie, and i'm trying to use arrays for counting
letters. But when I input a textfile of lets say 100KB the program uses
75 M of memory, and I really don;t have a clue where the problem could
be. I have searched
On Mon, Jul 28, 2003 at 12:56:04PM -0500, Tim Sweeney wrote:
Ben,
I live in a different universe, but over here I prefer to represent files
purely as memory-mapped objects. In this view, there is no difference
between a read-only file and an immutable array of bytes (a byte being a
natural
On Thu, Jul 31, 2003 at 05:15:33PM -0400, Derek Elkins wrote:
On Thu, 31 Jul 2003 13:18:40 -0700
Hal Daume [EMAIL PROTECTED] wrote:
so, my questions are: does this exist in some other form I'm not aware
of? is there something fundamentally broken about this (sorry for the
pun)? any
On Fri, Aug 29, 2003 at 05:39:09PM -0700, Hal Daume III wrote:
If you use Haskell for a purpose *other than* one of those listed below,
I'd love to hear.
In my job (website traffic measurement) the official programming language is
C++ (also PHP and Java, but I don't touch these) and AFAIK I am
On Wed, Sep 10, 2003 at 02:27:33PM +0200, Ketil Z. Malde wrote:
Shouldn't that rather be:
class HasWibble a where
wibble :: a - Int
set_wibble :: a - Int - a
class HasWobble a where ...
Or even:
class HasWibble a b | a - b where
wibble :: a - b
On Tue, Sep 30, 2003 at 03:52:50PM +0200, Christian Maeder wrote:
Hi,
For GHC (6.0.1)
main=interact id basically echoes every line of my input, whereas
main=interact show correctly waits for EOF before outputting something.
That's only because output to terminal is line buffered by
On Wed, Oct 01, 2003 at 04:42:51PM +0200, Christian Maeder wrote:
Can actually someone supply an implementation of something like interact
that does no pipelining for the argument id? Simply doing putStr !$ f
!$ s was not enough!
The simplest working but not necessarily correct solution
On Thu, Nov 13, 2003 at 05:19:28PM -0500, Wojtek Moczydlowski wrote:
Consider the following program:
module A where
import Control.Monad.State
f :: StateT Int IO ()
f = (sequence_ $ repeat $ return ())
t = runStateT f 0
When t is evaluated under ghci or hugs, the program quickly
On Fri, Nov 14, 2003 at 12:22:00AM +0100, Tomasz Zielonka wrote:
There is more to it. Let's define
t2 :: IO ()
t2 = sequence_ $ repeat $ return ()
t2 behaves in the same way. However, if you compile the module with
GHC
with optimisations turned on, both t and t2 run in constant
On Thu, Nov 27, 2003 at 04:09:00PM -0300, andrew cooke wrote:
Hi,
If I compile and run the code below, the file foo contains 10 lines
of output (as I would expect), but the file bar contains just 9 -
the final line is missing. If I add a join, as in the comment, then
all 10 lines appear.
On Sat, Nov 29, 2003 at 11:10:57AM -0500, Wojtek Moczydlowski wrote:
(though it still bothers me that I don't have an answer yet to the
memory leak I posted some time ago)
If you are talking about StateT space leak, then I think I have given
you an answer. My guess was that it is a CAF leak.
On Mon, Dec 08, 2003 at 01:45:30PM -, Simon Marlow wrote:
On Sat, Nov 29, 2003 at 11:10:57AM -0500, Wojtek Moczydlowski wrote:
(though it still bothers me that I don't have an answer yet to the
memory leak I posted some time ago)
If you are talking about StateT space leak,
On Mon, Dec 08, 2003 at 02:24:51PM -, Simon Marlow wrote:
Just compiling the code (instead of running it in GHCi) is enough to
prevent CAFs from leaking.
Ah, I see the story is a bit different that I thought.
Please correct me I am wrong:
When I compiled the code with -O2 there was no
On Mon, Dec 22, 2003 at 07:15:32AM -0800, Hal Daume III wrote:
Let is part of an expression, whereas where is part of a declaration.
Your first program should be rejected, since lists can only be made up of
expressions. That is, the 'where' in example 1 *must* come after the
entire
On Tue, Dec 23, 2003 at 05:26:20PM +, Graham Klyne wrote:
Throughout this period, I've been accumulating some notes about some things
that I found challenging along the way. The notes are not organized in any
way, and they're certainly not complete. I've published them on my web
site
On Thu, Dec 25, 2003 at 02:53:00PM -0500, S. Alexander Jacobson wrote:
I must say, this sort of reply is EXTREMELY DISTURBING.
Why are you shouting?
I find your reply EXTREMELY UNHELPFUL.
It is ridiculous that one needs to get so intimate
with implementation issues just to read a file!
Its
On Tue, Dec 30, 2003 at 07:21:08AM -0600, Scott wrote:
Why does Haskell have no continuations?
(http://www.haskell.org/hawiki/CoMonad)
See http://www.haskell.org/hawiki/MonadCont
BTW, the factorial example on
http://www.haskell.org/hawiki/MonadicContinuationPassingStyle
seems rather
On Tue, Dec 30, 2003 at 10:31:57PM -0500, [EMAIL PROTECTED] wrote:
G'day all.
Quoting Tomasz Zielonka [EMAIL PROTECTED]:
BTW, the factorial example on
http://www.haskell.org/hawiki/MonadicContinuationPassingStyle
seems rather pointless to me, because it doesn't use any methods
On Thu, Jan 08, 2004 at 09:06:44AM -0800, Hal Daume III wrote:
is there a function, related to getProgName, which returns the (absolute)
path to the current program?
A non-portable Linux solution:
System.Posix.readSymbolicLink /proc/self/exe
Best regards,
Tom
--
.signature: Too many
On Thu, Jan 08, 2004 at 07:02:04PM +0100, Tomasz Zielonka wrote:
On Thu, Jan 08, 2004 at 09:06:44AM -0800, Hal Daume III wrote:
is there a function, related to getProgName, which returns the (absolute)
path to the current program?
A non-portable Linux solution
On Wed, Jan 07, 2004 at 07:30:35PM +0100, Tomasz Zielonka wrote:
On Wed, Jan 07, 2004 at 05:41:04PM +0100, Wolfgang Jeltsch wrote:
Hello,
does Data.Set.mkSet run in linear time when applied to a sorted list?
No, at least not in the version from GHC 6.0. This implementation is
based
On Tue, Jan 13, 2004 at 12:44:10PM +0100, Stefan Holdermans wrote:
Hi,
I'm using the Parsec library to parse strings for a small experimental
language. I'd like to decorate each node in the abstract syntax tree with
a pair (Int, Int) that represents the line and column number in the
Hello!
I've used Haskell to create various command-line utitities for unix-like
systems. In the process I developed a simple yet powerful and flexible
technique for processing program options.
What you can read below is my unfinished attempt at writing an article
about it. The current form is
On Mon, Jan 19, 2004 at 02:17:42PM +, Alastair Reid wrote:
On Sunday 18 January 2004 15:42, Tomasz Zielonka wrote:
[much explanation of his option processing approach elided]
Interesting technique - lots of cool ideas there.
Thanks :-)
I too find getOpts to be a great base but have
On Sun, Feb 08, 2004 at 09:36:16PM +0100, Volker Wysk wrote:
Features
Command Line Arguments Parser
HsUnix has facilities for managing command line arguments, which are
(hopefully) easier to use than the GHC library GetOpt. Command line
arguments are described in lists
On Mon, Feb 09, 2004 at 11:07:39AM -0500, Andrew Pimlott wrote:
-e errexit
Exit immediately if any untested command fails in non-interactive
mode.
It doesn't work.
Well, it works as much as it can... better something than nothing.
#!/bin/sh -e
cat nosuchfile | echo
On Mon, Mar 08, 2004 at 12:32:21PM +0100, Christian Maeder wrote:
Yes, I support this proposal.
So do I.
Maybe the documentation to the 0rdered lists section can be improved.
Set.toAscList is not really necessary as it is the same as Set.toList.
In order to be a proper function, the
On Fri, Mar 26, 2004 at 01:43:25PM +0100, Janis Voigtlaender wrote:
Hello,
probably a trivial question: Is there a type in Haskell that contains
only the undefined value _|_?
I guess I can help myself out using newtype:
newtype T = T (forall a. a)
This is not Haskell 98.
but would
On Fri, Mar 26, 2004 at 01:56:04PM +0100, Tomasz Zielonka wrote:
I don't know if you can have both 'no newtype' and 'haskell 98'
satisfied.
Ross Paterson provided a solution using data.
Best regards,
Tom
--
.signature: Too many levels of symbolic links
On Fri, Apr 23, 2004 at 03:32:54AM +0200, Sebastian Sylvan wrote:
First you need to parse the expression into a Haskell data type. For
this I would recommend Parsec (see Haskell.org). The Haskell data type
would be something like
data Expr = AtomD Double | AtomI Integer | Add Expr Expr |
On Thu, Apr 29, 2004 at 06:27:32PM -0500, [EMAIL PROTECTED] wrote:
Hi,
While writing monad programs, I sometimes want to do a return as it is in
imperative program. i.e.,
do{return 1; return 2} is same as return 1
Is this possible at all?
Someone already proposed an Error monad, but I
On Sat, May 15, 2004 at 09:30:47PM +0100, Malcolm Wallace wrote:
I believe this to be a reasonably complete and correct implementation,
and have tested it on some non-trivial examples from the standard
libraries (e.g. Foreign.Storable and HOpenGL). Nevertheless, there
will be bugs and I
On Mon, May 17, 2004 at 11:11:52AM -0400, Gregory Wright wrote:
When I run the real program or the attached sample program I get the
error
Fail: ios.hs:50: Missing field in record construction Main.sigPriority
(This is using GHC-6.2.1 on Mac OS X 10.3.3 built from darwinports.)
I don't
On Mon, May 17, 2004 at 05:22:02PM +0200, Tomasz Zielonka wrote:
I think you should change ,,Signature'' in lines 50, 56 to
,,peSig event''. Right now you are using record construction,
not update.
,,(peSig event)'' to be precise.
Tom
--
.signature: Too many levels of symbolic links
On Fri, Jun 11, 2004 at 01:23:11PM +0200, Tom Hofte wrote:
I want to have a function that unpack an IO.
I should have the type: IO a - a.
Is this possible?
There is unsafePerformIO, but before you use it, think - do you
really, really want to use it and you really, really know what the
On Fri, Jun 18, 2004 at 11:17:52AM +0200, Peter Simons wrote:
Tomasz Zielonka writes:
http://cryp.to/hsdns/
You stole my project's name!
I have to admit that I am uncertain whether you are kidding
or whether this is a serious complaint, but in case of the
latter, I'll change
On Tue, Aug 24, 2004 at 07:35:46PM +0100, Simon D. Foster wrote:
I'm trying to implement an extensible XML De/Serializer in Haskell for
use with SOAP and XML Schema (using the Haskell XML Toolbox). The idea
is you have a type-class, which is instantiated for each type you want
to
On Wed, Aug 25, 2004 at 01:54:08PM +0100, Simon D. Foster wrote:
On Wed, 2004-08-25 at 08:39, Tomasz Zielonka wrote:
- snip -
I hope that helps,
Best regards,
Tom
That method works perfectly! Thank you so much! I assume there is no way
of achieving this without overlapping
On Wed, Aug 25, 2004 at 04:14:48PM +0100, Simon D. Foster wrote:
I think I jumped the gun it a bit; it almost works, but when I try to
declare a serializer for a type with several parts e.g.
data Person = Person PackedString PackedString Int
instance (Hook Person t) = Serializer Person t
On Wed, Aug 25, 2004 at 08:38:51PM +0100, Simon D. Foster wrote:
Ok then, well it looks like this method is going to very cumbersome to
use; for example a context for a reasonably simple complex data-type
would be;
(Hook Element t, Hook Bool t, Hook [ERS] t, Hook (Selection ERS) t, Hook
ERS
On Fri, Aug 27, 2004 at 06:24:10PM +0200, Ketil Malde wrote:
Yes, that's true, a nonexisting file name should cause it to terminate
before output is complete, I guess. It's slightly irrelevant, though,
because the problem isn't the laziness in Haskell, but the laziness in
the operating
On Fri, Aug 27, 2004 at 10:26:51AM -0400, Michael Manti wrote:
I recognize that I'm far out of my depth here--both in Haskell and in
mathematics--but I'll ask anyway. In what ways are dependent types
(http://haskell.org/hawiki/FunDeps,
http://www.cse.ogi.edu/~mpj/pubs/fundeps.html)
Hello!
In my master's thesis I am dealing with a complicated case of pretty
printing / unparsing. There are side effects, context dependency,
unparsing to two different languages (two SQL dialects). To manage
this complexity, I use a couple of ,,design patterns''.
One of them is about giving a
On Fri, Nov 05, 2004 at 07:03:06PM +, MR K P SCHUPKE wrote:
You don't want stdin/stdout/stderr?
Also these are only available in the IO monad...
No, they are available outside the IO monad, only you can't do
anything useful with them. Well, you can show them!
without breaking
On Mon, Nov 15, 2004 at 12:31:33PM +, Keean Schupke wrote:
Easy:
Here, with labelled instances you would write:
show ShowHex 27
instead you write:
show (ShowHex 27)
What about Ints buried deep in more complicated data structures:
show ShowHex [[1, 2, 3], [4]]
vs.
On Tue, Nov 23, 2004 at 08:50:45PM -0800, John Meacham wrote:
Atom.hs from ginsu..
This is perhaps the best example, and an incredibly useful piece of code
for anyone struggling with space problems out there.
it provides
data Atom = ... (abstract)
instance Ord Atom
instance
On Wed, Nov 24, 2004 at 08:53:47AM +0100, Lennart Augustsson wrote:
Well, I don't. unsafePerformIO is an extension that is very much
against the spirit of Haskell. Haskell with it does not have the
properties I want. So I don't use it. :)
I hope 'it' means unsafePerformIO, not Haskell :)
I
On Thu, Nov 25, 2004 at 07:52:43PM +0100, Lennart Augustsson wrote:
As I'm sure you have gathered from all the answers you can't have the
latter and keep Haskell pure. But there is an interesting alternative
(at least theoretically). You could have a function like
mkCatchJust :: IO
On Mon, Dec 06, 2004 at 10:24:06AM -0500, Michael Walter wrote:
Hi,
is there a way to force the full evaluation of a value (unless seq,
which only brings the term to WHNF)?
In my case, I have an algebraic data type Foo,
and I would like to catch the exceptions that will occur during the
On Fri, Jan 07, 2005 at 06:27:03PM -0500, Robert Dockins wrote:
This means your program fails to terminate, and the runtime detected it
(it can't always). It is often caused by forgetting to code a base case
in a recursive function, or by getting it wrong. Without some code, it
is hard to
On Tue, Jan 11, 2005 at 06:30:02PM -0500, Stefan Monnier wrote:
case t of
(x, y, z) - (x, y, z+1)
How would you do:
case t of
(x, y, z, a, b, c) - (x+1, y, z, a, b, c+2)
would you allow:
case t of
(ctx @ x, _, _, _, _, ctx @ c) - ctx (x+1) (c+2)
I
On Wed, Jan 12, 2005 at 01:02:43AM +0100, Stefan Holdermans wrote:
Furthermore, I think with this syntax, it is just too easy to get
wrong. Maybe I'm mistaken, but, to illustrate, I believe there's even
an error in the very examples given by you:
after:
case t of
(_, _, ctx @
Below are corrections of embarassing mistakes in my examples, pointed out by
Wolfram and Stefan Holdermans.
On Tue, Jan 11, 2005 at 11:12:04PM +0100, Tomasz Zielonka wrote:
before:
case t of
(x, y, z) - (x, y, z+1)
after:
case t of
(_, _, ctx @ z) - ctx z
On Tue, Jan 11, 2005 at 10:12:06PM -0500, [EMAIL PROTECTED] wrote:
Tomasz Zielonka [EMAIL PROTECTED]
proposed an interesting kind of ``second-order as-patterns''
that are ``safe'' from the usual problems of second-order matching
by virtue of fixing (at least) the spine
of the images
On Wed, Jan 12, 2005 at 11:47:51AM +, Malcolm Wallace wrote:
Malcolm Wallace [EMAIL PROTECTED] writes:
Marcus Mohnen, Context Patterns, Proceedings of IFL'96 (LNCS 1268)
Marcus Mohnen, Context Patterns II, Proceedings of IFL'97 (LNCS 1467)
There is a web page too, with an
On Mon, Jan 17, 2005 at 04:23:17PM -0500, Jim Apple wrote:
See subject. It seems that it would be constant through execution, and
so could be just [String].
I like to think that pure functions don't change between executions.
getArgs :: [String] would certainly break that.
Best regards,
On Tue, Jan 18, 2005 at 01:31:19AM -0500, Jim Apple wrote:
Tomasz Zielonka wrote:
I like to think that pure functions don't change between executions.
I'd like to think they wouldn't change within executions. Is there a
pure haskell way to check the value of a function between exections
On Tue, Jan 18, 2005 at 08:12:42AM -0800, Ben Rudiak-Gould wrote:
Even if you want to disallow explicit recompilation (and how do you define
compilation denotationally?), an automatic rollout of a new version of Hugs
could lead to successive invocations of a script using different values of
On Fri, Jan 28, 2005 at 10:01:33AM -0500, Jacques Carette wrote:
The previous post on record syntax reminded me of some 'problems' I had
noticed where Haskell and mathematics have a (deep) usage mismatch.
First, consider a syntax for other component-wise function application?
For example,
On Mon, Feb 14, 2005 at 12:36:22PM +0100, Remi Turk wrote:
Now that this topic is brought up...
Occasionally I would need to define recursive datatypes
using an explicit fixed-point operator, such as:
data Fix f = In (f (Fix f)) deriving (Show, Eq)
data L a x = Nil | Cons a
On Mon, Feb 21, 2005 at 02:39:54PM -0500, S. Alexander Jacobson wrote:
Data.FiniteMap has functions keysFM_GE and eltsFM_GE which return the
keys or elts of pairs greater than or equal to the provided key.
These functions do not appear to be in the new Data.Map.
Is this intentional?
On Thu, Apr 14, 2005 at 01:54:15AM -0700, Ashley Yakeley wrote:
Was there a call for HCAR contributions on this list? Did I miss it?
The last one I can find in my mail archives was on Nov 10, 2004.
Best regards
Tomasz
___
Haskell mailing list
On Sun, Apr 24, 2005 at 06:01:34PM +0200, Alexandre Weffort Thenorio wrote:
outputLine keyno key orgFile = do
-- Some code that modifies
second line here
newHexFile - openFile
newint.hex WriteMode
On Wed, Apr 27, 2005 at 09:16:16PM +1000, Andre Pang wrote:
data RankN = RankNEq (forall a. Eq a = a - a - Bool)
| RankNOrd (forall a. Ord a = a - a - Bool)
data Exists = forall a. Eq a = ExistsEq (a - a - Bool)
| forall a. Ord a = ExistsOrd (a - a - Bool)
The two
On Fri, Jul 08, 2005 at 09:55:48PM +0200, Wolfgang Jeltsch wrote:
As part of my diploma thesis, I'm working on a small collection of modules
which provides safe I/O interleaving. The key point is to split the state of
the world since I/O on different parts of the world can be interleaved
On Wed, Jul 13, 2005 at 08:50:21PM +0200, Mads Lindstr?m wrote:
I am trying to learn Meta Haskell. One thing I want to do is create an
identity function. It should get a type constructor as input and return
the same type constructor as output. It should be possible to do:
$(idDecl data Foo
On Fri, Jul 15, 2005 at 09:10:16AM +0100, Axel Simon wrote:
I agree with Frederik since I've been bitten by that rule before.
Defining a single function like so:
let a very long definition of a = and the body has to be here
is a very long application to
On Thu, Jul 28, 2005 at 08:01:17PM +0200, Diego y tal wrote:
I understand that this is caused by the lazyness,
No, it is caused by mixing laziness with side-effects, which happens
when you use getContents/readFile.
that doesn't evaluate the expression x - readFile fEntrada until
it's
On Sun, Aug 07, 2005 at 08:26:07PM +0200, mt wrote:
the first check5 is ok and return Nothing while the second check5' will raise
an Exception: Non-exhaustive patterns (which is what i've expected).
the sentence there is nothing magic with do with its reason are important
for me to
On Sun, Sep 11, 2005 at 01:48:16AM -0400, Cale Gibbard wrote:
On 10/09/05, Frederik Eaton [EMAIL PROTECTED] wrote:
These are good arguments, and I think this is a good direction for the
discussion, should it continue.
Despite having a fairly mathematical background, I don't really care
On Fri, Sep 16, 2005 at 05:40:04PM +0100, Glynn Clements wrote:
Every other language (including Haskell) tends to have the problem
that eventually you will encounter a situation where the language's
own worldview gets in the way.
Are you sure that lisp's worldview never gets in the way?
On Fri, Sep 16, 2005 at 02:37:14PM -0700, Michael Vanier wrote:
But were they as efficient?
If some code is equivalent to macro expansion then the compiler should
be able to optimize it to the same extent as a macro.
The beauty of macros is that a lot of things can be done with no
run-time
On 9/19/05, Simon Marlow [EMAIL PROTECTED] wrote:
The GHC Team is pleased to announce a new patchlevel release of GHC.This release contains a significant number of bugfixes relative to6.4, so we recommend upgrading.No library APIs have changed, so codethat was working with
6.4 should continue to
On 9/29/05, Yitzchak Gale [EMAIL PROTECTED] wrote:
While checking for floating-point overflow andunderflow conditions, I tried to create a somewhatreliable cross-platform Infinity with the literal1e10.When GHC 6.4.1 reads this literal, it goes into a
deep trance and consumes huge amounts
On Wed, Nov 09, 2005 at 10:52:51AM +0100, Christian Maeder wrote:
Aaron Denney wrote:
I hit Submit response and view previous responses and it says
Unspecified action and a Try again... hyperlink.
I have the same problem even with our own cgi-program based on WASH and
ghc-6.4.1
Does it
On Wed, Nov 09, 2005 at 04:55:46AM -0500, Cale Gibbard wrote:
It seems that if you keep trying to fill out the form, you will
eventually succeed. If someone finishes filling out the form between
when you start filling it out and when you finish, then the
checkboxes/dropdowns will have been
On Wed, Nov 09, 2005 at 11:02:04AM +0100, John Hughes wrote:
Thank you, that explains it. A WASH subtlety, caused by using unsafe IO
to read the tools and country lists. Should now be fixed!
Ah, right, so the program doesn't change, only its data.
Best regards
Tomasz
On Wed, Nov 09, 2005 at 01:02:19PM +0100, Wolfgang Jeltsch wrote:
Only 2% find fglasgow-exts useful???
Only 2% consider it a tool or library.
I think that if John cares about getting reliable results, he should
take the results from this survey and prepare the next one already
having all the
On Tue, Nov 08, 2005 at 06:40:36PM +0100, Alberto Fuentes Rodriguez wrote:
Each card is represented with a Char (to make the structure smaller) and
then all the hands are a [[Char]]
in total the structure has a size of arround 20Mb.
Ok the complexity is high but why this program needs
On Fri, Nov 11, 2005 at 12:24:49PM +, Neil Mitchell wrote:
- It's very much work in progress, indeed the source code in the darcs
repository as of today is currently somewhat disfunctional as is in
between changes (hence why the Makefile is broken).
It may be a good idea to have yhc-stable
On Fri, Nov 11, 2005 at 03:12:40PM +, Duncan Coutts wrote:
I would tend to disagree. I think the combination of the mailing lists,
a wiki and the IRC channel cover most of our communication needs.
Personally I prefer to use mailing lists, but they have one disadvantage
- if you don't set up
On Fri, Nov 11, 2005 at 03:19:27PM +, Duncan Coutts wrote:
I cannot imagine that a couple of people is sufficient to review all recent
changes and therefore I don't think they do it this way. There are some
typical articles where screwing up happens often, so these articles might
On Fri, Nov 11, 2005 at 04:52:30PM +0100, Wolfgang Jeltsch wrote:
IMO, the best solution are newsgroups. What I dislike with web-based
communication (webmail, webforums) is that webbrowsing is not as flexible as
using a specialized software and that you are not free in choosing your
On Fri, Nov 11, 2005 at 05:00:52PM +0100, Tomasz Zielonka wrote:
How about an integrated newsgroup+mailinglist+forum. If we had a
two-way newsgroup+mailinglist integration, people could use it also
as a forum, for example through gmail.google.com.
Of course I meant groups.google.com
Best
On Sat, Nov 12, 2005 at 01:10:03PM -0800, Gregory Woodhouse wrote:
I ask because I'm very much a Haskell newbie, but have spent several
years developing interfaces for medical information systems based on
HL7, and am interested (among other things) in the possibilities of
using Haskell to
On Sat, Nov 12, 2005 at 01:10:03PM -0800, Gregory Woodhouse wrote:
I've been reading the article Tackling the Awkward Squad by Simon
Peyton Jones (and find it very readable and useful, BTW). I wonder if
the HTTP/1.1 server referred to in this article is available on the
web.
I think you
On Sat, Nov 12, 2005 at 01:10:03PM -0800, Gregory Woodhouse wrote:
am interested (among other things) in the possibilities of using
Haskell to develop safety critical systems.
I think it will be interesting for you that Galois, one of the top
Haskell companies, makes money on safety critical
On Sun, Nov 13, 2005 at 09:11:46PM +0100, Wolfgang Jeltsch wrote:
Which browser are you speaking about? I use Konqueror.
I don't know about Konqueror, but in Firefox you can quickly increase
or decrease the font size pressing Ctrl with + or -. This is a local
per-window, per-tab setting, so it
On Sun, Nov 20, 2005 at 08:54:35AM -0500, David Roundy wrote:
As an aside, what's responsible for the insanity of pattern matching record
fields being backwards? I'd bar = b to bind b to bar, not the other way
around... why should record pattern matching use '=' in a manner opposite
from the
On Sun, Nov 20, 2005 at 02:09:04PM -0500, David Roundy wrote:
[x,y,z]
[...]
R { field1 = x, field2 = y, field3 = z }
I think this is very consistent.
I see, you're right that it's consistent, but I still don't like the use of
'=' in this scenario.
I understand you. I had the
On Tue, Nov 22, 2005 at 05:05:17PM +1100, Mun Hon Cheong wrote:
Frag is a 3D First Person Shooting game.
I would be nice if you could put some screenshots somewhere.
Best regards
Tomasz
___
Haskell mailing list
Haskell@haskell.org
On Thu, Nov 24, 2005 at 05:52:23PM +0100, Jan van Eijck wrote:
Like so:
generatePs :: (Int,[Int]) - [[Int]]
generatePs (n,[]) = [take n (repeat 1)]
generatePs (n,(x:xs)) =
(take n (repeat 1) ++ (x:xs)) : generatePs (pack (x-1) ((n+x),xs))
where
pack :: Int -
On Sun, Dec 11, 2005 at 11:14:46PM +, Paul Johnson wrote:
From the README:
Ranged sets allow programming with sets of values that are described
by a
list of ranges. A value is a member of the set if it lies within one of
the ranges. The ranges in a set are ordered and
1 - 100 of 644 matches
Mail list logo
