#972: hWaitForInput documentation is wrong
--+-
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: closed
Priority: normal|
Christian Maeder wrote:
3. the happy-1.15 sources can not be compiled due to
http://haskell.org/ghc/docs/6.6/html/users_guide/release-6-6.html
#
The HasBounds class has been removed from Data.Array.Base, and its
bounds method is now in the IArray class. The MArray class has also
gained a
#983: canonicalizePath only works in GHC
+---
Reporter: Neil Mitchell | Owner:
Type: bug | Status: new
Priority: normal | Milestone:
Component:
#984: Syntax error shows in the wrong position
--+-
Reporter: guest | Owner:
Type: bug | Status: new
Priority: low |
#983: canonicalizePath only works in GHC
+---
Reporter: Neil Mitchell | Owner:
Type: bug | Status: new
Priority: normal | Milestone:
Component:
#991: -O option doesn't deal with par well
-+--
Reporter: [EMAIL PROTECTED] | Owner:
Type: bug | Status: closed
Priority: normal |
#983: canonicalizePath only works in GHC
+---
Reporter: Neil Mitchell | Owner:
Type: bug | Status: closed
Priority: normal | Milestone:
Component:
#971: Add intercalate to Data.List
+---
Reporter: josef | Owner:
Type: proposal| Status: closed
Priority: normal | Milestone:
Component:
#992: Database support
--+-
Reporter: [EMAIL PROTECTED] | Owner:
Type: feature request| Status: new
Priority: normal | Milestone:
Component: libraries
Seth Kurtzberg [EMAIL PROTECTED] writes:
how about searching code that's outside of the standard library? Hoogle
doesn't seem to know about HaXml, or haskelldb for example (maybe I am
missing something obvious)
You want to distinguish between capabilities, and the fact that the
On Mon, Nov 06, 2006 at 05:21:04PM +, Ross Paterson wrote:
Apart from that, the only thing wrong with seq is its name.
I take back that part. Simon's strong hint suggestion looks like a
good idea. It's just one of a number of implicit assumptions we make
about operational behaviour. After
On Mon, Nov 06, 2006 at 12:53:55PM +, Simon Marlow wrote:
Incedentally, this is also one reason I think lazy I/O is a wart (despite
its obvious usefulness): because it necessarily requires talking about
evaluation order.
What is lazy output? Buffering?
Malcolm Wallace wrote:
Ross Paterson [EMAIL PROTECTED] wrote:
When I've used seq, it's to ensure that a function is strict in that
argument, and therefore has been evaluated before the function is
called. (If the language had unlifted types, I might have used those
instead). Beyond that, I
Christian Maeder wrote:
Did someone run the test-suite of the binary distributions?
http://www.haskell.org/ghc/dist/6.6/ghc-6.6-ppc-apple-darwin.tar.gz
http://www.haskell.org/ghc/dist/6.6/ghc-6.6-i386-apple-darwin.tar.bz2
I've build a (ppc-) mac-distribution from sources and my results are
Frederik Eaton wrote:
Hello,
I have a proposal for ghc. I think that it should take a new option,
say --make-command. This will specify a command to be run whenever a
source file is read in by ghc. The command will be passed an argument,
which is the name of the source file. The idea is that
John Meacham wrote:
I would definitely like something like this.
like
{-# PREPROCESS drift-ghc #-}
to specify the file should be preprocced by drift-ghc.
I worry that putting details of the build procedure into the source file will
lead to problems. Often build parameters need to be
The {-# ORIGIN ... #-} keyword sounds like a nice solution, but
wouldn't it require creating each generated file initially by hand, so
that the compilers know that it exists? I'd rather have a build system
where I can delete all of the generated files before distributing my
code, and still have
Hi Neil,
I've seen hoogle and I like it. Does Hoogle have the following
features?
- ability to index any library
- ability to use from the console
- command-line autocompletion
Of course, there are many features that Hoogle has, which my program
is missing.
Frederik
On Tue, Nov 07, 2006 at
Simon Marlow schrieb:
ghcpkg01(normal)
ghcpkg03(normal)
Any idea why these are failing for you?
Maybe rather than using my installed ghc-pkg (that lists haskell-src)
some inplace ghc-pkg was used:
ghc-pkg: dependency haskell-src doesn't exist (use --force to override)
make[2]: ***
Hi
- ability to index any library
Yes, runhaskell Setup haddock -hoogle will generate a hoogle database
for any library. Hoogle 4 (currently in development) will make
searching multiple libraries much much easier.
- ability to use from the console
Yes, although may currently be a bit
Since you already have a Makefile, why not add this to it:
SRCS = Source.hs ...
prog: $(SRCS)
ghc --make $(SRCS) -o prog
and then just say 'make' to build your program? Surely that's easier than
typing 'ghc
--make-command=make ...'? Maybe I'm missing something?
Hi Simon,
I
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf
Of Neil Mitchell
- command-line autocompletion
No, how do I add it? I use Windows which doesn't support this, but if
someone gives me the technical details of how to do it, I'm sure I can
add it.
How would it work on Unix?
Simon Marlow [EMAIL PROTECTED] wrote:
When I use `seq`, it is sometimes in a construction like
unsafePerformIO (emit squawk!) `seq` x
My take on this kind of thing is that if you want a specific
operational behaviour, then you're doing something
implementation-specific. We
Hi
How would it work on Unix? I assume that the command-line program just
takes it's input from the command line, so it doesn't get invoked
until after you've finished typing the command...
Unless this is a proposal to create a console version of hoogle, a bit
like ghci, which could take
Hello,
I had this example that was working with earliest versions of GHC but
it doesn't work with GHC-6.6.
$(deriveReflectable ''[])
Above this isn't a double quote but two single quotes. It may not be
clear with some fonts. Is this a bug or just there is a change in the
syntax? The error that
Hi
How would it work on Unix? I assume that the command-line program just
takes it's input from the command line, so it doesn't get invoked
until after you've finished typing the command...
Not necessarily true if completion is involved ... see below.
However, I know that zsh can do funky
| This is great! However, I don't understand why:
| 'incL_afU',
| '$dNum_alp',
| 'fromInteger_alm',
| 'lit_al2' and
| '+_al3' are all listed under the same letrec?
The desugarer simply does whatever is easiest, leaving it to the simplifier to
untangle the resulting dependencies. Doubtless we
Yes, I know command line completion works - but only for files, not
for anything else, and there is no way to make it work for other
things. However, I know that zsh can do funky things like
autocompleting ssh paths etc - and I think I remember seeing that
there was some way a program could
Hi
Anyway, you say you are working on a command line interface - OK, but
I think the current situation is just a bit embarrassing, and I have
something that works now. I can access all Perl documentation with
'man', and that is very convenient. It is just two words, e.g.:
Fair enough, you are
On Tuesday 07 November 2006 16:30, Simon Peyton-Jones wrote:
The bit that does the dependency analysis is called the Occurrence
Analyser. Its in compiler/simplCore/OccAnal. A single run of the
occurrence analyser will produce a fully-dependency-analysed program. Maybe
that's what you want?
Hello glasgow-haskell-users,
in the following definitions:
{-# INLINE getInteger #-}
getInteger = ... -- large definition that will be not inlined
-- without pragma
instance Binary Integer where
get = getInteger
is Integer.get will be inlined or not?
--
Best regards,
GTTSE 2007, 02-07 July, 2007, Braga, Portugal
2nd International Summer School on
Generative and Transformational Techniques in Software Engineering
http://www.di.uminho.pt/GTTSE2007
SCOPE AND FORMAT
The summer school brings together PhD students, lecturers, technology
presenters, as
[We apologise for multiple copies.]
TASE 2007
1st IEEE IFIP International Symposium
on
Theoretical Aspects of Software Engineering
June 6 - 8, 2007, Shanghai,
China
http://www.sei.ecnu.edu.cn/TASE2007/
Call For
Papers
Submission Deadline: January 5,
Hi,
I am pleased to announce Hoogle Command Line version 3 Beta, an
alternative to the Hoogle website (http://haskell.org/hoogle)
If you don't know what Hoogle is, go to the website above and have a
play - it searches for Haskell functions by name and by type
signature.
There are two versions
---
Haskell Weekly News
http://haskell.org/haskellwiki/HWN
Issue 48 - November 08, 2006
---
Welcome to issue 48 of HWN, a weekly newsletter covering
Thank you so much Eric. That helps a lot!On 10/29/06, Eric Y. Kow [EMAIL PROTECTED] wrote:
On Sun, Oct 29, 2006 at 22:04:44 -0800, Sukit Tretriluxana wrote: I saw someone posting a comment (http://sequence.complete.org/node/214) about the build of wxHaskell for GHC
6.6 and wxWidget 2.6.2 but it's
On Mon, 6 Nov 2006, Bulat Ziganshin wrote:
Hello Henning,
Monday, November 6, 2006, 1:27:54 PM, you wrote:
print msg `on` mode==debug
but failed because my code frequently contains '$' and there is no way
to define operation with a lower precedence
This could be solved by the
But DEC's language FOCAL had fractional line numbers. :)
On Nov 7, 2006, at 06:00 , Henning Thielemann wrote:
On Mon, 6 Nov 2006, Bulat Ziganshin wrote:
Hello Henning,
Monday, November 6, 2006, 1:27:54 PM, you wrote:
print msg `on` mode==debug
but failed because my code frequently
On Tue, 7 Nov 2006, Simon Marlow wrote:
I'd support fractional and negative fixity. It's a simple change to
make, but we also have to adopt
http://hackage.haskell.org/cgi-bin/haskell-prime/trac.cgi/wiki/FixityResolution
I've added the proposal to the end of that page. In fact, the page
Tue Nov 7 08:10:45 PST 2006 Simon Marlow [EMAIL PROTECTED]
* make it work with recent GHCs
M ./tools/Makefile -3 +2
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-prime
Tue Nov 7 08:11:17 PST 2006 Simon Marlow [EMAIL PROTECTED]
* update to compile with recent Haskell compilers
M ./tools/tex.hs -5 +3
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-prime
Tue Nov 7 08:13:22 PST 2006 Simon Marlow [EMAIL PROTECTED]
* subsection needs to be interpreted by sh
M ./report/Makefile -1 +1
___
Haskell-prime mailing list
Haskell-prime@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-prime
Tue Nov 7 08:22:46 PST 2006 Simon Marlow [EMAIL PROTECTED]
* fix line-comment syntax to not consider '--:' as a comment
See LineCommentSyntax on the wiki, ticket #42
M ./report/syntax-lexical.verb -1 +1
___
Haskell-prime mailing list
Henning Thielemann wrote:
On Tue, 7 Nov 2006, Simon Marlow wrote:
I'd support fractional and negative fixity. It's a simple change to
make, but we also have to adopt
http://hackage.haskell.org/cgi-bin/haskell-prime/trac.cgi/wiki
/FixityResolution
I've added the proposal to the end of
Henning Thielemann wrote:
On Tue, 7 Nov 2006, Simon Marlow wrote:
I'd support fractional and negative fixity. It's a simple change to
make, but we also have to adopt
http://hackage.haskell.org/cgi-bin/haskell-prime/trac.cgi/wiki/FixityResolution
I've added the proposal to the end of that
On 07/11/06, Jon Fairbairn [EMAIL PROTECTED] wrote:
I must say though, that I don't like the reasoning that we
can put in fractional fixities because it's a small
change. The way to hell is through a series of small
steps. If using integers to express fixities is a bit of a
hack, switching to
On Nov 7, 2006, at 11:47 , [EMAIL PROTECTED] wrote:
Henning Thielemann wrote:
On Tue, 7 Nov 2006, Simon Marlow wrote:
I'd support fractional and negative fixity. It's a simple change to
make, but we also have to adopt
http://hackage.haskell.org/cgi-bin/haskell-prime/trac.cgi/wiki/
On Tuesday 07 November 2006 17:32, Lennart Augustsson wrote:
On Nov 7, 2006, at 11:47 , [EMAIL PROTECTED] wrote:
Henning Thielemann wrote:
On Tue, 7 Nov 2006, Simon Marlow wrote:
I'd support fractional and negative fixity. It's a simple change to
make, but we also have to adopt
I started this e-mail thread on HaskellCafe instead of HaskellPrime
because it was minimal, backwards-compatible, valid Haskell 98 (or very
nearly so) and could go (now) into GHC if someone saw fit to put it in.
If you think C++ is not overly complicated, just what is a protected
abstract
by all means, lets have warm fuzzy precedence declarations
infix(nearly right) (exp (2*i*pi) + 1) :-)
infix(mostly left) (((\x-cos x + i*(sin x)) (2*pi)) + 1) (-:
who says that all the fun has to start in the type system?-)
we would probably need to refer to hyperreals, in order to
On Mon, 6 Nov 2006, Bulat Ziganshin wrote:
Hello Henning,
Monday, November 6, 2006, 1:27:54 PM, you wrote:
print msg `on` mode==debug
but failed because my code frequently contains '$' and there is no way
to define operation with a lower precedence
This could be solved by the
There should be a separate, moderated Haskell-announcements list. I
filter out haskell-cafe into a folder and read it separately from my
main inbox, but I'd like to have important announcements directly into
my inbox, and haskell@haskell.org still has some chatty
questions-and-answers sessions.
But DEC's language FOCAL had fractional line numbers. :)
On Nov 7, 2006, at 06:00 , Henning Thielemann wrote:
On Mon, 6 Nov 2006, Bulat Ziganshin wrote:
Hello Henning,
Monday, November 6, 2006, 1:27:54 PM, you wrote:
print msg `on` mode==debug
but failed because my code frequently
Hi all,
I'd like to announce that we have a new team of maintainers in place
for wxHaskell, so we're hoping that this list will see a significant
increase in activtiy in the future.
We have several near-term objectives, which will likely occur in
roughly the order below:
* Pull together all of
On Mon, 6 Nov 2006, alex wrote:
I originally did this screencast a while ago for a 6 minute constrained
talk which explains why it's so short. This was about my first Haskell
program, I've progressed some since this experiment and will make a new
screencast soon.
I also tried to create
This message seems to have lingered in obscuriy for a while, I only just
received it.
What about
permLev :: Int - (a - a - a) - [a] - [a]
permLev 0 _ _ = []
permLev 1 _ xs = xs
permLev k f xs
= do x - xs
y - permLev (k-1) f xs
return (f x y)
l1 :: [(String,Double)]
l1 =
Hello Diego,
Tuesday, November 7, 2006, 3:27:51 PM, you wrote:
There should be a separate, moderated Haskell-announcements list. I
you can also read Haskell Weekly News for this purpose
--
Best regards,
Bulatmailto:[EMAIL PROTECTED]
Hello Jeremy,
Friday, October 27, 2006, 7:12:44 PM, you wrote:
I'd ask the community to send patches via this list.
i suggest to use [EMAIL PROTECTED] for this purpose. at least
other libs maintained there
--
Best regards,
Bulatmailto:[EMAIL PROTECTED]
Hello Nuno,
Monday, October 30, 2006, 8:45:24 PM, you wrote:
What am i coding in specific? I receive a list in the form:
-- l1 is a pair of the identifier and the associated probability
l1 = [(A,0.6),(B,0.2)]
I must return the permutation with k levels; for example:
[EMAIL PROTECTED] wrote:
Hello Dan,
Saturday, November 4, 2006, 5:07:15 AM, you wrote:
Here's an idea that (I think) is useful and backwards compatible:
fractional and negative fixity.
yes, i think the same. for example, once i've tried to define postfix
'when' operator like those in
Diego Navarro [EMAIL PROTECTED] writes:
There should be a separate, moderated Haskell-announcements list. I
filter out haskell-cafe into a folder and read it separately from my
main inbox, but I'd like to have important announcements directly into
my inbox, and haskell@haskell.org still has
What you're trying to do is called permutations with repetition, whereas
permutations (unqualified) usually refers to permutations without repetition
(and that's what the Haskell code you found is doing).
See http://en.wikipedia.org/wiki/Permutations_and_combinations
To get the result you
I'm curious about the implementation of bang patterns, and the
implications for performance. Previously on this list, Lemmih has
pointed out that throwing in an extra `seq` here and there to force
strictness is a bad idea, unless you do it very carefully. He points
out that the strictness
Having thought longer about it, it seems to be an issue with
functional dependencies and overlapping instances.
Perhaps, because an overlapping instance may be defined in some other
module which would trump the Iso instance for Either, the type
inference mechanism cannot commit to the instance
On Tue, 7 Nov 2006, Simon Marlow wrote:
I'd support fractional and negative fixity. It's a simple change to
make, but we also have to adopt
http://hackage.haskell.org/cgi-bin/haskell-prime/trac.cgi/wiki/FixityResolution
I've added the proposal to the end of that page. In fact, the page
Henning Thielemann wrote:
On Tue, 7 Nov 2006, Simon Marlow wrote:
I'd support fractional and negative fixity. It's a simple change to
make, but we also have to adopt
http://hackage.haskell.org/cgi-bin/haskell-prime/trac.cgi/wiki
/FixityResolution
I've added the proposal to the end of
On Tue, 7 Nov 2006, Simon Marlow wrote:
This is a much more heavyweight change, and its not a clear win.
Haskell 2 ? :-)
If you'd like to make a concrete proposal, then feel free to do so and
I'll make sure it gets onto the wiki.
What about the one of Jón Fairbairn ?
On 2006-11-07 at 18:30+0100 Henning Thielemann wrote:
On Tue, 7 Nov 2006, Simon Marlow wrote:
This is a much more heavyweight change, and its not a clear win.
Haskell 2 ? :-)
If you'd like to make a concrete proposal, then feel free to do so and
I'll make sure it gets onto the wiki.
On Wednesday 08 November 2006 05:41, DavidA wrote:
To get the result you want, take the list of (letter, probability) pairs,
and generate the Cartesian product of k copies of itself.
cartProd 0 xs = [[]]
cartProd k xs = [x:ys | x - xs, ys - cartProd (k-1) xs]
The result is all sequences of
On Wednesday 08 November 2006 08:23, Daniel McAllansmith wrote:
Ahhh, whoops. It seems that lack of compilation errors is not a universal
sign that a haskell program is correct.
permute 0 d = mkD []
mkD doesn't allow distributions with 0 sum probabilities, so you'd need to
restrict the
On Tue, 2006-11-07 at 14:29 +0100, Henning Thielemann wrote:
I also tried to create some music with the SuperCollider wrapper by Rohan
Drape and the Haskore music package.
That's great, I have used the OSC part of the wrapper but not the rest,
and haven't looked at Haskore yet but have some
Hello all,
I suggest [EMAIL PROTECTED], the GUI task force mailing list; nothing is
going on there at the moment, but it seems the most appropriate list.
On Tue, 07 Nov 2006 14:52:24 +0100, Bulat Ziganshin
[EMAIL PROTECTED] wrote:
Hello Jeremy,
Friday, October 27, 2006, 7:12:44 PM,
On 07/11/06, Jon Fairbairn [EMAIL PROTECTED] wrote:
I must say though, that I don't like the reasoning that we
can put in fractional fixities because it's a small
change. The way to hell is through a series of small
steps. If using integers to express fixities is a bit of a
hack, switching to
I don't see how it's too complex. Isn't
infixl ??
prec ?? $
(??) = whenOperator
exactly what you want to say?
Sure you can solve the problem with negative fixities, but that's less
expressive than the above (the total order is actually an
over-specification). You want ?? to bind more
Let's remember that if something is broke, it's only _right_ to _fix_
it. I patiently waited for someone else to make that pun.
Understanding the language won't be much harder, but understanding
fixity declarations will become a task. Consider:
infixl -1.7521 -- what and why?
As the operator
On Nov 7, 2006, at 11:47 , [EMAIL PROTECTED] wrote:
Henning Thielemann wrote:
On Tue, 7 Nov 2006, Simon Marlow wrote:
I'd support fractional and negative fixity. It's a simple change to
make, but we also have to adopt
http://hackage.haskell.org/cgi-bin/haskell-prime/trac.cgi/wiki/
I started this e-mail thread on HaskellCafe instead of HaskellPrime
because it was minimal, backwards-compatible, valid Haskell 98 (or very
nearly so) and could go (now) into GHC if someone saw fit to put it in.
If you think C++ is not overly complicated, just what is a protected
abstract
David House wrote:
Also, it provides an infinite space for fixities. I think the problem
'binds tighter than X but not as tight as Y', where X and Y are only
fixity integer apart is somewhat common, and this would fix it. It
would allow for extensibility into the future, where the operator
by all means, lets have warm fuzzy precedence declarations
infix(nearly right) (exp (2*i*pi) + 1) :-)
infix(mostly left) (((\x-cos x + i*(sin x)) (2*pi)) + 1) (-:
who says that all the fun has to start in the type system?-)
we would probably need to refer to hyperreals, in order to
79 matches
Mail list logo
