On Wed, 2006-08-02 at 10:10 +0200, Stephane Bortzmeyer wrote:
From the excellent programming blog Joel on software, a very good
text if you need to convince Java or C programmers that functional
programming is a A Good Thing.
Probably all the readers of this list will find it brings nothing
On Thu, 2006-02-23 at 21:04 +0100, Marcin 'Qrczak' Kowalczyk wrote:
Simon Marlow [EMAIL PROTECTED] writes:
The main difference is that I'm doing away with parentheses, commas, and
export specifiers, and using layout and full declaration syntax instead.
(I don't really want to discuss this
On Wed, 2006-01-18 at 13:38 -0500, Sam Goldman wrote:
Sorry if this is too off-topic for this list.
I'm a hobbyist programmer and I've recently become interested in lazy
functional languages, particularly the optimization strategies available
to them during compilation. I've been playing
On Mon, 2005-11-07 at 21:32 -0500, Sara Kenedy wrote:
Dear all,
I run file Token.hs in
hugs98\libraries\Text\ParserCombinator\Parsec\Token.hs, but it
displays this error
ERROR : 64 - Syntax error in data type definition (unexpected '.')
Anyone know how to fix this? Thanks.
The problem
On Tue, 2005-09-20 at 10:14 +0200, Sven Moritz Hallberg wrote:
Donn Cave schrieb:
The ordinary lambda comes close - in ghc anyway, it supports
pattern matching. But I can't work out the syntax for multiple
cases, which would obviously be needed to make it practically
useful.
e.g.,
On Sat, 2005-09-17 at 04:55 -0400, Steven Elkins wrote:
On 9/17/05, Kenneth Hoste [EMAIL PROTECTED] wrote:
Can you tell us where you got bjpop-ray ? I wrote my own raytracer in
Haskell, and would like to check this one out too...
http://www.cs.mu.oz.au/~bjpop/code.html
Don't expect
On Mon, 2005-09-05 at 11:12 +0100, Malcolm Wallace wrote:
Why is this a Cabal issue? Are you interested in adding Buddah
support to Cabal?
I think what Bernie is referring to is that ghc-pkg-6.4 uses an input
file format very similar to Cabal's file format, for registering a
new
On Thu, 2005-09-01 at 14:48 -0700, Frederik Eaton wrote:
Is it that backtraces are difficult, or just require a lot of
overhead? It doesn't seem very hard to me, at least in principle. Add
a stack trace argument to every function. Every time a function is
called, the source location of the
On Thu, 2005-08-18 at 15:17 +0200, Ketil Malde wrote:
Hi,
One slight annoyance using Haskell is the inability to load modules
with type problems in the interactive environment (i.e. GHCi). When I
have a type error, it would be nice to have an interactive way to
explore what the compiler
[Moved to the Haskell cafe]
It's Friday afternoon here so I thought I'd join in the fun.
On Thu, 2005-08-11 at 23:01 -0400, [EMAIL PROTECTED] wrote:
While you can't be certain that once your code typechecks, it's bug-free
(though that does often happen), you can be almost guaranteed that if
On Wed, 2005-07-27 at 21:26 -0500, Srinivas Nedunuri wrote:
hello, I'm trying to use the Text.Regex library from Hugs. However,
Hugs doesn't recognize any of the methods in there. For example if I
try to use the mkRegex function I get the error message Undefined
variable mkRegex. I have
Hi,
I'm fairly sure this has been asked before (and recently too), but I
can't seem to find it in the archives. Sorry for the repetition.
Is there a way I can turn garbage collection off in GHC? I'm happy to
hack the runtime and comment out code if that is the only way. I just
don't know which
On Thu, 2005-07-21 at 09:24 +0200, Tomasz Zielonka wrote:
On Thu, Jul 21, 2005 at 04:55:15PM +1000, Bernard Pope wrote:
On Wed, 2005-07-20 at 17:06 +0100, Andy Gimblett wrote:
show (Prefix l p) = ( ++ l ++ - ++ show p ++ )
show (External p q) = ( ++ show p ++ [] ++ show q
On Thu, 2005-07-21 at 09:39 +0100, Simon Peyton-Jones wrote:
In fact there's a well established way to express the results of such an
exercise: an Addendum to the Report. Two of the things you mention
here already are Addenda
http://haskell.org/definition/
namely FFI and hierarchical
On Wed, 2005-07-20 at 00:21 +0200, yin wrote:
Dinh Tien Tuan Anh wrote:
Hi,
Could anyone explain for me why its not possible to return a primitive
type (such as Integer, String) while doing some IO actions ?
e.g: foo :: IO() - String
What does it have to do with lazy evalution
On Wed, 2005-07-20 at 14:27 +0800, Sun Yi Ming wrote:
[snip]
i first write this snippet of code:
---
import System.IO
mix :: [a] - [a] - [a]
mix [] ys = ys
mix xs [] = xs
mix (x:xs) (y:ys) = [x,y] ++ mix xs ys
f1 = do contents1 - readFile url1.txt
contents2 - readFile
On Wed, 2005-07-20 at 11:43 +0200, yin wrote:
hello,
how do I convert an Word32 (or WordXYZ) to Int, or Integer, or Float,
...? The Int conversion is the priority.
Thanks.
Matej 'Yin' Gagyi
fromIntegral to convert to an instance of Integral, such as Int, Integer
etc
Cheers,
Bernie.
On Tue, 2005-07-19 at 09:48 +0400, Bulat Ziganshin wrote:
Hello robert,
Monday, July 18, 2005, 10:14:43 PM, you wrote:
rd main = loop 0 0 0 -- initial values
rd where loop loop_num xpos ypos =
rd do e - pollEvent
rd let xpos' = calculate new xpos
rd
On Tue, 2005-07-19 at 17:01 +1000, Ben Lippmeier wrote:
Hello,
I often find it useful to determine whether two objects are using the
same constructor, without worrying about the constructors' arguments.
[snip]
Having some sort of generic shallowEq operator reduces the need for a
host of
On Tue, 2005-07-19 at 09:03 +0100, Bayley, Alistair wrote:
From: Bernard Pope [mailto:[EMAIL PROTECTED]
I should have mentioned this paper:
@article{Tremblay01,
author= {G. Tremblay},
title={Lenient evaluation is neither strict nor lazy},
journal
On Mon, 2005-07-18 at 15:19 +0100, Bayley, Alistair wrote:
From: Jerzy Karczmarczuk [mailto:[EMAIL PROTECTED]
Bernard Pope wrote:
I'll be a little bit pedantic here. Haskell, the language definition,
does not prescribe lazy evaluation. It says that the language is
non-strict. Lazy
On Sat, 2005-07-09 at 13:12 +0400, Bulat Ziganshin wrote:
Hello Dinh,
Friday, July 08, 2005, 9:12:22 PM, you wrote:
DTTA Another question, it's said in the book that using cyclic structure
(like
DTTA ones = 1:ones) , the list would be represented by a fixed amount of
memory.
DTTA
On Thu, 2005-07-07 at 18:43 +, Dinh Tien Tuan Anh wrote:
Hi,
Im a newbie to Haskell and the concept of cyclic strutures has confused me
a lot
I think it can be confusing for most people, so I wouldn't be too
concerned.
I may not answer your question completely, but I hope to give you an
[moved to haskell-cafe]
On Tue, 2005-06-28 at 14:46 -0700, John Meacham wrote:
Unfortunatly hat suffers from the same problem that pretty much every
non-trivial preprocessor does, as soon as you start using ghc's special
or experimental features that have not been added to hat yet, they stop
On Thu, 2005-06-30 at 10:36 +0100, Simon Peyton-Jones wrote:
| If anything I would like to see the Haskell community produce a
Haskell
| front end which was compiler neutral. That would facilitate many
| interesting projects, and that might even help with the need to
support
| new
On Wed, 2005-06-22 at 11:04 +0400, Serge D. Mechveliani wrote:
Who knows, please, how to work with the program of
main = interact (\ s - shows (read s :: Bool) \n)
Is this a GHC bug?
Regards,
Hi Serge,
Generally speaking differences that you see between the interactive
behaviour of
On Thu, 2005-06-23 at 00:17 -0400, [EMAIL PROTECTED] wrote:
printFact [] = return
printFact (x:xs) = do -- triggers error message
putStrLn (x ++ factorial is ++ fact x)
printFact xs
return
If anyone can explain to me how to fix this error I'd appreciate it.
You forgot to return a
On Mon, 2005-06-20 at 17:03 +0200, Gour wrote:
Bernard Pope ([EMAIL PROTECTED]) wrote:
To stop the complaints I renamed every occurrence of buddha to
plargleflarp on the webpage.
This term is not the best one :-)
No, but it made for some amusing emails.
To make people happy, why
On Mon, 2005-06-20 at 18:32 +0200, Ketil Malde wrote:
More suggestions:
buggha -- after all, it's a debugger
Sounds like a word Australians use frequently, probably when they find a
bug in their program.
Beelzebuddha -- by mixing in another deity, the hope is that the
followers of each
On Sun, 2005-06-19 at 12:16 -0400, Jim Apple wrote:
Has anyone gotten Buddha (now called plargleflarp
http://www.cs.mu.oz.au/~bjpop/buddha/) do work with GHC 6.4? I'm getting
ghc-6.4: unknown package: buddha
Jim
P.S. What happened to the old name?
Hi Jim,
Unfortunately I haven't had
On Tue, 2005-06-07 at 12:35 +0200, Gracjan Polak wrote:
Bernard Pope wrote:
A more practical solution is to force the compiler to generate more
strict code.
I tried to put strictness annotation in every place I could think of.
Without result :(
Did you try Data.List.foldl
On Mon, 2005-06-06 at 13:15 +0200, Gracjan Polak wrote:
Hello,
My space problems continued...
I have foldl that produces list, some combining function and quite large
source list:
let xyz = foldl f state myBigList
This setting should lazyli consume myBigList when next elements of
On Wed, 2005-04-27 at 07:45 +0200, Ketil Malde wrote:
[I want to know] who called who all the way from main to head,
because the key function is going to be one somewhere in the middle.
Perhaps. I am told stack backtraces are difficult with non-strict
semantics.
This is true, at least
On Mon, 2005-04-18 at 15:35 +1000, Bernard Pope wrote:
On Mon, 2005-04-18 at 01:08 -0400, David Menendez wrote:
Trevion writes:
On 4/18/05, Lloyd Allison [EMAIL PROTECTED]
wrote:
Is it possible to define Y in Haskell (pref' H98) --
and get it to pass type checking?
I
On Mon, 2005-04-18 at 01:08 -0400, David Menendez wrote:
Trevion writes:
On 4/18/05, Lloyd Allison [EMAIL PROTECTED]
wrote:
Is it possible to define Y in Haskell (pref' H98) --
and get it to pass type checking?
I believe that
y f = f (y f)
is the normal way to do it.
On Sun, 2005-04-10 at 15:44 +0900, Kaoru Hosokawa wrote:
I've been working through Thompson's exercises and got to one I could
not solve. It's Exercise 9.13. This is where I need to define init
using foldr.
init :: [a] - [a]
init Greggery Peccary ~ Greggary Peccar
Hi,
Here's
On Thu, 2005-03-03 at 02:03 +0100, Sam G. wrote:
I need a Monad to represent an internal stack. I mean I've got a lot of
functions which operates on lists and I would not like to pass the list as an
argument everytime.
Could you help me writing this monad? To start, I just need a +
On Fri, 2005-02-18 at 01:58 -0800, Sean Perry wrote:
I am learning Haskell, so I decided to implement everyone's favorite,
overused Unix command -- cat. Below is my simple implementation,
comments about style, implementation, etc. are welcomed.
In particular, is my untilEOF idiomatically ok?
On Mon, 2005-02-14 at 15:56 +, Simon Marlow wrote:
I don't think a general things to avoid section should be advocating
not naming things... in fact I would advocate the reverse. Name as many
things as possible, at least until you have a good feel for how much
point-freeness is going to
On Thu, 2005-01-27 at 13:57 +0800, WANG Meng wrote:
Hi All,
Does anybody has the experience to built an interpreter on top of GHCi?
What I want is to defined a my own interpreter as a Haskell module and
load it into GHCi. So this new interpreter will be running on top of GHCi
which
On Tue, 2004-11-30 at 13:52 +, Jules Bean wrote:
In the same sense, you could try
(map f [1..]) == (map g [1..])
and it will return False quickly if they are different, but it will run
forever if they are the same.
For some very generous definition of quickly :)
Bernie.
On Thu, 2004-11-18 at 13:23 +0800, WANG Meng wrote:
Hi All,
Does anybody know what parser Typing Haskell in Haskell use? I am tring
to use the code for some type checking. But I cannot find a parser in the
distribution.
Last time I looked, which was a long time ago, there was no parser.
I
42 matches
Mail list logo
