--
CALL FOR WORKSHOP PROPOSALS
ICFP 2007, the 12th ACM SIGPLAN International
Conference on Functional Programming
1-3 October 2007, Freiburg, Germany
The
Yes, this is exactly what I wanted! Thanks, and thanks for writing
it all in the first place. :-)
However, I haven't quite been able to get it to work fully. I did
get it installed and running, after I took the advice about using
the latest versions and just installing the binaries. I even
Durward McDonell wrote:
Yes, this is exactly what I wanted! Thanks, and thanks for writing
it all in the first place. :-)
However, I haven't quite been able to get it to work fully. ... What am I
doing wrong?
If you use pfesetup to create the project, prelude and library modules will be
#930: ghc-6.6: panic! (the 'impossible' happened) mkWWcpr: not a product GHC-
Brian-6.5.1:IdInfo.IdInfo{tc rfD}
-+--
Reporter: briansmith | Owner:
Type: bug | Status: new
#934: Allow load to work correctly when executed multiple times the same session
for BatchCompile
--+-
Reporter: briansmith | Owner:
Type: feature request | Status: new
#935: Minor documentation bug, odd defn of fibn.
--+-
Reporter: tmcooper |Owner:
Type: bug| Status: closed
Priority: normal |Milestone:
#631: GHCi doesn't work unregisterised
+---
Reporter: [EMAIL PROTECTED] |Owner: igloo
Type: bug | Status: new
Priority: low |Milestone:
#935: Minor documentation bug, odd defn of fibn.
--+-
Reporter: tmcooper |Owner:
Type: bug| Status: reopened
Priority: normal |Milestone:
#935: Minor documentation bug, odd defn of fibn.
--+-
Reporter: tmcooper |Owner:
Type: bug| Status: closed
Priority: normal |Milestone:
#68: Warnings for unitialized fields
+---
Reporter: nobody |Owner: nobody
Type: feature request | Status: assigned
Priority: normal |Milestone: _|_
#95: GHCi editor binding with :e
+---
Reporter: martijnislief|Owner: nobody
Type: feature request | Status: assigned
Priority: normal |Milestone: 6.6.1
#149: missed CSE opportunity
--+-
Reporter: nobody |Owner: nobody
Type: bug| Status: assigned
Priority: low|Milestone: _|_
Component: Compiler
#149: missed CSE opportunity
--+-
Reporter: nobody |Owner: nobody
Type: bug| Status: assigned
Priority: low|Milestone: 6.8
Component: Compiler
#936: strange ghci behavior and error with recursive modules
--+-
Reporter: Misha Aizatulin [EMAIL PROTECTED] | Owner:
Type: bug | Status: new
Priority:
Hi Sigjorn,
On Thu, 12 Oct 2006 08:37:11 +0900, Sigbjorn Finne [EMAIL PROTECTED] wrote:
for Win32 users wanting the latest GHC goodness, a candidate
6.6 installer is now available,
http://haskell.org/ghc/dist/6.6/ghc-6-6.msi
If anyone's willing to download it and kick the tires a bit,
Hi,
I forgot to link OpenAL's site.
http://www.openal.org/
On Thu, 12 Oct 2006 15:40:07 +0900, shelarcy [EMAIL PROTECTED] wrote:
And you can include OpenAL and ALUT package by these steps.
1. Download reealut Source ZIP, unpack it.
Not reealut. I want to write freealut.
2. Copy AL header
| I might point out that the current code would throw out those
discounts (the
| nukeSrutDiscounts in that case).
Ah yes. I've forgotten why nukeScrutDiscounts is there. If you have
f x = let y = case x of ...
in ...
then the nukeScrutDiscount will avoid giving a
The binary distribution
http://www.haskell.org/ghc/dist/6.6/ghc-6.6-i386-unknown-linux.tar.bz2
does not contain libHSghc.*
So I get:
Loading package ghc-6.6 ... ghc-6.6: can't load .so/.DLL for: HSghc
(libHSghc.so: cannot open shared object file: No such file or directory)
C.
Bas van Dijk
Christian Maeder schrieb:
The binary distribution
http://www.haskell.org/ghc/dist/6.6/ghc-6.6-i386-unknown-linux.tar.bz2
does not contain libHSghc.*
So I get:
Loading package ghc-6.6 ... ghc-6.6: can't load .so/.DLL for: HSghc
(libHSghc.so: cannot open shared object file: No such
Please, who knows how to find (install) docs in ghc-6.6 ?
I install ghc-6.6 from source to ~/ghc/6.6/ghc-6.6/inst
by
./configure --prefix=/home/mechvel/ghc/6.6/inst
make
make install
The installed system seems to work.
Then, I apply the WWW brouser to see the documentation. It
I go by brouser to www.haskell.org/ghc, click at `Documentation',
at `HTML.tar.gz' on
The User's Guide
...
Download: | HTML.tar.gz | PDF | A4 Postscript (gzipped) |
And it responds
The requested URL /ghc/docs/latest/users_guide.html.tar.gz
was not found on this server.
Martin Grabmueller wrote:
Following up to myself:
Martin Grabmueller wrote:
Hello all,
I've been playing around with GHC-as-a-library a bit now, and using
yesterday's snapshot of GHC (ghc-6.5.20061004, compiled from source),
I ran into the following problem:
[...]
In following a
Ian Lynagh wrote:
On Mon, Oct 09, 2006 at 05:42:14PM -0700, Deborah Goldsmith wrote:
I was able to build this release using the 20060915 Intel build
that's available, on 10.4.8. ghci seems to work OK (except for
Readline),
That sounds like good news, thanks :-)
but an attempt to
Christian Maeder wrote:
The binary distribution
http://www.haskell.org/ghc/dist/6.6/ghc-6.6-i386-unknown-linux.tar.bz2
does not contain libHSghc.*
So I get:
Loading package ghc-6.6 ... ghc-6.6: can't load .so/.DLL for: HSghc
(libHSghc.so: cannot open shared object file: No such file or
On Thu, Oct 12, 2006 at 11:33:35AM +0100, Simon Marlow wrote:
Serge D. Mechveliani wrote:
Please, who knows how to find (install) docs in ghc-6.6 ?
I install ghc-6.6 from source to ~/ghc/6.6/ghc-6.6/inst
by
./configure --prefix=/home/mechvel/ghc/6.6/inst
make
make install
I've created ghc-6.6 under solaris. This did only work with SplitObj=No
in mk/build.mk. (There was an early split error, that I could reproduce.)
When trying out this compiler, I got the following error (that I only
post for the record):
Cheers Christian
[410 of 642] Compiling
On Thu, 2006-10-12 at 15:28 +0200, Christian Maeder wrote:
I've created ghc-6.6 under solaris. This did only work with SplitObj=No
in mk/build.mk. (There was an early split error, that I could reproduce.)
When trying out this compiler, I got the following error (that I only
post for the
Duncan Coutts schrieb:
ghc-6.6: panic! (the 'impossible' happened)
(GHC version 6.6 for sparc-sun-solaris2):
lookupDeprec main:GUI.ConsoleUtils.listBox{v r36Wf}
Are you using sparc solaris or x86 solaris?
sparc
___
Glasgow-haskell-users
On Thu, Oct 12, 2006 at 03:28:37PM +0200, Christian Maeder wrote:
I've created ghc-6.6 under solaris.
[410 of 642] Compiling Proofs.HideTheoremShift (
Proofs/HideTheoremShift.hs, Proofs/HideTheoremShift.o )
ghc-6.6: panic! (the 'impossible' happened)
(GHC version 6.6 for
Ian Lynagh schrieb:
On Thu, Oct 12, 2006 at 03:28:37PM +0200, Christian Maeder wrote:
I've created ghc-6.6 under solaris.
[410 of 642] Compiling Proofs.HideTheoremShift (
Proofs/HideTheoremShift.hs, Proofs/HideTheoremShift.o )
ghc-6.6: panic! (the 'impossible' happened)
(GHC version 6.6
Nicolas,
I think you gave a fine explanation. Just a few minor remarks...
l1 = Cons 3 Nil
l2 = Cons 3 _|_
l2 l1 because l1 is more defined.
Surely you mean l2 l1, then.
Moreover, are you sure you need to define your order in such a way
that l2 l1. I'd say, for these purposes, it's
On Wed, Oct 11, 2006 at 05:13:13PM -0700, Greg Fitzgerald wrote:
To: Haskell Cafe haskell-cafe@haskell.org
From: Greg Fitzgerald [EMAIL PROTECTED]
Date: Wed, 11 Oct 2006 17:13:13 -0700
Subject: [Haskell-cafe] do ghci
Just curious, why does ghci run in the context of a 'do'?
This tripped
Udo Stenzel [EMAIL PROTECTED] writes:
However, I don't recall problems with multiple copies of emails.
I did get your mail twice, which I don't consider a huge problem.
And for people who do, perhaps they can set up procmail to deal with
this? E.g.,
I have been trying to do some CSV-style processing. My code works
fine for small input (up to 10MB), but performs poorly for moderate to
large input (it can't seem to finish 100MB of input with 700MB heap
space). I have gone through several optimization passes with profiler
help, and now I
In my first posting, I mentioned that I was going to try to translate
some of our code to Haskell and see how it worked. Well, I don't have a
stunning demonstration of the power of pure functional programming, but
I do have an interesting problem.
I chose to port a program that we use in our
Here is another approach of questionable classification of languages. :-)
A lazy functional program is demand driven, an imperative program is
supply driven. That is, if I request some information by calling a
function in GHCi or Hugs, the interpreter develops a plan a how to produce
the
This is certainly proof that you can abuse economics in any context!
;) Or perhaps that economics can be used to abuse anything...
- Johan Tibell
On 10/12/06, Henning Thielemann [EMAIL PROTECTED] wrote:
Here is another approach of questionable classification of languages. :-)
A lazy
Seth Gordon [EMAIL PROTECTED] wrote:
almost-entirely-functional code ... that in its first draft, took
about three seconds to process 2,000 rows, eight minutes to process
20,000 rows, and overflowed a 1-MB stack when processing 200,000 rows.
Oops.
Which just goes to show that your algorithm
Malcolm Wallace wrote:
Seth Gordon [EMAIL PROTECTED] wrote:
almost-entirely-functional code ... that in its first draft, took
about three seconds to process 2,000 rows, eight minutes to process
20,000 rows, and overflowed a 1-MB stack when processing 200,000 rows.
Oops.
Which just goes
Hello,
There is a very nice tutorial on the Glade Interface Designer at
http://www.writelinux.com/glade and I've been using it with 'An
Introduction to Gtk2Hs, A Haskell GUI Library', by Kenneth Hoste at
http://haskell.org/~shae/memory.pdf to learn Gtk2Hs and Glade.
The 'Gtk2Hs Introduction',
Hello,
When using addDate in foldM like below, you certainly don't want to
search the cols for the string Date again and again everytime addDate
is called. The index of the Date field is a number determined when
parsing the header. That and only that number has to be plugged in here.
Good
On 10/12/06, Seth Gordon [EMAIL PROTECTED] wrote:
(it was easier to do that then to learn enough about Cabal
to get HSQL recompiled with profiling),
Hmm...That should just require:
runghc Setup.hs configure -p
Doing that tells cabal to build both the normal library and profiling
enabled copy
On 11/10/06, Mikael Johansson [EMAIL PROTECTED] wrote:
* It penalizes the person with a reasonable mailer in order to coddle
those running brain-dead software.
I don't agree. I view pine as something that should be classified as
reasonable, and I feel penalized by non-munging.
When you press
Brian Hulley [EMAIL PROTECTED] writes:
You'll never believe it but I've been struggling last night and all of
today to try and think up a name for the following type and I'm still
nowhere near a solution:
data ??? = VarId | VarSym | ConId | ConSym
Perhaps Atom.
Henning Thielemann [EMAIL PROTECTED] writes:
Here is another approach of questionable classification of languages. :-)
A lazy functional program is demand driven, an imperative program is
supply driven.
So is Haskell a Keynesian language and C++ a Say language?
Great, now we can talk
Hia Hans,
That's great that you're interested in doing/improving Gtk2Hs tutorial
material. I think actually this is one of the weakest parts of Gtk2Hs at
the moment - the lack of a decent basic intro tutorial.
We've often talked about starting one, and we had various ideas floating
around, but
[EMAIL PROTECTED] wrote:
For logarithmic access times, you should use a binary search tree like
Data.Map or similar. The problem in your case could be that matchKeys is
only approximate and your keys cannot be ordered in suitable fasion.
That is precisely the problem that I was dealing with.
I prefer the terms awesome and crappy, respectively, but sure, whatever
works for you ;-)
Mike
Henning Thielemann wrote:
Here is another approach of questionable classification of languages. :-)
A lazy functional program is demand driven, an imperative program is
supply driven. That is, if
It often seems to me that the Wildeian dichotomy of charming vs.
tedious applies especially well to programming languages.
On Oct 12, 2006, at 5:02 PM, mvanier wrote:
I prefer the terms awesome and crappy, respectively, but sure,
whatever works for you ;-)
Mike
hello,I'm new to Haskell and I'm using it to do some simulations for a game, and I have a some functions that have as argument just one int (the current situation), but they do a lot of computations after that (future evolutions etc)
I'd like to know if the results are cached by the compiler
A better solution would be to begin output before the the whole input is
read, thus making things more lazy. This can be done the following way:
from the input, construct a lazy list of (date,line) pairs. Then, let
foldM thread a map from dates to corresponding output file pointers
through
On 10/12/06, Silviu Gheorghe [EMAIL PROTECTED] wrote:
I'd like to know if the results are cached by the compiler
Hardly ever, as I understand things.
if they are not I'd like to know what is the best way to cache them
manually, and where can I read more about this, and the optimizations
it does, thank you very much for the quick answer, unfortunately as I understand it, it doesn't work well on ints :(for just now i created a list slowFunctionCacheList= [slowFunction (i) | i -[0..500]]
and use slowFunctionCacheList !! i instead of slowFunction (i)it helped alot (i mean i
On Fri, 2006-10-13 at 01:27 +0300, Silviu Gheorghe wrote:
it does, thank you very much for the quick answer, unfortunately as I
understand it, it doesn't work well on ints :(
for just now i created a list
slowFunctionCacheList= [slowFunction (i) | i -[0..500]]
and use
Hi,
I am new to Haskell, so the following problem is probably easy for you to spot
but difficult for me.
Any pointers would be appreciated.
In GHCI on a load I am getting the following message:
SSnowflake.hs:41:45:
No instance for (Floating Int)
arising from use of `pi' at
Am Freitag, 13. Oktober 2006 02:22 schrieb Edward Ing:
Hi,
I am new to Haskell, so the following problem is probably easy for you to
spot but difficult for me. Any pointers would be appreciated.
In GHCI on a load I am getting the following message:
SSnowflake.hs:41:45:
No instance for
The compiler is complaining that there's no instance of the Floating
class for Int because Floating is the class where pi and tan are
defined, and it manages to infer that halfWidth must be an Int. How
does it do this?
Well, assuming that you are using SOE or a similar graphics library,
the
Hi,
I need help to develop an implementation of nim game in Haskell.
Could anyone send me a implementation of this game in haskell??
thanks
--
Luis
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
This sounds like a request for homework help.
http://www.haskell.org/haskellwiki/Homework_help
Mike
Luis Felipe wrote:
Hi,
I need help to develop an implementation of nim game in Haskell.
Could anyone send me a implementation of this game in haskell??
thanks
hope you're feeing better too.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Thu, Oct 12, 2006 at 04:01:14PM -0700, Carl Witty wrote:
Instead of using an infinite list, you can use an infinite binary tree,
with a cached result at every node. Construct a binary tree with the
following property: Consider the path from the root to a node, where
left branches are
Hello,
The (almost) point-free versions run faster than my fast
imperative version and take up significantly less heap space-- even
the version which reads everything and then writes takes up about 1/3
the heap space as my version.
I get the impression that point-free style is a preventive
62 matches
Mail list logo
