Neil Mitchell wrote:
system cp foo foo.bup deleteFile foo
If I Ctrl+C during the cp did I just delete my one copy of foo?
On Windows, Ctrl-C will unblock a blocked system call. e.g. read() returns
with zero. Apparently system foo also returns as soon as you press
Ctrl-C, I'm not entirely
#3105: Panic during profiling build after recompiling a dependency with
-auto-all
--+-
Reporter: FSalad |Owner:
Type: bug|
#3106: hundred failures of release candidate ghc-6.10.1.20090314 in testsuite
+---
Reporter: maeder | Owner:
Type: bug | Status: new
Priority: normal | Milestone:
#3106: hundred failures of release candidate ghc-6.10.1.20090314 in testsuite
+---
Reporter: maeder | Owner:
Type: bug | Status: new
Priority: normal | Milestone:
#3106: hundred failures of release candidate ghc-6.10.1.20090314 in testsuite
+---
Reporter: maeder | Owner:
Type: bug | Status: new
Priority: normal | Milestone:
#3106: hundred failures of release candidate ghc-6.10.1.20090314 in testsuite
+---
Reporter: maeder | Owner:
Type: bug | Status: new
Priority: normal | Milestone:
#3024: Rewrite hp2ps in Haskell
-+--
Reporter: SamB |Owner:
Type: task | Status: new
Priority: normal|Milestone:
#3106: hundred failures of release candidate ghc-6.10.1.20090314 in testsuite
+---
Reporter: maeder | Owner:
Type: bug | Status: new
Priority: normal | Milestone:
#3106: hundred failures of release candidate ghc-6.10.1.20090314 in testsuite
+---
Reporter: maeder | Owner:
Type: bug | Status: new
Priority: normal | Milestone:
#3039: strange space usage
-+--
Reporter: igloo |Owner: igloo
Type: merge | Status: new
Priority: normal|Milestone: 6.10.2
#2297: Profiler is inconsistent about biography for GHC's heap
-+--
Reporter: igloo |Owner:
Type: bug | Status: closed
Priority: normal
#3107: Over-eager GC when blocked on a signal in the non-threaded runtime
---+
Reporter: awick | Owner:
Type: bug | Status: new
Priority: normal | Component:
#3106: hundred failures of release candidate ghc-6.10.1.20090314 in testsuite
+---
Reporter: maeder | Owner:
Type: bug | Status: new
Priority: normal | Milestone:
#3074: Template Haskell does not support type families.
-+--
Reporter: Serguey Zefirov | Owner:
Type: bug | Status: closed
#3103: Compiling base with cabal fails.
--+-
Reporter: Lemmih| Owner:
Type: bug | Status: new
Priority: normal| Milestone:
#3103: Compiling base with cabal fails.
--+-
Reporter: Lemmih| Owner:
Type: bug | Status: new
Priority: normal| Milestone:
Duncan Coutts wrote:
On Mon, 2009-03-16 at 12:13 +, Simon Marlow wrote:
This sounds like a chicken and egg problem. To know which package
include directories to use GHCi needs to know which packages your module
uses. However to work out which packages it needs it has to load the
module
On Tue, 2009-03-17 at 08:53 +, Simon Marlow wrote:
Duncan Coutts wrote:
On Mon, 2009-03-16 at 12:13 +, Simon Marlow wrote:
Yes, if we know we're using it. If we specify -package blah on the
command line then we do know we're using it and everything works
(because ghc uses the
GHC 6.10.2 will have a problem with cabal-install-0.6.2!
When I tried to install cabal-install-0.6.2 for ghc-6.10.1.20090314
I needed to change #!/bin/sh to #!/bin/bash in bootstrap.sh to avoid the
following errors:
-bash-3.00$ ./bootstrap.sh
Checking installed packages for
Dear all,
It seems that the front page of the developer wiki is rather
out-of-date. Considering that 6.10.2 is now at rc1-stage, I was rather
hoping to find some updated notes on release plans for 6.10.2 and what
will be in 6.12, but those notices are still at 6.8.3 and 6.10, resp.
On another
Christian Maeder wrote:
Testsuite results are bad for ghc-6.10.1.20090314, see
http://hackage.haskell.org/trac/ghc/ticket/3106
Patch for the cygpath not found issue is attached to the ticket. Please
(Windows/Cygwin/Mingw users especially) test it.
Thanks,
Karel
Philip K.F. Hölzenspies wrote:
It seems that the front page of the developer wiki is rather
out-of-date. Considering that 6.10.2 is now at rc1-stage, I was rather
hoping to find some updated notes on release plans for 6.10.2 and what
will be in 6.12, but those notices are still at 6.8.3 and
Serge D. Mechveliani wrote:
I have tested ghc-6.10.1.20090314 on Debian Linux, i386-unknown,
on
making from source by ghc-6.10.1, making itself from source, DoCon.
It looks all right.
Thanks Serge!
Simon
___
Glasgow-haskell-users mailing
Hi everyone. I'm trying to build GHC 6.8.3 on a Solaris 8 machine. I'd
love to upgrade Solaris to 10, which I believe would solve the problem I'm
having by making /usr/lib/libm.so.2 available, but that's not an option at
this time.
Here's the output of uname -a on the system.
SunOS bwddev1 5.8
Ralph Crawford wrote:
ln -s /usr/lib/libm.so.1 $BOS_ROOT/lib/libm.so.2
You need an actual libm.so.2 library that contains the missing symbols.
To this library you set a link libm.so in a directory that is in the
front of your LD_LIBRARY_PATH, so that libm.so.2 instead of libm.so.1 is
found via
On 2009 Mar 17, at 10:36, Christian Maeder wrote:
Ralph Crawford wrote:
ln -s /usr/lib/libm.so.1 $BOS_ROOT/lib/libm.so.2
You need an actual libm.so.2 library that contains the missing
symbols.
To this library you set a link libm.so in a directory that is in the
front of your
I have just downloaded a darcs snapshot, pulled patches and followed
the instructions at
http://hackage.haskell.org/trac/ghc/wiki/Building/QuickStart
When I got to do
make
it didn't work. The tail of the output looks like this:
[55 of 55] Compiling Main ( cabal-bin.hs,
On Tue, 2009-03-17 at 11:09 +0100, Christian Maeder wrote:
GHC 6.10.2 will have a problem with cabal-install-0.6.2!
When I tried to install cabal-install-0.6.2 for ghc-6.10.1.20090314
I needed to change #!/bin/sh to #!/bin/bash in bootstrap.sh to avoid the
following errors:
-bash-3.00$
On 2009 Mar 17, at 20:28, Duncan Coutts wrote:
On Tue, 2009-03-17 at 11:09 +0100, Christian Maeder wrote:
Under Solaris sh is not bash!
Indeed.
According to the OpenGroup that syntax should be fine:
http://www.opengroup.org/onlinepubs/009695399/utilities/xcu_chap02.html#tag_02_09_02
It
{-
Recursive instance heads as in ...
 instance C0 (x,Bool) = C0 x
... are Ok if we allow for typechecking scheme as described in SYB with class.
The main idea is to assume C0 x in proving the preconditions of the
body of the clause.
This is also works for mutual recursion among type classes
Ralf wrote:
class C1 x
where
m1 :: x - ()
m1 = const undefined
instance (C1 x, C1 y) = C1 (x,y)
instance C1 Bool
instance (C2 x y, C1 (y,Bool)) = C1 x
class C2 x y | x - y
instance C2 Int Int
bar :: ()
bar = m1 (1::Int)
I believe it works very well (meaning bar typechecks and
I am happy to announce libffi 0.1, binding to the C library
libffi, allowing C functions to be called whose types are not
known before run-time.
Why?
Sometimes you can't use the haskell foreign function interface
because you parse the type of the function from somewhere else,
i.e. you're writing
Re: Tom: Thanks. This was an excellent analysis.
Re: Oleg: Obviously, I don't want to add instance C1 int. Rather C1
Int should be implied by the existing scheme for recursive dictionary
construction and bar should typecheck fine. (foo already relies on
this scheme.) However, as Tom pointed out,
Norman Ramsey n...@cs.tufts.edu wrote in article
20090316154743.12f45104...@lakeland.eecs.harvard.edu in
gmane.comp.lang.haskell.general:
...
In any case, I hope this question is orthogonal to the problem of
permitting a type declaration as a 'decl' in a where clause and not a
mere lonely
Tom Schrijvers wrote:
The cyclic dictionaries approach is a bit fragile. The problem appears to
be here that GHC alternates exhaustive phases of constraint reduction and
functional dependency improvement. The problem is that in your example you
need both for detecting a cycle.
It seems we
On 17/03/2009, at 1:13 PM, Jonathan Cast wrote:
[Totally OT tangent: How did operational semantics come to get its
noun?
The more I think about it, the more it seems like a precís of the
implementation, rather than a truly semantic part of a language
specification.]
I haven't followed the
On Fri, Mar 13, 2009 at 1:19 AM, ChrisK hask...@list.mightyreason.com wrote:
At the cost of writing your own routine you get exactly what you want in a
screen or less of code, see
http://hackage.haskell.org/packages/archive/regex-compat/0.92/doc/html/src/Text-Regex.html#subRegex
for
Hi,
Can someone PLEASE help me to understand exactly how to configure
OpenGL on Window using Haskell. I'm using Eclipse IDE.
When I try to run the file Test1.hs in GHCi then I get the following
error:
Loading package syb ... linking ... done.
Loading package base-3.0.3.0 ... linking ... done.
Hello Mark,
Mark Spezzano valh...@chariot.net.au писал(а) в своём письме Tue, 17 Mar
2009 13:49:50 +0600:
Can someone PLEASE help me to understand exactly how to configure
OpenGL on Window using Haskell. I'm using Eclipse IDE.
When I try to run the file Test1.hs in GHCi then I get the
Am Dienstag, 17. März 2009 05:09 schrieb wren ng thornton:
a...@spamcop.net wrote:
Or to put it another way, category theory is the pattern language of
mathematics.
Indeed. Though, IMO, there's a distinction between fairly banal things
(e.g. monoids),
Monoids aren’t a concept of category
Wolfgang == Wolfgang Jeltsch g9ks1...@acme.softbase.org writes:
Wolfgang By the way, the documentation of Control.Category says
Wolfgang that a category is a monoid (as far as I remember). This
Wolfgang is wrong. Category laws correspond to monoid laws but
Wolfgang monoid
Olá café,
With the recent generic programming work and influences from
type-dependent languages such as Agda, the following data type seems to
come up often:
data (a :=: a') where
Refl :: a :=: a
Everyone who needs it writes their own version; I'd like to compile a
package with this
Does an up-to-date technical document exist describing GHC Core?
Google found http://www.haskell.org/ghc/docs/papers/core.ps.gz
I'm not sure this document reflects the current state of art.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
data (a :=: a') where
Refl :: a :=: a
Comm :: (a :=: a') - (a' :=: a)
Trans :: (a :=: a') - (a' :=: a'') - (a :=: a'')
Martijn van Steenbergen wrote:
Olá café,
With the recent generic programming work and influences from
type-dependent languages such as Agda, the following data type seems
2009/3/17 Peter Verswyvelen bugf...@gmail.com:
Does an up-to-date technical document exist describing GHC Core?
It's not really a paper, but the GHC developer wiki contains some
useful info about GHC core:
http://hackage.haskell.org/trac/ghc/wiki/Commentary/Compiler/CoreSynType
regards,
Bas
Hi Manlio,
Manlio Perillo wrote:
For my Netflix Prize project I have implemented two reusable modules.
The first module implements a random shuffle on immutable lists...
The second module implements a function used to partition a list into n
sublists of random length.
Very nice!
If someone
Duncan Coutts duncan.cou...@worc.ox.ac.uk writes:
[..] I have a sneaking suspicion [exceptions] actually *is* `unsafe'. Or, at
least, incapable of being given a compositional, continuous semantics.
Basically if we can only catch exceptions in IO then it doesn't matter,
it's just a little
Am Dienstag, 17. März 2009 10:54 schrieben Sie:
Wolfgang Jeltsch g9ks1...@acme.softbase.org writes:
By the way, the documentation of Control.Category says that a category is
a monoid (as far as I remember). This is wrong. Category laws correspond
to monoid laws but monoid composition is
Am Dienstag, 17. März 2009 11:49 schrieb Yandex:
data (a :=: a') where
Refl :: a :=: a
Comm :: (a :=: a') - (a' :=: a)
Trans :: (a :=: a') - (a' :=: a'') - (a :=: a'')
I don’t think, Comm and Trans should go into the data type. They are not
axioms but can be proven. Refl says that each
Hi all,
I’m trying to make the Teapot OpenGL example in Haskell on Windows. It keeps
coming up with this:
C:\Users\Mark\workspace2\OpenGLPractice\srcghc --make Teapot
Linking Teapot.exe ...
C:\ghc\ghc-6.10.1\gcc-lib\ld.exe: cannot find -lSM
collect2: ld returned 1 exit status
As
Yitzchak Gale ha scritto:
[...]
While I think Oleg's tree method is beautiful, in practice
it may be re-inventing the wheel. I haven't tested it, but
I doubt that this implementation is much better than
using the classical shuffle algorithm on an IntMap.
Do you have a working implementation?
Hi,
How can I check which thunks are piling up on the stack?
Günther
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
So that first step already relies on IO (where the two are equivalent).
Come again?
The first step in your implication chain was (without the return)
throw (ErrorCall urk!) = 1
== evaluate (throw (ErrorCall urk!)) = evaluate 1
but, using evaluation only (no context-sensitive IO), we
I spoke to a faculty member in a decent Computer Science
department in which no one has ever done anything
related to FP. (You may say that is an inherent contradiction,
but what can I do, the department does have a good
reputation. I am withholding names to protect the
innocent.)
This faculty
Hi there!
I updated a couple of logo versions and ungrouped and regrouped the
(former) number 31. Other than that, there was nothing standing in
the way of the voting to begin imho, so I started up the competition.
By now, I suppose everybody should have received their ballot. If you
I am happy to announce libffi 0.1, binding to the C library
libffi, allowing C functions to be called whose types are not
known before run-time.
Why?
Sometimes you can't use the haskell foreign function interface
because you parse the type of the function from somewhere else,
i.e. you're writing
Eelco Lempsink wrote:
Hi there!
I updated a couple of logo versions and ungrouped and regrouped the
(former) number 31. Other than that, there was nothing standing in the
way of the voting to begin imho, so I started up the competition.
By now, I suppose everybody should have received
Hi Haskelleers
Has anybody written a SQL parser in Haskell (and is willing to share the
code) ?
Greetings,
Mads Lindstrøm
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Dear Planet Haskell readers,
Just want to apologize for spamming Planet Haskell. I did some minor
formatting edits of old posts and it seems Planet Haskell picked them
up and republished them. I didn't expect this to happen (Google Reader
doesn't do that) and will be more careful about
On 17/03/2009, at 10:59 PM, Yitzchak Gale wrote:
I would like some links that would give such a person
a nice overview of the various active areas of
FP-related research these days, leaning towards
Haskell. I want to give him a fairly broad view of what
is interesting and exciting, why various
I would like some links that would give such a person
a nice overview of the various active areas of
FP-related research these days, leaning towards
Haskell.
It seems the History of Haskell paper would be useful for background and
pointers to further reading on the research that has led
Hi Haskelleers
Has anybody written a SQL parser in Haskell (and is willing to share the
code) ?
Greetings,
Mads Lindstrøm
I have a mostly-working SQL parser that I wrote to help with DBA tasks
at work. I'm under one of the standard employment IP agreements,
however, so my employer owns
On Tue, 17 Mar 2009 15:24:28 +0100
Heinrich Apfelmus apfel...@quantentunnel.de wrote:
A simple majority vote is clearly inadequate for this vote, but I'm
afraid that without assisting technology (instant and visual
feedback), the voting process will more or less deteriorate to that
due to the
On 17 Mar 2009, at 15:24, Heinrich Apfelmus wrote:
Eelco Lempsink wrote:
Hi there!
I updated a couple of logo versions and ungrouped and regrouped the
(former) number 31. Other than that, there was nothing standing in
the
way of the voting to begin imho, so I started up the competition.
On Tue, 17 Mar 2009 16:11:54 +0100
Thomas Davie tom.da...@gmail.com wrote:
I have to agree that the UI for voting is not the best I've ever
seen. On the other hand, it's pretty easy to select the few logos
that you like, and push them all to the top, select the ones you'd
accept, and
I am also concerned that the default behaviour of the buttons will
lead to arbitrary preference rankings favouring those with entries
that start more towards the top or bottom of the list. You shouldn't
have to go to a lot of extra effort to create a tie between several
entries, if you can't
On Tue, 2009-03-17 at 13:06 +0100, Wolfgang Jeltsch wrote:
Am Dienstag, 17. März 2009 10:54 schrieben Sie:
Wolfgang Jeltsch g9ks1...@acme.softbase.org writes:
By the way, the documentation of Control.Category says that a category is
a monoid (as far as I remember). This is wrong. Category
And we thought butterfly ballots were bad.
I just went through the logo page and wrote down my favorite 20 logos in one
column, and gave them a rank in the other. Then translated that into the
voting list using the combo boxes (not the buttons). The total process took
20 minutes.
I am on FF3 on
2009/3/17 Eelco Lempsink ee...@lempsink.nl:
Hi there!
I updated a couple of logo versions and ungrouped and regrouped the (former)
number 31. Other than that, there was nothing standing in the way of the
voting to begin imho, so I started up the competition.
By now, I suppose everybody
2009/3/11 Mark Spezzano mark.spezz...@chariot.net.au:
I’m very familiar with the concept of Design Patterns for OOP in Java and
C++. They’re basically a way of fitting components of a program so that
objects/classes fit together nicely like Lego blocks and it’s useful because
it also provides
On 17 mrt 2009, at 15:24, Heinrich Apfelmus wrote:
Eelco Lempsink wrote:
I updated a couple of logo versions and ungrouped and regrouped the
(former) number 31. Other than that, there was nothing standing in
the
way of the voting to begin imho, so I started up the competition.
Thanks for
On 17 mrt 2009, at 16:33, Rick R wrote:
I just went through the logo page and wrote down my favorite 20
logos in one column, and gave them a rank in the other. Then
translated that into the voting list using the combo boxes (not the
buttons). The total process took 20 minutes.
Yeah, the
Because Haskell is not OO, it is functional, I was
wondering if there is
some kind of analogous design pattern/template type concept that
describe commonly used functions that can be factored out
in a general
sense to provide the same kind of usefulness that Design
Patterns do for
On 17 mrt 2009, at 16:34, Gwern Branwen wrote:
Can we assume that the next round will be more like 10?
Depends a bit on the outcome. There will be one winner, and depending
on the winner there might be a number of variations we want to vote
about. Only if it's a really really close call
Hi.
I'm checking if it possible to build an executable from C source files only.
As an example:
#include stdio.h
int main () {
printf(hello world\n);
return 0;
}
$ghc --make foo.c
However this only produces the object file, foo.o; it does not build the
executable file.
What is
Works for me without the --make, as `ghc foo.c`
--A
On Tue, Mar 17, 2009 at 6:32 PM, Manlio Perillo
manlio_peri...@libero.it wrote:
Hi.
I'm checking if it possible to build an executable from C source files only.
As an example:
#include stdio.h
int main () {
printf(hello world\n);
Anton Tayanovskyy ha scritto:
Works for me without the --make, as `ghc foo.c`
For me, too, thanks.
Manlio
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
You know, I hear theres this brilliant program for compiling C code --
gcd? ccg? gcc, yah gcc... Anyone tried it?
In all seriousness though, why do you need to compile c with ghc? I'm
curious, it seems a bit pointless...
/Joe
Manlio Perillo wrote:
Anton Tayanovskyy ha scritto:
Works for
Hello,
I installed ghci on my work Windows machine. If I do a :m +Data.Word,
everything is OK. If I a :m +Data.Binary, can't be found. Why?
Regards, Vasili
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Do you have Data.Binary installed? If not, it is available from
Hackage at:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/binary
Hopefully this will help.
-John
2009/3/17 Galchin, Vasili vigalc...@gmail.com
Hello,
I installed ghci on my work Windows machine. If I do a :m
On Tue, Mar 17, 2009 at 11:39:05AM +0100, Martijn van Steenbergen wrote:
{-# LANGUAGE GADTs #-}
{-# LANGUAGE TypeOperators #-}
module Eq where
data (a :=: a') where
Refl :: a :=: a
class Eq1 f where
eq1 :: f a - f a' - Maybe (a :=: a')
class Eq2 f where
eq2 :: f a b - f a' b' -
Yhc used to do this (when you could still build it). Turns out that on
Windows using gcc that gets installed with ghc isn't particularly fun,
while ghc makes a very pleasant build experience. Something to do with
directory layouts, head file searching, and what is on the %PATH% by
default.
Thanks
Joe Fredette ha scritto:
You know, I hear theres this brilliant program for compiling C code --
gcd? ccg? gcc, yah gcc... Anyone tried it?
In all seriousness though, why do you need to compile c with ghc? I'm
curious, it seems a bit pointless...
It's for a possible extension I'm planning
On Tue, Mar 17, 2009 at 5:06 AM, Wolfgang Jeltsch
g9ks1...@acme.softbase.org wrote:
What is a “generalized monoid”? According to the grammatical construction
(adjective plus noun), it should be a special kind of monoid
There's no such implication in English. The standard example used by
On Tue, Mar 17, 2009 at 10:30 AM, Brent Yorgey byor...@seas.upenn.edu wrote:
I don't understand your classes Eq1, Eq2, and Eq3. How would you make
an instance of Eq1 for, say, [] ?
You don't.
It seems you are confusing _value_ equality with _type_ equality? A
value of type a :=: a' is a
The first glimpse of this vote scared me so much that I've closed the
page, stopped the browser and shut my computer down.
On 17 Mar 2009, at 16:06, Eelco Lempsink wrote:
Hi there!
I updated a couple of logo versions and ungrouped and regrouped the
(former) number 31. Other than that,
2009/3/16 ChrisK hask...@list.mightyreason.com:
Let me open the discussion with all the questions I can quickly ask:
What should the subRegex function do, exactly?
(Single replacement,global replacement,once per line,...)
Try to do the same thing as =~ s/../../ in perl.
For a version 1:
Hi,
Even worse, the buttons for moving items up and down are buggy - at
least on my browser (Firefox 3.1 beta 2 on Linux). They sometimes
reorder my other votes! Even assuming that the list box code is not
buggy (which I now doubt), not being able to use the buttons makes this
form almost
(correction of the example)
(105: ) (106: A) (107: X,B) (108: C,D) (109: E ) (110: )
moving down X will result in either
(105: A) (106: B) (107: X ) (108: C,D) (109: E ) (110: )
or equivalently
(105: ) (106: A) (107: B ) (108: X ) (109: C,D) (110: E)
QED
2009/3/17 Daniel Schüssler anotheraddr...@gmx.de
(correction of the example)
(105: ) (106: A) (107: X,B) (108: C,D) (109: E ) (110: )
moving down X will result in either
(105: A) (106: B) (107: X ) (108: C,D) (109: E ) (110: )
or equivalently
(105: ) (106: A) (107: B )
On Tuesday 17 March 2009 21:03:21 Rick R wrote:
QED
Hmm? Maybe if confusingness was to be demonstrated, but not bugginess. Both
possibilities will result in the same total preordering (defined by (x
`betterThanOrEq` y) iff (numberInCombobox x = numberInCombobox y)), and
(AFAIK) only this
Hello,
http://www.power.org/resources/devcorner/cellcorner Is there
project to port GHC to the Cell? Seems like a really cool challenge.
Regards, Vasili
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Tue, Mar 17, 2009 at 6:14 AM, Wolfgang Jeltsch
g9ks1...@acme.softbase.org wrote:
Am Dienstag, 17. März 2009 11:49 schrieb Yandex:
data (a :=: a') where
Refl :: a :=: a
Comm :: (a :=: a') - (a' :=: a)
Trans :: (a :=: a') - (a' :=: a'') - (a :=: a'')
I don’t think, Comm and
On Tue, Mar 17, 2009 at 04:03:21PM -0400, Rick R wrote:
QED
Only relative ordering matters for condorcet, not the absolute rank.
e.g., ranking A, B and C rank 1, and
D, E and F rank 6
is exactly the same as ranking
e.g., ranking A, B and C rank 2, and
D, E and F rank
On Tue, 17 Mar 2009 20:34:12 +0100
Daniel Schüssler anotheraddr...@gmx.de wrote:
Hi,
Even worse, the buttons for moving items up and down are buggy - at
least on my browser (Firefox 3.1 beta 2 on Linux). They sometimes
reorder my other votes! Even assuming that the list box code is not
Sorry for newcomer silly question, but where is the voting page located?
Thanks,
Karel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, 17 Mar 2009 20:34:12 +0100
Daniel Schüssler anotheraddr...@gmx.de wrote:
Hi,
Even worse, the buttons for moving items up and down are buggy - at
least on my browser (Firefox 3.1 beta 2 on Linux). They sometimes
reorder my other votes! Even assuming that the list box code is not
On Tue, 17 Mar 2009 20:34:12 +0100
Daniel Schüssler anotheraddr...@gmx.de wrote:
Hi,
Even worse, the buttons for moving items up and down are buggy - at
least on my browser (Firefox 3.1 beta 2 on Linux). They sometimes
reorder my other votes! Even assuming that the list box code is not
On Tue, 17 Mar 2009 20:34:12 +0100
Daniel Schüssler anotheraddr...@gmx.de wrote:
Hi,
Even worse, the buttons for moving items up and down are buggy - at
least on my browser (Firefox 3.1 beta 2 on Linux). They sometimes
reorder my other votes! Even assuming that the list box code is not
On Tue, 2009-03-17 at 12:40 +, Claus Reinke wrote:
So that first step already relies on IO (where the two are equivalent).
Come again?
The first step in your implication chain was (without the return)
throw (ErrorCall urk!) = 1
== evaluate (throw (ErrorCall urk!)) = evaluate
1 - 100 of 131 matches
Mail list logo
