On 2006-07-13 at 02:29BST Neil Mitchell wrote:
Hi,
Are cool kids supposed to put the comma in front like this?
Some cool kids do, some cool kids don't. Some do both, depending on their
mood.
The advantage of a leading , is that now the comma's line up, and if
you want to add an item on
On 2006-07-12 at 23:24BST Brian Hulley wrote:
Christian Maeder wrote:
Donald Bruce Stewart schrieb:
Question over whether it should be:
splitBy (=='a') aabbaca == [,,bb,c,]
or
splitBy (=='a') aabbaca == [bb,c]
I argue the second form is what people usually want.
Yes,
On 2006-07-13 at 11:15+0200 Henning Thielemann wrote:
Optimal notation of lists, because of most easiest editing, is
a:
b:
c:
[]
That made me smile. In Ponder I had used up : for types, and
lists could be
a::
b::
c:.
but when I suggested this at a Haskell meeting, Simon PJ
complained
On 2006-07-13 at 09:35EDT [EMAIL PROTECTED] (Mark T.B. Carroll) wrote:
Jon Fairbairn [EMAIL PROTECTED] writes:
a::
b::
c:.
but when I suggested this at a Haskell meeting, Simon PJ
complained that it looks like hopscotch. I've never quite
understood that complaint!
http
On 2006-06-22 at 15:16BST Brian Hulley wrote:
minh thu wrote:
y and yq are infinite...
But how does this change the fact that y still has 1 more element than yq?
yq is after all, not a circular list.
infinity+1 = infinity
I don't see why induction can't just be applied infinitely
to
On 2006-06-22 at 15:45BST Brian Hulley wrote:
Jon Fairbairn wrote:
infinity+1 = infinity
Surely this is just a mathematical convention, not reality! :-)
I'm not sure how to answer that. The only equality worth
talking about on numbers (and lists) is the mathematical
one, and it's
On 2006-06-19 at 15:24- C Rodrigues wrote:
Here's a puzzle I haven't been able to solve. Is it possible to write the
initlast function?
There are functions init and last that take constant stack space and
traverse the list at most once. You can think of traversing the list as
On 2006-06-15 at 17:33BST Vladimir Portnykh wrote:
Fibonacci numbers implementations in Haskell one of the classical examples.
An example I found is the following:
fibs :: [Int]
fibs = 0 : 1 : [ a + b | (a, b) - zip fibs (tail fibs)]
Can we do better?
Well, you've had various variously
On Wed, 31 May 2006 14:15:26 - you wrote:
#738: ghc can't load files with selinux Enforcing
---+
Reporter: [EMAIL PROTECTED] |Owner:
Type: bug | Status:
On 2006-05-29 at 15:46+0200 =?UTF-8?B?RHXFoWFuIEtvbMOhxZk=?= wrote:
OK. If we have these two expressions:
1) (\x.x b x)
2) (\x.x c x)
The question is, are they equal? (They are not identical, of course.)
For answer no, there is a strong argument - there is no reduction
sequence
On 2006-05-29 at 19:03BST Brian Hulley wrote:
Dominic Steinitz wrote:
I think it's fascinating that already with ((.).(.)) there
is something that can be used practically and proved
equivalent to something easily comprehensible,
Well, it is compose composed with compose, so you can start
On 2006-05-20 at 12:00+0200 Sebastian Sylvan wrote:
A quick sales pitch: usually you, the library user, can just type:
./runhaskell Setup.hs configure
./runhaskell Setup.hs build
./runhaskell Setup.hs install
And it will Do The Right Thing(TM), which is nice.
This is something I've never
On 2006-05-20 at 11:58EDT Robert Dockins wrote:
On Saturday 20 May 2006 06:53 am, Jon Fairbairn wrote:
Make allows one to set up rules about what depends
on what, so why can't we just arrange it so that someone who
wants to install the thing just hast to type
./runhaskell Setup.hs
On 2006-04-13 at 20:18+0200 Alain Cremieux wrote:
(resent after being indefinitely held in fedora-haskell validation queue)
Hi,
1) I have installed FC5 on 2 different machines. On my Athlon1800+
everything works perfectly.
My other machine is a Pentium IV with hyperthreading, considered
On 2006-04-06 at 11:25EDT Michael Goodrich wrote:
Thanks so much for your help. I should have made clear that I was aware that
the definitions were mutually dependent. What I was hoping was that Haskell
could solve this for me without my having to resort to effectively finessing
any
On 2006-04-05 at 12:35EDT Michael Goodrich wrote:
Greetings All:
GHC gives: Fail: loop
Hugs gives: [(ERROR - C stack overflow
Nowt's up wi' ' runtime error message. GHC's perfectly
lucid. It says your programme went into an infinite loop.
This sort of thing belongs on
On 2006-04-05 at 14:03EDT Michael Goodrich wrote:
BTW, I can't seem to locate 'haskell-cafe'.
http://www.haskell.org/mailman/listinfo/haskell-cafe
The message responding to my sign-up said nothing about
haskell-cafe.
Perhaps it should. It's so long since I signed up to haskell
that I've
On 2006-04-04 at 10:03- GHC wrote:
#738: ghc can't load files with selinux Enforcing
-+--
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status:
On 2006-03-28 at 08:02+0200 Tomasz Zielonka wrote:
I wonder if it would be possible to remove the space-leak by running both
branches concurrently, and scheduling threads in a way that would
minimise the space-leak. I proposed this before
On 2006-03-25 at 09:41PST Jared Updike wrote:
2218 RING OPERATOR
= composite function
= APL jot
00B0 degree sign
25E6 white bullet
I don't think any other Unicode character should be considered.
That's great but
1) I have no idea
Gah! I managed to send that without a content-type field
(for bizarre reasons which I won't elaborate right
now). Here it is again with what I hope is the right (utf-8)
type, which ought to make it more legible in some email
readers.
On 2006-03-25 at 09:41PST Jared Updike wrote:
2218 RING
On 2006-03-17 at 06:58GMT Aaron Denney wrote:
On 2006-03-17, Donald Bruce Stewart [EMAIL PROTECTED] wrote:
Well, there is a way -- it's fairly easy with the right regex -- but
is it really ambiguous? Do people find it confusing? What do other sites do?
Why not the ISO standard -MM-DD?
On 2006-02-17 at 20:12GMT rgo wrote:
Hi all,
my program probably goes into infinite loop... But i cannot understand where
and why.
getDirectoryContents will include . and .., so if you
follow those, you're bound to loop.
--
Jón Fairbairn Jon.Fairbairn at
On 2006-02-17 at 09:22PST Jared Updike wrote:
Yep. change one line to:
entry - if isdir name /= . name /= ..
and it does in fact work.
Only if no-one has been tricky with symbolic links.
--
Jón Fairbairn Jon.Fairbairn at cl.cam.ac.uk
On 2006-02-04 at 16:08EST Cale Gibbard wrote:
cartesian xs ys = map (\[x,y] - (x,y)) $ sequence [xs,ys]
I'm lost. Isn't that just like
cartesian xs ys = [(x,y)|x-xs, y-ys]
?
Whereas...
On 04/02/06, Jan-Willem Maessen [EMAIL PROTECTED] wrote:
On Feb 4, 2006, at 1:31 PM, Jon Fairbairn wrote
On 2006-02-04 at 21:15GMT Brian Hulley wrote:
Stefan Holdermans wrote:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Brian wrote:
I think the mystery surrounding :: and : might have been that
originally people thought type annotations would hardly ever be
needed whereas list cons
On 2006-02-04 at 15:11+0100 John Hughes wrote:
I noticed ticket #55--add parallel list comprehensions--which according to
the ticket, will probably be adopted. I would argue against.
I also agree.
Firstly: because in its more general forms the notation is confusing. Try
this example:
On 2006-01-13 at 13:32PST Jared Updike wrote:
That works except it loses single newline characters.
let s = 1234\n5678\n\nabcdefghijklmnopq\n\n,,.,.,.
Prelude blocks s
[12345678,abcdefghijklmnopq,,,.,.,.]
Also the argument to groupBy ought to be some sort of
equivalence relation.
blocks =
On 2005-12-21 at 18:10GMT Daniel Carrera wrote:
Daniel Carrera wrote:
Hey,
The sqrt function is not doing what I want. This is what I want:
round sqrt(2)
Sigh... never fails. Spend an hour trying to solve a problem, and a
minute after you write to the list you find the solution.
On 2005-11-21 at 15:14EST Michael Benfield wrote:
I'm new to Haskell. I'm apparently misunderstanding something here.
When I run this program:
-
module Main where
import System.Posix
import System.CPUTime
printTime = getCPUTime = putStrLn . show
main = printTime sleep 5
On 2005-11-17 at 13:21EST Cale Gibbard wrote:
Sebastian Sylvan wrote:
Personally I think that the dot is way to good of a symbol to be
wasted on function composition. I mean, how often do you really use
function composition in a way which doesn't obfuscate your code? I use
($) way more
On 2005-11-14 at 11:13+0100 Wolfgang Jeltsch wrote:
Maybe I changed Konqueror's font settings already. The point is that my
settings are in such a way that text with the default font size is well
readable while not taking up too much space. The problem is with
haskell.org's links. They
On 2005-11-14 at 10:38EST John Peterson wrote:
If someone sends me a new css file I'll be happy to throw it on
haskell.org for you. Please send an email to this list if you want to
do this so nobody else wastes their time.
Is anything more needed than the attached patch?
If so, I'm willing
On 2005-10-25 at 12:20+0200 Lemmih wrote:
On 10/25/05, Charles SDudu [EMAIL PROTECTED] wrote:
Hello, I need to calculate the frequency of each
character in a String. And if I can do this really well
in C, I dont find a nice (and fast) answer in haskell. I
tried several functions, listed
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
On 2005-10-11 at 09:49BST Simon Marlow wrote:
On 11 October 2005 06:29, Tomasz Zielonka wrote:
It wasn't meant to be a bug report, only a feature request ;-)
Actually, I was mostly interested if anyone would mind if GHC
chose the name based on the top-level module.
Would you accept
On 2005-10-07 at 22:42- Gerd M wrote:
As (memory) is a function, it
cannot be memoized (the function can be, but not its result, which is
what you're after).
How can a funcion be memoized but not it's result (what does this mean)!?
Since there are no side effects in Haskell why is it
On 2005-10-04 at 00:01EDT Mike Crowe wrote:
Hi folks,
I ran across Haskell at the Great Win32 Computer Language Shootout. A
friend approached me with a potential large application to develop. The
idea of a language which can reduce time to design and make better code
is very
On 2005-07-15 at 10:49+0200 Tomasz Zielonka wrote:
But you can format it this way:
let a very long definition of a =
and the body has to be here is a very long application to and
but using long arguments like definition is not that bad
in
or
let a very long definition
On 2005-07-12 at 12:39- Dinh Tien Tuan Anh wrote:
i have just encountered another type error.
This program tries to print out partitions of a positive integer (i guess)
parts 0 = [[]]
parts x = [concat (map (y:) parts(x-y) | y-[1..(x `div` 2)]]
^
Would it be possible to extend the DEPRECATED pragma to
allow one to deprecate an instance of a class?
I was thinking about the recent discussion of APIs on
haskell-cafe, where Jérémy Bobbio complained about using
Booleans as arguments to libaray functions, preferring
instead sensibly named data
1) If another language has a feature, add it to Haskell, so
that absolutely everything can be done in more than one
way. This allows people to write Haskell programmes
without going through the tiresome process of learning
Haskell.`
2) Overload the syntax so that the Hamming
On 2005-02-28 at 23:10EST Jim Apple wrote:
Jon Fairbairn wrote:
If you allow quantification over higher
kinds, you can do something like this:
d f = f . f
d:: a::*, b::**.(b a a) b (b a) a
What's the problem with
d :: (forall c . b c - c) - b (b a) - a
d f = f . f
On 2005-02-28 at 18:03GMT Ben Rudiak-Gould wrote:
Pedro Vasconcelos wrote:
Jim Apple [EMAIL PROTECTED] wrote:
Is there a type we can give to
y f = f . f
y id
y head
y fst
are all typeable?
Using ghci:
Prelude let y f = f.f
Prelude :t y
y :: forall c. (c - c) -
On 2005-01-24 at 16:32MST Surendra Singhi wrote:
Is there any ilisp or slime like package for haskell, which integrates
haskell with xemacs or emacs and provides a kind of integrated
development environment?
I am using Hugs 98.
Does URL:
On 2004-12-23 at 15:09-0200 =?ISO-8859-1?Q?Maur=EDcio?= wrote:
Guys,
What is wrong with this code?
**
import Complex
roots :: (Complex, Complex, Complex) - (Complex, Complex);
roots (a,b,c) = (x1,x2) where { x1 = (b*b + (sqrt_delta))/(2*a); x2 =
(b*b -
On 2004-12-17 at 17:51GMT Simon Peyton-Jones wrote:
This message is about lexically scoped type variables.
I've been trying to work out what I think about this since
you sent out the first message in this thread. I'm not sure
that I've come to a useful conclusion, so I'll summarise my
thoughts
On 2004-12-16 at 17:00+0100 Henning Thielemann wrote:
imranazad wrote:
Hi,
im not very good with haskell, i barely know the
basics, my coursework requires me to genereate a
vigenere square... well anyway at the moment im
trying to define a functin all_rotations which
On 2004-12-11 at 16:00GMT chris beddoe wrote:
Hey,
please don't send mail in html
I have been trying to program a simple Haskell program that allows me
to input a list of Java files and their dependencies
Judging from what appears below, you should probably start
with something simpler.
On 2004-11-16 at 11:42+0100 Peter Simons wrote:
Henning Thielemann writes:
One advantage is that you need to type fewer characters.
I know memory is expensive, that's why only the last two
digits of year numbers are stored. :-]
I understand what you're getting at -- and I find it
On 2004-11-01 at 23:01+0100 Benjamin Franksen wrote:
On Monday 01 November 2004 21:51, Jon Fairbairn wrote:
Put the data declaration in a module, export the type, but
not the constructor you want to hide:
module Shape (Shape(Square), circle) where
Since we were talking about 'what can
On 2004-10-29 at 00:50BST Ben Rudiak-Gould wrote:
Jon Fairbairn wrote:
On 2004-10-29 at 00:03BST Ben Rudiak-Gould wrote:
Not much better, though: in my experience this particular
exception leaves ghci in a very peculiar state, and it's
usually necessary to quit and restart it before
On 2004-10-29 at 18:29+0200 Peter Simons wrote:
Is anyone else seeing this on his system?
getUserEntryForName [] = print . userName
wasabi
wasabi happens to be the last entry in the /etc/passwd
file, and that is what I get every time I query for an user
that doesn't exist. The source
On 2004-10-29 at 00:50BST Ben Rudiak-Gould wrote:
Jon Fairbairn wrote:
On 2004-10-29 at 00:03BST Ben Rudiak-Gould wrote:
Not much better, though: in my experience this particular
exception leaves ghci in a very peculiar state, and it's
usually necessary to quit and restart it before
On 2004-10-29 at 00:45+0200 Andrej Bauer wrote:
Hi,
I am new to haskell, but otherwise experienced in programming languages.
My first attempt at Haskell was this (on a Linux Debian) session with hugs:
Type :? for help
Prelude :version
-- Hugs Version November 2003
Prelude let p = 1 :
On 2004-10-29 at 00:03BST Ben Rudiak-Gould wrote:
Jon Fairbairn wrote:
In ghci you get:
[1*** Exception: loop
which is better.
Not much better, though: in my experience this particular
exception leaves ghci in a very peculiar state, and it's
usually necessary to quit
On 2004-10-10 at 11:20BST Malcolm Wallace wrote:
As an example, instead of the following list-only code,
f :: List a - ...
f []= ...
f (h:t) = ...
you could write this more general version, which assumes only some
class Sequence with operations null, head, tail, etc.
On 2004-10-12 at 18:07+0200 Christian Hofer wrote:
Hi,
having found a bit of time to play with Haskell, I am trying to figure
out how to enforce strict evaluation.
I wrote the following program:
main =
let x = zipWith (+) [5..] [6..]
in putStrLn $ show $ x `seq` head x
I
On 2004-10-06 at 10:37CDT ldou wrote:
In the random selection, it perhaps select the same element
of the string, how can I select two different elements?
Consider the \\ operator.
--
Jón Fairbairn [EMAIL PROTECTED]
On 2004-09-28 at 21:19- John Goerzen wrote:
On 2004-09-28, Peter Simons [EMAIL PROTECTED] wrote:
John Goerzen writes:
FWIW, this is working for me:
import IO
main = disp 100
disp 0 = return ()
disp n =
let copy x = do
eof - isEOF
if eof
On 2004-08-11 at 14:19BST Glynn Clements wrote:
Bayley, Alistair wrote:
Is recvFrom meant to be a one-shot function i.e. the socket is only closed
when the process exits?
The implementation is:
recvFrom host port = do
ip - getHostByName host
let ipHs = hostAddresses ip
s
I just got myself a copy of ghc-6.2.1 and was idly
experimenting with Network in ghci.
I tried
Prelude System.Posix Network do r - recvFrom localhost$ PortNumber 9090; putStr
r
in one ghci and
Prelude Network do sendTo localhost (PortNumber 9090) jellied eels\n
in another and was
On 2004-07-26 at 18:10BST =?iso-8859-1?q?Stu=20White?= wrote:
Hi
I'm not especially experienced in using haskell, and I could use some help.
As part of a project, I'm trying to construct a data type
that can represent three values as a 'triple' (as opposed
to a 'tuple'),
you could just
On 2004-07-23 at 19:18+0300 Kari Pahula wrote:
temp :: (Real a) = Object (Energy a) (HeatC a) - Temp a
temp Object (Energy e) (HeatC c) = Temp e*c
But this fails in hugs with:
ERROR temp.hs:22 - Constructor Object must have exactly 2 arguments in pattern
You've given temp three arguments:
On 2004-06-14 at 15:59PDT Iavor S. Diatchki wrote:
according to the report there should be no connection
between modules and files, and one should be able to have
multiple modules in a file, and even a single module in
multiple files. however none of the implementations
support that, so in
On 2004-06-10 at 10:39BST Martin Escardo wrote:
Dear Haskell-list members,
This is to advertise the monograph
Synthetic topology of data types and classical spaces, to appear in
ENTCS 87, 150pp, three parts, 6+5+2 chapters.
Interesting. But why do you use Int rather than the Integer?
In
On 2004-04-13 at 18:52+0200 Ketil Malde wrote:
Paul Cosby [EMAIL PROTECTED] writes:
Every time I try to use [underscore] in an definition it says
something like the symbol /017 is not recognised
Could that be \017, i.e. octal 17 (defined in ASCII as SI, whatever
that may be)?
SI is
On 2004-03-23 at 16:58EST S. Alexander Jacobson wrote:
Implementing Reverse from before, I am running
into this weird error:
type ReverseType a string = (string -(string,a))
data Reverse a string = Reverse (ReverseType a string)
instance Monad (Reverse a s) where
return x =
On 2004-01-01 at 21:07EST [EMAIL PROTECTED] wrote:
There is only one problem I've found with test-driven development in
Haskell. In C++, it's possible to break the module abstraction
(yes, I know, C++ doesn't have modules; it has classes, which are really
instantiable modules) by using
On 2003-12-31 at 19:27GMT Lee Dixon wrote:
Hi,
Can anyone explain to me how hugs manages to derive that
f x y z = y (y z) x
is of type
f :: a - ((a - b) - a - b) - (a - b) - b
To begin with, f has three arguments, x y and z, so letting
each of these have types Tx Ty and Tz, f has to
On 2003-12-18 at 16:40+0100 [EMAIL PROTECTED] wrote:
Good evening,
OK. I don't know Haskell enough to argue.
But I can't resist pointing out that reading a single byte
having the value 233 (that is 'é')
The problem is that if you are reading single bytes, 233 is
not necessarily é. It
On 2003-11-18 at 10:46EST Abraham Egnor wrote:
The classic way to write a lift function for tuples is, of course:
liftTup f (a, b) = (f a, f b)
which has a type of (a - b) - (a, a) - (b, b). I've been wondering if
it would be possible to write a function that doesn't require the types in
I'd just like to add a brief note to what Claus has said:
On 2003-10-06 at 19:48BST C.Reinke wrote:
[moved to haskell-cafe]
The odd is in the conceptual explanation. If I give a description
of some f x = y function in Haskell I expect that some program f x
is reduced to y and the
On 2003-09-17 at 10:31EDT Gordon James Miller wrote:
Something I think is more café than language:
Hello all.
I'd be interested in getting some feedback on how to do this linear
interpolation function a little more cleanly. The normal way that this
is taught is to find the set of indices
On 2003-08-29 at 17:39PDT Hal Daume III wrote:
Hi fellow Haskellers,
I'm attempting to get a sense of the topology of the Haskell
community. Based on the Haskell Communities Activities reports, it
seems that the large majority of people use Haskell for Haskell's sake.
If you use Haskell
On 2003-08-23 at 20:14+0200 Wolfgang Jeltsch wrote:
On Thursday, 2003-08-21, 13:32, CEST, Keith Wansbrough wrote:
[...]
BTW: please post in plain ASCII, not HTML [...]
Or post both, plain text and HTML, in combination. Users
of HTML-capable mail clients will be able to read your
mails
On 2003-08-22 at 18:39+0200 Konrad Hinsen wrote:
I am getting a bit worried about the usability of Haskell
for numerical work. The Haskell 98 report states that
floating literals are represented as a conversion from
Rational, which means that the literal is first converted
to a Rational. I
On 2003-08-11 at 11:44+0200 David Sabel wrote:
module Main(main) where
import System.IO.Unsafe
main = case unsafePerformIO (print test) of
() - main
ok, probably I use unsafePerformIO in an unsafe way and so on,
but executing the program prints infinitely often test
On 2003-08-02 at 14:36PDT Dominic Steinitz wrote:
Could someone explain to me why this doesn't work
test l =
hs
where
hs = map (\x - [x]) [0..abs(l `div` hLen)]
hLen = length $ head hs
whereas this does
test l =
hs
where
hs = map (\x
On 2003-07-17 at 09:08+0200 Johannes Waldmann wrote:
On Wed, 16 Jul 2003, K. Fritz Ruehr wrote:
I think the cutest way to get what you want here is to define a new
^^
operator as follows:
(.) = (.) . (.)
Indeed this is cute - but let me add a general comment
On 2003-07-12 at 20:20+1000 Andrew J Bromage wrote:
G'day all.
On Fri, Jul 11, 2003 at 04:28:19PM -0400, Dylan Thurston wrote:
Don't be silly [...]
Never!
Or only sometimes. I'm surprised that no-one has yet
answered the question How overload operator in Haskell?
with Overload operator
On 2003-07-08 at 10:15+0200 Jerzy Karczmarczuk wrote:
If it's a _Rational_, surely you want it to be exactly the
same as you get for 31415926536%100?
No. If 'you' means concretely me, then no. Simply no.
Writing
pi = 3.1415926536 :: Rational
and expecting to continue the
On 2003-07-07 at 12:01+0200 Jerzy Karczmarczuk wrote:
Jon Fairbairn comments //Steffen Mazanek//:
Prelude 0.1::Rational
13421773 % 134217728
Prelude 13421773/134217728
0.1
I do not know how this fraction is calculated, but
it does not fit my expectations :-)
Remember
On 2003-07-07 at 13:40+0200 Jerzy Karczmarczuk wrote:
[...] I believe (still naïvely??) that those socio-psycho-pragmatisms
which played some role in the definition of the language should
be better tuned. If I were to write
pi = 3.1415926536 :: Rational
I suppose that I would like to see
On 2003-07-05 at 19:43+0200 Steffen Mazanek wrote:
Hello,
a quit funny hugs session:
Prelude 0.5::Rational
1 % 2
Prelude 0.1::Rational
13421773 % 134217728
Prelude 13421773/134217728
0.1
I do not know how this fraction is calculated, but
it does not fit my expectations :-)
On 2003-06-17 at 20:15EDT Derek Elkins wrote:
The closest function I see is ap :: Monad m = m (a - b) - m a - m b
(so you could write your function as f fs a = ap fs (return a) not that
I would recommend it). Also you may want to check out the Haskell
reference at zvon.org, it's indexed by
On 2003-06-08 at 18:03PDT Ashley Yakeley wrote:
In article [EMAIL PROTECTED],
[EMAIL PROTECTED] (Peter G. Hancock) wrote:
Thanks! It made me wonder what colour the sky is on planet Haskell.
From a Curry-Howard point of view, (I think) the quantifiers are
currently the wrong way round.
On 2003-06-06 at 08:15BST Simon Peyton-Jones wrote:
I forget whether I've aired this on the list, but I'm
seriously thinking that we should change 'forall' to
'exists' in existential data constructors like this one.
You did mention it, and there were several replies. I'd
characterise them as
On 2003-03-18 at 12:44EST Dean Herington wrote:
Simon Marlow wrote:
On Mon, Mar 17, 2003 at 10:33:47AM +, Ross Paterson wrote:
GHC doesn't recognize literals like 9e2, and nor does lex.
Fixed GHC, I'll leave lex to someone more familiar with the code...
Cheers,
Simon
The following module takes an inordinately long time to
compile in ghc[i] (5.04):
module Y2 where
-- define the Y combinator without using built in recursion
data Y2 t = Recur (Y2 t - (t - t) - t)
y f = y2 (Recur y2) f
where y2:: Y2 t - (t - t) - t
y2 (Recur y2') f = f (y2'
On 2003-01-30 at 11:08GMT Ross Paterson wrote:
On Thu, Jan 30, 2003 at 11:41:49AM +0100, Rijk J. C. van Haaften wrote:
Recently, I came accross this
expression:
[ x + y | x - xs | y - ys ]
As far as I can see (Haskell Report),
this is not allowed by the haskell 98
standard. So I
On 2002-10-05 at 18:41EDT David Roundy wrote:
How does one debug in haskell?
One doesn't. One writes correct code in Haskell ;-b
I have already isolated my bug within one function, but
that function has somewhat funky recursion, and uses an
array (which I'm none too familiar with in
If I load ratio and type 2^3%5 into Hugs I get 8 % 5 as
I'd expect.
If I do the same for ghci, I get an error message, because
it's parsed it as 2^(3%5). Prelude Ratio ought to have
infixl 7 %
(or maybe it should be in GHC.Real), but I can't find it (in either)
Which reminds me: please
Ken Shan [EMAIL PROTECTED] wrote:
In Haskell, backquotes can be used to convert individual identifiers
into infix operators, but not complex expressions. For example,
[1,2,3] `zip` [4,5,6]
is OK, but not
[1,2,3] `zipWith (+)` [4,5,6]
Is there any reason other than potential
Hal Daume III [EMAIL PROTECTED] wrote:
I have no idea what I did to cause this, but ghci just crapped out on me
:)
*** Exception: basicTypes/RdrName.lhs:83: Non-exhaustive patterns in
function rdrNameModule
I've seen this too, but I was trying to pin it down before
reporting it. It might be
Mark Carroll [EMAIL PROTECTED] wrote:
On Sun, 30 Jun 2002, Jon Fairbairn wrote:
(snip)
But there's the rub. It's not beautiful and it doesn't make
much sense. I really wish we could get away from the How do
I convert this imperative code snippet into Haskell
questions into How do I
Shlomi Fish wrote:
No. But I want to generate an irregular series, which I determine the
intervals between two consecutive numbers myself. E.g:
let (num1, next1) = (counter 5)
(num2, next2) = (next1 100)
(num3, next3) = (next2 50) in
[num1,num2,num3]
Will have the numbers
Hi,
I am trying to create an overloaded function à la Java to be able to
call it either with a string or a number.
Ex :
definePort http
definePort 80
but I have problem with restrictions in Haskell's type system
Is there a better solution ?
If we knew /why/ you wanted to do this we
Alain Cremieux wrote:
I am trying to build a functional firewall generator. The first part
describes the available protections (kernel, anti-address spoofing, etc.).
The second desribes every protocol, and the necessary rules if the
corresponding service is enabled (e.g. open the http
On Fri, Jun 21, 2002 at 12:50:21PM +0100, Simon Peyton-Jones wrote:
| From: Jon Fairbairn [mailto:[EMAIL PROTECTED]]
| Sent: 20 June 2002 16:27
| To: Simon Peyton-Jones
| Subject: Library report, monad zero laws
|
| The old report used to include
|
| m zero = zero
| zero
201 - 300 of 389 matches
Mail list logo
