On 02/22/2011 11:45 AM, Magnus Therning wrote:
1. Fully functional go-to-definition. With that I mean that
go-to-definition is aware of local definitions introduced in 'let' and
'where' clauses and ideally also for names bound in 'do' clauses.
I've found there are several ways to generate a
On 02/22/2011 12:26 PM, Marc Weber wrote:
learn about gd and gD those are not perfect though.
Also keep in mind that # * start searches on words.
They all are not language aware so they are only bad replacements for
what you're looking for.
When we are talking about such simple helpers then you
On 10/22/2010 09:37 AM, wren ng thornton wrote:
On 10/21/10 5:38 AM, Ketil Malde wrote:
I'm always getting two copies of everything in haskell@, since
everything is cross-posted to -cafe. Are there actually people
subscribed to -cafe, but *not* to hask...@? And if so, why?
I am. In part
On 06/20/2010 11:05 AM, Claus Reinke wrote:
I think Luke means that if you use qualified names then hothasktags
can give you better location information than current ghci ctags.
GHCi :ctags doesn't output tags for qualified names (though it
probably should), but that isn't enough for proper
Hi Claus,
On 06/15/2010 05:57 PM, Claus Reinke wrote:
If you go this route, I will shamelessly promote hothasktags instead
of ghci. It generates proper tags for qualified imports.
What do you mean by proper here?
I think Luke means that if you use qualified names then hothasktags can
give
On 04/08/2010 01:09 AM, Luke Palmer wrote:
On Wed, Apr 7, 2010 at 1:23 AM, Evan Laforgeqdun...@gmail.com wrote:
Derive.PitchDeriver Derive/Derive.hs98;file:Cmd/Cmd.hs
Derive.PitchDeriver Derive/Derive.hs98;file:Cmd/Play.hs
Derive.PitchDeriver
On 04/07/2010 09:23 AM, Evan Laforge wrote:
On Thu, Apr 1, 2010 at 1:46 PM, Luke Palmerlrpal...@gmail.com wrote:
VIm only for now, since I don't know if emacs tags format supports
scoped tags. I am aware that it is not perfect -- patches and bug
reports welcome.
This program
On 04/02/2010 10:15 PM, Dominic Espinosa wrote:
On Fri, Apr 02, 2010 at 06:11:52PM +0100, Stephen Tetley wrote:
On 2 April 2010 17:53, Dominic Espinosadces...@fastmail.fm wrote:
I ended up rewriting it in another language (due to time
pressure) and I'm a little wary of attempting to use
I like your proposal. Few notes below.
On Sun, 05 Jul 2009 23:45:31 -0400, Isaac Dupree wrote:
My dream situation: both haddock-pages and hscolour-pages would be
super-hyperlinked and super-readable. For example, haddock would list
all a module's definitions, not just its exports. In
Andy Stewart wrote:
I saw GHC release new version now, and fix some bug.
I want to know below pacakges whether works fine with GHC-6.10.2 before i
upgrade it:
cabal, gtk2hs, xmonad, yi, leksah
Gtk2hs does not work with ghc 6.10.2 yet:
Colin Paul Adams wrote:
Adrian == Adrian Neumann aneum...@inf.fu-berlin.de writes:
Adrian You can use the ghci debugger
http://www.haskell.org/ghc/docs/latest/html/users_guide/ghci-
Adrian debugger.html
Adrian it can set breakpoints on exceptions.
So i tried adding the
Wolfgang Jeltsch wrote:
Am Mittwoch, 25. Februar 2009 23:38 schrieb Peter Hercek:
So my opinion (IAMNAL):
1) source code under very limiting commercial license (just to allow
recompile with a newer LGPL lib and nothing else) is OK
2) it is probable that only the *.o, *.hi files and a linking
Wolfgang Jeltsch wrote:
I want to repeat what I’ve said earlier on this list: For Haskell, there is no
real difference between LGPL and GPL, as far as I understand it. If you don’t
want to force the users of your library to use an open source license for
their work then use BSD3 or a similar
Peter Verswyvelen wrote:
On Wed, Feb 25, 2009 at 11:02 PM, Peter Hercek pher...@gmail.com wrote:
* An LGPL library will force commercial users to release their source code
only to the users of their program (which already bought it) and only for
the purpose of recompiling with a newer
wren ng thornton wrote:
Lacking a wiki account,
~wren
From HWN:
HaskellWiki Accounts. Ashley Yakeley can [12]create a HaskellWiki
account for anyone who wants one (account creation has been disabled as
a spam-fighting measure).
http://article.gmane.org/gmane.comp.lang.haskell.general/16846
Duncan Coutts wrote:
I've seen this occasionally. If you check gtk2hs-confg.h near the bottom
of the file you'll likely find something like
#def _GLIB_MAJOR_VERSION ()
rather than
#def _GLIB_MAJOR_VERSION (2)
It is ./configure that generates the gtk2hs-confg.h from
gtk2hs-confg.h.in based
Galchin, Vasili wrote:
I have a collection of functions .. but no main function. I am
reading Step Inside the GHCi debugger from Monad.Reader Issue 10 by
Bernie Pope. If I don't have a main function can I still use the ghci
debugger? (I tried to set a breakpoint on one of my functions
Hi,
Any idea why ghc 6.10.1 is still in Testing repository on archlinux?
Peter.
Don Stewart wrote:
Arch Haskell News: Jan 11 2009
--cut--
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
David Menendez wrote:
On Sun, Nov 16, 2008 at 7:09 PM, Luke Palmer [EMAIL PROTECTED] wrote:
On Sun, Nov 16, 2008 at 5:06 PM, Peter Hercek [EMAIL PROTECTED] wrote:
... and the only value the function can return is bottom.
Is there any type system which would have more than
one value which
Bulat Ziganshin wrote:
Hello J.,
Monday, November 17, 2008, 12:56:02 AM, you wrote:
class MyClass r where function :: r - s
As Bulat said, your type signature is equivalent to:
function :: forall r s. r - s
only
function :: forall s. r - s
(r is fixed in class header)
... and the
Did Yahoo Google groups add support for NNTP yet?
In past this did not work.
If it still does not work then this would be one reason
to prefer something which works with gmane.
Peter.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Andrew Coppin wrote:
(Ignore all references you see to enabling ANSI.SYS in your config.sys
file; this applies only to 16-bit MS-DOS programs, *not* to 32-bit
Windows programs.)
You can add interpretation of ansi escape sequences to any win32
program by launching the application through
Justin Bailey wrote:
2008/9/9 Pieter Laeremans [EMAIL PROTECTED]:
What 's the best equivalent haskell approach ?
thanks in advance,
Pieter
The preferred approach is to look at your code, figure out where you
are using tail (or could be calling something that uses tail) and use
the trace
Maurício wrote:
• It should show the complete syntax of
everything, not the most common. For instance,
‘case of’ should show the use of guards;
• It should be an example of valid code, not good
one. The idea is to show what can be done, not
what should :)
This can help you when you
Andrew Coppin wrote:
-- cut --
When compiled without optimisations, the pragma just causes an exception
to be thrown, rather like error does. When compiled with
optimisations, the whole case alternative is removed, and no code is
generated for it. (And if the impossible somehow happens...
Andrew Coppin wrote:
Until very recently, it was not at all clear to me that there is
actually a very simple solution to this problem:
import Text.ParserCombinators.Parsec as P
Now I only have to write P.runPaser, which is much shorter.
This fact probably needs to be mentioned more loudly -
Aaron Denney wrote:
This is drifting off-topic, but...
On 2008-06-03, Peter Hercek [EMAIL PROTECTED] wrote:
Aaron Denney wrote:
--- cut ---
Darcs patches are pretty much an implicit rebase.
You cannot push patch B if it depends on patch A without also
pushing A. And darcs currently does
Aaron Denney wrote:
On 2008-06-04, apfelmus [EMAIL PROTECTED] wrote:
-- cut --
Or the next-topic path relies on features from next that are not
present in master . But then, you're screwed anyway
Yep.
Well not really, depends what kind the dependency is, this kind of rebase
is useful
Aaron Denney wrote:
On 2008-06-03, Peter Hercek [EMAIL PROTECTED] wrote:
Loup Vaillant wrote:
2008/6/3 Darrin Thompson [EMAIL PROTECTED]:
--cut--
What's the appeal of this? I personally love git, but I thought all
the cool kids at this school used darcs and that was that.
Disclaimer: I'm
Peter Hercek wrote:
Achim Schneider wrote:
Haskell wins the wickedness of design contest by using [()] and [] as
truth values.
Maybe you wanted to say: ... by using [()] as True value and [] as
False value ... which does not seem that wicked (at least to me).
Oops sorry, missed you say
Achim Schneider wrote:
Peter Hercek [EMAIL PROTECTED] wrote:
Haskell wins the wickedness of design contest by using [()] and []
as truth values.
Maybe you wanted to say: ... by using [()] as True value and [] as
False value ... which does not seem that wicked (at least to me).
Strangely
Achim Schneider wrote:
-- That's the one I've been looking for. Remember that
-- return e = [e]
f = concatMap
(\x - concatMap
(\y - concatMap
(\_ - [(x,y)])
(if x*y == 8 then [()] else []))
[2..8])
[1..4]
Morale:
Abhay Parvate wrote:
I am not saying that it should claim it as soon as it is unused; all I
am saying that as soon as a priority object becomes unreferenced, it
should be the first choice for collecting in the next collect.
Further I was under the impression (I may be wrong) that it uses a
Cetin Sert wrote:
Is GHC required to be installed on the target OS I compile Haskell
binaries for in order for these binaries to run? I need a quick answer
on that!
No. Well possibly yes if you use GHC api (e.g. for compiling a haskel
code from your haskell application) but for common
Tim Chevalier wrote:
On 1/23/08, Peter Hercek [EMAIL PROTECTED] wrote:
Other things did not seem that great for me from the beginning. For
example: referential transparency - just enforces what you can take care
not to do yourself
...if you never make mistakes, that is.
(e.g. in C# you just
Here are things I liked most (compared with standard imperative
languages) when I started to learn functional programming:
* algebraic types with pattern matching work nicely as tagged unions;
doing a tagged union manually in C/C++/C# is a pain (there is no
automatic tag (provided you dismiss
Hi,
About 3 weeks ago I reported this bug to Jeff Newbern.
But I got no response - maybe I got filtered out as spam :)
Since it was not fixed I'm trying once more here. Maybe
there is somebody here who has access to the web site
http://www.haskell.org/all_about_monads and cares enough
to
Mads Lindstrøm wrote:
Andrew Coppin wrote:
Human kind has yet to design a programming language which eliminates all
possible bugs. ;-)
And we never will. See http://en.wikipedia.org/wiki/Halting_problem .
If you limit usage of general recursion (and rather favor structural
recursion) then
Joost Behrends wrote:
We read
data Pair a b = Pair a b
in YetAnotherHaskellTutorial. And that is all ! If we omit data here, this
would be a silly pleonasm. And no single word about this strange behavior of
data in every tutorial i read.
When learning a language, I find it useful to
Thomas Davie wrote:
Take a look at the Typable class. Although, pretty much any code that
you can compile can be loaded into ghci without modification, and that's
by far the easier way of finding the types of things.
Is there a way to make ghci to know also the symbols which are not
Luke Palmer wrote:
There was a thread about this recently.
In any case, if you load the code interpreted (which happens if there
is no .o or .hi file of the module lying around), then you can
look inside all you want. But if it loads compiled, then you only
have access to the exported symbols.
Andrew Coppin wrote:
(I suppose I could try writing a nop program and timing it. But
personally I don't have any way of timing things to that degree of
accuracy. I understand there are command line tools on Unix that will do
it, but not here.)
You can try for example this one
Tim Chevalier wrote:
Try the -Rghc-timing flag.
Interesting, that one does not work in my program compiled with
ghc 6.8.1 (looks like ghc runtime does not consume it but passes
it to my haskell code). +RTS -tstderr works but its usability is
limited since it provides only elapsed time and
Tim Chevalier wrote:
On 12/15/07, Peter Hercek [EMAIL PROTECTED] wrote:
Tim Chevalier wrote:
Try the -Rghc-timing flag.
Interesting, that one does not work in my program compiled with
ghc 6.8.1 (looks like ghc runtime does not consume it but passes
it to my haskell code). +RTS -tstderr
Peter Verswyvelen wrote:
When I start a windowed program (e.g. GLUT or GTK2Hs) from within GHCi,
my application’s window does not become the foreground window.
Is this on purpose?
This is just a guess, I do not really know :-)
Maybe your problem is focus stealing prevention, which is a
Simon Peyton-Jones wrote:
| Windows and Haskell is not a well travelled route, but if you stray of
| the cuddly installer packages, it gets even worse.
|
| But it shouldn't. Really it shouldn't. Even though Windows is not my
| preferred platform, it is by no means different enough to warrant
I'm curious what experts think too.
So far I just guess it is because of clean type system getting
better hints for optimizations:
* it is easy to mark stuff strict (even in function signatures
etc), so it is possible to save on unnecessary CAF creations
* uniqueness types allow to do
the problems
to a certain degree.
So the slowness of Haskell (compared to Clean) is consequence of
its type system. OK, I'll stop, I did not write Clean nor Haskell
optimizers or stuff like that :-D
Peter.
Peter Hercek wrote:
I'm curious what experts think too.
So far I just guess it is because
The site claims it is quite up to date:
about Haskell GHC
The Glorious Glasgow Haskell Compilation System, version 6.6
Examples are compiled mostly in the middle of this year and
at least -O was used. Each test has a log available. They
are good at documenting what they do.
Peter.
Peter
Derek Elkins wrote:
Try with rem instead of mod.
(What the heck is with bottom?)
The bottom was there by error and I was lazy to redo
the tests so I rather posted exactly what I was
doing. I do not know the compiler that good to be
absolutely sure it cannot have impact on result
... so I
Don Stewart wrote:
perfect :: [Int]
perfect = [i | i-[1..1], i == sum (divisors i)]
This should be a little faster , as sum will fuse,
perfect :: [Int]
perfect = [i | i-[1..1], i == sum' (divisors i)]
where sum' = foldr (+) 0
sum' did not help. Times are about the
Rodrigo Queiro wrote:
Why do you expose perfect and divisors? Maybe if you just expose main,
perfect and divisors will be inlined (although this will only save
10,000 function entries, so will probably have negligible effect).
I exposed them so that I can check types in ghci.
Hiding them does
is the reason, but the difference between Int, Int64
and Integer is not that dramatic as in example below, nevertheless, the
difference between GHC and GNU C++ is very bad :-\
Dusan
Peter Hercek wrote:
Derek Elkins wrote:
Try with rem instead of mod.
(What the heck is with bottom
Daniel Fischer wrote:
What perpetually puzzles me is that in C long long int has very good
performance, *much* faster than gmp, in Haskell, on my computer, Int64 is
hardly faster than Integer.
I tried the example with Int64 and Integer. The integer version
was actually quicker ... which is
Peter Hercek wrote:
C++ version times: 1.125; 1.109; 1.125
Int32 cpu times: 3.203; 3.172; 3.172
Int64 cpu times: 11.734; 11.797; 11.844
Integer cpu times: 9.609; 9.609; 9.500
Ooops, my results ware wrong (nonoptimizing ms cl
compiler used and I used -O instead of -O2 in ghc).
C++ version
Don Stewart wrote:
C++ version times: 1.109; 1.125; 1.125
Int32 cpu times: 1.359; 1.359; 1.375
Int64 cpu times: 11.688; 11.719; 11.766
Integer cpu times: 9.719; 9.703; 9.703
Great result from ghc.
What Haskell program were you using for this test? The original
naive/high level implementation?
Peter Hercek wrote:
MS cl.exe version 13.10.3077 (options /G7 /MD)
And I had cl options wrong too - I need to start to
optimize not only to set the optimization target.
/G7 /MD - 1.109; 1.125; 1.125
/Ox /G7 /MD - 0.922; 0.984; 0.984
Still it does not change the results too much
apfelmus wrote:
-+- Since ∀ and ∃ are clearly different, why does Haskell have only one
of them and even uses ∀ to declare existential types? The answer is the
following relation:
∃a.(a - a) = ∀b. (∀a.(a - a) - b) - b
So, how to compute a value b from an existential type ∃a.(a - a)?
Jon Fairbairn wrote:
A hyperlink of the form a
href=http://.../long-research-paper.html#interesting-paragraph;
interesting bit/a is far more useful than one of the form
a href=http://.../long-research-paper.pdf;look for
section 49.7.3/a. It may not seem significant, but when
one is attempting
Brandon S. Allbery KF8NH wrote:
On Oct 19, 2007, at 12:11 , Sebastian Sylvan wrote:
On 19/10/2007, Kalman Noel [EMAIL PROTECTED] wrote:
data ExistsNumber = forall a. Num a = Number a
I'm without a Haskell compiler, but shouldn't that be exists a.?
The problem is that exists is not
html too but if
pdf is required otherwise, it would be nice if link suppliers
would provide more precise links. To spread the information
that they can do so is the main reason I responded.
Peter.
Jon Fairbairn wrote:
Peter Hercek [EMAIL PROTECTED] writes:
Jon Fairbairn wrote:
A hyperlink
Hi,
I extended the hyperlinked Haskell 98 grammar so that each
production now contains also links to all the sections
in the online report which explicitly name it.
I needed it few times myself so I added it. Some people
expressed interest so they may want to check out the update.
Ronald Guida wrote:
Now for the hard questions.
1. How do I go about detecting space and time leaks?
2. Once I find a leak, how do I fix it?
3. Are there any programming techniques I can use to avoid leaks?
I'm hard time to believe I'll write something you do not know but
I had similar
Stefan O'Rear wrote:
You said 0% CPU. That's *very* important. It means that you are using
the threaded runtime (GHCi?), and that you triggered a blackhole. You
should be able to handle this by compiling your program with -prof (do
*not* use -threaded!), and running with +RTS -xc. With luck,
Jules Bean wrote:
I have no idea what you're talking about. It works fine on multiple lines:
f x = g
. transform displacement
. scale factor
$ x
is perfectly valid.
Yes, it is. It is not an issue if you prefer to indent based on previous line
instead of always by the same
not sound
bad to me either. So this sounds to me like weak argument compared
to disadvantages. There should be something else (I'm missing)
there too...
Thanks,
Peter.
Dan Piponi wrote:
On 8/30/07, Peter Hercek [EMAIL PROTECTED] wrote:
f x =
let x = x * scale in
let x = x + transform
Derek Elkins wrote:
On Thu, 2007-08-30 at 18:17 +0200, Peter Hercek wrote:
Hi,
I find the feature that the construct let x = f x in expr
assigns fixed point of f to x annoying. The reason is that
I can not simply chain mofifications a variable like e.g. this:
f x =
let x = x * scale
Chaddaï Fouché wrote:
But, even more trivial... You use this all the time when you define
recursive function, you know ? You would need to add a rec keyword
to the language if you disallowed this.
Great and new reason too. Trying to make a difference based on presence
of formal argument would
68 matches
Mail list logo
