On Thu, 2007-06-07 at 16:42 +0100, Andrew Coppin wrote:
Neil Mitchell wrote:
Hi Andrew,
I just tried to install Gtk2hs and got an error message to the effect
that it cannot be installed since I have GHC 6.6.1, which isn't 6.6
or 6.4.
Anybody know how to fix this? Am I being dumb?
On Thu, 2007-06-14 at 22:50 -0700, Stefan O'Rear wrote:
| unsafeLiftIO :: (Buffer - IO Buffer) - Builder
| unsafeLiftIO f = Builder $ \ k buf - inlinePerformIO $ do
| buf' - f buf
| return (k buf')
which might be safe, since 'f buf' cannot float out of the lambda which
Daniel Fischer wrote:
What about
blocks w h = concatMap transpose . map (map (chop w)) . chop h
Seems right. I arrived at something else:
divide w h ls = concatMap (foldr (zipWith (:) . chop w) (repeat []))
(chop h ls)
That uses fewer intermediate lists, and indeed
On Thu, 14 Jun 2007, Lutz Donnerhacke wrote:
It's a bad and buggy rewrite from scratch. It can check a file of urls or
the consistency of the transitive hull of a website incl. the existance of
the border urls. Futhermore the warnings from TagSoup parsing can be
reported.
Main bugs are
Thomas Hartman wrote:
ghc-pkg list says a package is installed, but ghci won't load its
module (HDBC-ODBC)
Any advice?
[EMAIL PROTECTED] ~/haskellInstalls/HDBC-odbc-1.0.1.0
$ ghc-pkg list
c:/ghc/ghc-6.6.1\package.conf:
Cabal-1.1.6.2, GLUT-2.1.1, HAppS-0.8.4, HDBC-1.0.1,
Rich Collins schrieb:
I was able to install the ghc binary for solaris x86, but darcs fails on
configure:
It's not a darcs problem.
configure:2718: ghc -o conftest conftest.hs
ld: fatal: symbol `GHC_ZCCReturnable_static_info' in file
/opt/local/lib/ghc-6.6.1/libHSrts.a(PrimOps.o):
http://en.literateprograms.org/LiteratePrograms:Welcome
There's some Haskell there already, but I think a lot more could be
shown there. Even code dumps of things would be nice. They can always
be explained later.
--
Michael T. Richter [EMAIL PROTECTED] (GoogleTalk:
[EMAIL PROTECTED])
Never,
I'm not familiar with darcs. Shall I use darcs --whatsnew for it?
darcs record
pick the changes you wnat
type a patch name
darcs send
select your patch
No need to attach files, figure out the right email address, etc.
Stefan
Thanks.
Iván.
I didn't see an answer jet so here it goes:
If you look closely you will see that HDBC-odbc-1.1.6.2 is installed but
module Database.HDBC.ODBC is not found (loaded). The problem lies in the
capitalisation.
I ran into the same problem with missingH and the package filepath wich
registers as
Henning Thielemann wrote:
The program is compiled with GHC-6.4 and option -O2, CPU clock 1.7 GHz.
ByteString is much faster with GHC 6.6, IIRC. We optimised the representation
of ForeignPtr, and ByteString takes advantage of that. I recommend upgrading.
Cheers,
Simon
Simon,
Sorry for the delay on responding.
I'm using 6.6, so I'll upgrade to 6.6.1 and retest. Preusmably you're
only interested if this behaviour persists in 6.6.1. I'll check both
cases and make a test cases for them if necessary.
I've upgraded to 6.6.1 and am pleased to report that there
Accepted Papers
ICFP 2007: International Conference on Functional Programming
http://www.informatik.uni-bonn.de/~ralf/icfp07.html
Freiburg, Germany, 1-3 October 2007
The ICFP 2007 Program Chair and Committee are pleased to announce that
the
On Thu, Jun 14, 2007 at 08:27:36PM -0700, Jason Dagit wrote:
On 6/14/07, David Roundy [EMAIL PROTECTED] wrote:
src/Darcs/Patch/Show.lhs:50:0:
Quantified type variable `y' is unified with another quantified type
variable `x'
When trying to generalise the type inferred for
I need to remove newlines from csv files (within columns, not at the end of
entire lines). This is prior to importing into a database and was being done
at my workplace by a java class for quite a while until the files processed
got bigger and it proved to be too slow. (The files are up to ~250MB
On 15 jun 2007, at 18.13, Jim Burton wrote:
import qualified Data.ByteString.Char8 as B
Have you tried
import qualified Data.ByteString.Lazy.Char8 as B
?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Thu, Jun 14, 2007 at 05:55:46PM -0700, Greg Fitzgerald wrote:
Has anyone embedded a build language in Haskell? Something like
Rakehttp://rake.rubyforge.org/is to Ruby, but in Haskell or any
statically-typed functional language.
I have. It consists of such components:
- A type for build
It does not bode well that the first example I looked at (which I chose
because it maximally would highlight the benefits of Haskell over other
languages):
http://en.literateprograms.org/Sieve_of_Eratosthenes_%28Haskell%29
has the following Haskell program.
primes :: [Int] - [Int]
primes
Thomas Schilling wrote:
On 15 jun 2007, at 18.13, Jim Burton wrote:
import qualified Data.ByteString.Char8 as B
Have you tried
import qualified Data.ByteString.Lazy.Char8 as B
?
No -- I'll give it a try and compare them. Is laziness preferable here?
Thanks,
On 6/15/07, Jim Burton [EMAIL PROTECTED] wrote:
No -- I'll give it a try and compare them. Is laziness preferable here?
Laziness might give you constant space usage (if you are sufficiently
lazy). Which would help with the thrashing.
Jason
___
On 15 jun 2007, at 21.14, Jim Burton wrote:
Thomas Schilling wrote:
On 15 jun 2007, at 18.13, Jim Burton wrote:
import qualified Data.ByteString.Char8 as B
Have you tried
import qualified Data.ByteString.Lazy.Char8 as B
?
No -- I'll give it a try and compare them. Is laziness preferable
It was a problem with the linking for ghc. I hacked LD_LIBRARY_PATH
for my user account and it worked. You might want to add /opt/csw/
lib/ when compiling ghc.
Also, I am a new Solaris user (this is on a Joyent Accelerator) so
this might be entirely the wrong advice ;)
On Jun 15, 2007,
Andrew Coppin wrote:
trees
:: [Int] - [Tree]
trees = map fst . (\ts - all_trees 1 (2 * length ts) ts) . map Leaf
all_trees :: Int - Int - [Tree] - [(Tree,[Tree])]
all_trees n m ts
| n m = []
| otherwise = pick ts ++ sub_trees n m ts
sub_trees :: Int - Int - [Tree] -
On 6/15/07, Ian Lynagh [EMAIL PROTECTED] wrote:
On Thu, Jun 14, 2007 at 08:27:36PM -0700, Jason Dagit wrote:
On 6/14/07, David Roundy [EMAIL PROTECTED] wrote:
src/Darcs/Patch/Show.lhs:50:0:
Quantified type variable `y' is unified with another quantified type
variable `x'
When
On Fri, Jun 15, 2007 at 01:32:32PM -0700, Jason Dagit wrote:
I suspect your problem in making a testcase was moving the GADT
declaration into the same file as the function, and thus needing to
compile it with -fglasgow-exts anyway.
Yes, you're basically right about what I tried. I did
Andrew Coppin wrote:
The size of the deepest possible *balanced* tree with N leaves is log2
N. The deepest possible *unbalanced* tree has N nodes!
My God... even when I correct myself I make mistakes! _
Anyway, I eventually got my program to work. But it's absurdly slow. So
I'm looking at
I want to write a a template haskell function deriving show for data types
without constructor.
-- example
-- data A a
-- the derived instance:
-- instance (Show a) = Show (A a) where
-- show _ = A ++ show (undefined :: a)
deriveShowNoConstructors :: Name - Q [ Dec ]
On 15/06/07, Jim Burton [EMAIL PROTECTED] wrote:
I need to remove newlines from csv files (within columns, not at the end
of
entire lines). This is prior to importing into a database and was being
done
at my workplace by a java class for quite a while until the files
processed
got bigger and
Tomek,
If you want to see the code I will try to release it
I'm very interested.
Thanks,
Greg
On 6/15/07, Tomasz Zielonka [EMAIL PROTECTED] wrote:
On Thu, Jun 14, 2007 at 05:55:46PM -0700, Greg Fitzgerald wrote:
Has anyone embedded a build language in Haskell? Something like
I'm learning Haskell using Paul Hudak's book SOE.
I'm using GHC 6.6 under Windows XP.
GHC on Windows does not seem to come with HGL (is this correct?), so I used
Gtk2HS, which contains a SOE implementation.
I noticed that most programs hang when using GHCI, but they work fine with
GHC.
For
I'm learning Haskell.
I was surprised that the following example did not compile:
data Vector2 = Vector2 { x :: Float, y :: Float }
data Vector3 = Vector3 { x :: Float, y :: Float, z :: Float }
error: Multiple declarations of `Main.x'
This seems to be a known issue and if I understand it
I've searched the internet for an Haskell IDE that supports the following:
- syntax highlighting
- cross module refactoring
- quick navigation (goto symbol, goto instance, find usages, etc)
- code completion
- debugging (not imperative debugging, so no breakpoints, but just
plugging in a
[EMAIL PROTECTED] wrote:
I'm learning Haskell.
I was surprised that the following example did not compile:
data Vector2 = Vector2 { x :: Float, y :: Float }
data Vector3 = Vector3 { x :: Float, y :: Float, z :: Float }
error: Multiple declarations of `Main.x'
This seems to be a known issue
On 15/06/07, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
I've searched the internet for an Haskell IDE that supports the following:
- syntax highlighting
- cross module refactoring
- quick navigation (goto symbol, goto instance, find usages, etc)
- code completion
- debugging (not imperative
On Fri, Jun 15, 2007 at 11:38:17PM +0200, [EMAIL PROTECTED] wrote:
I've searched the internet for an Haskell IDE that supports the following:
Goto haskell.org - Applications and libraries - Editros written in
Haskell and Editors for haskell.
Also have look at the haskell-cafe mailinglist archive.
Sebastian Sylvan wrote:
On 15/06/07, Jim Burton [EMAIL PROTECTED] wrote:
[snip]
Hi,
Hi Sebastian,
I haven't compiled this, but you get the general idea:
import qualified Data.ByteString.Lazy.Char8 as B
-- takes a bytestring representing the file, concats the lines
-- then splits it up into
On 6/15/07, Jim Burton [EMAIL PROTECTED] wrote:
Sebastian Sylvan wrote:
On 15/06/07, Jim Burton [EMAIL PROTECTED] wrote:
[snip]
Hi,
Hi Sebastian,
I haven't compiled this, but you get the general idea:
import qualified Data.ByteString.Lazy.Char8 as B
-- takes a bytestring representing the
Yes this is kind of sad. FWIW, here's how I currently approximate
these features using Emacs + Haskell mode:
On 15 jun 2007, at 23.38, [EMAIL PROTECTED] wrote:
I've searched the internet for an Haskell IDE that supports the
following:
- syntax highlighting
haskell mode
- cross module
Jason Dagit wrote:
[snip]
I love to see people using Haskell, especially professionally, but I
have to wonder if the real tool for this job is sed? :-)
Jason
Maybe it is -- I've never used sed. (cue oohs and ahhs from the
gallery?) But from the (unquantified) gains so far haskell may
On Jun 15, 2007, at 18:37 , Jason Dagit wrote:
I love to see people using Haskell, especially professionally, but I
have to wonder if the real tool for this job is sed? :-)
Actually, while sed could do that, it'd be a nightmare. You really
want a parser to deal with general CSV like this,
I've searched the internet for an Haskell IDE that supports the following:
my first reaction was: he can't be serious, not that again!-) however, i
tried to find the info by the obvious means, and found that to be a rather
sobering experience.
a simple google search does give rather a few
my first reaction was: he can't be serious, not that again!-) however, i
tried to find the info by the obvious means, and found that to be a rather
sobering experience.
it is also no longer obvious that Communities and active projects is
not just a topic for the four subheadings, but in itself
Paul Johnson writes:
This is a feature, not a bug. Haskell in general does not let you give
two functions the same name (which is what you want to do).
Record namespacing would still be nice to have, so perhaps call it a
limitation rather than a bug, but it's not really a feature.
-David
[EMAIL PROTECTED] wrote:
Any help to find an IDE that comes closest to these features would be much
appreciated.
There's a short list at http://haskell.org/haskellwiki/IDEs, but I
don't think any are all that close. I'd like to see a good IDE for
Haskell, but it's a lot of work.
Ideally
[EMAIL PROTECTED] writes:
- syntax highlighting
- quick navigation (goto symbol, goto instance, find usages, etc)
- code completion
Emacs with haskell-mode can do this.
- cross module refactoring
Refactoring doesn't feature as heavily in Haskell workflow as, say, Java,
just because of
On Fri, 2007-06-15 at 23:15 +0200, [EMAIL PROTECTED] wrote:
I'm learning Haskell using Paul Hudak's book SOE.
I'm using GHC 6.6 under Windows XP.
GHC on Windows does not seem to come with HGL (is this correct?), so I used
Gtk2HS, which contains a SOE implementation.
I noticed that most
comprehensive list of editor support on haskell.org. Either it's to late
or it is gone.
No, it's still there:
http://haskell.org/haskellwiki/Applications_and_libraries - Program
developement - Editor support
Perhaps a link to this should be made on the front page?
This is a topic every newcomer
Sebastian Sylvan wrote:
A sorry, I thought the delimiter was a line delimiter. I'm trying to get to
that fusion goodness by using built-in functions as much as possible...
How about this one:
clean del = B.map ( B.filter (/='\n') ) . B.groupBy (\x y - (x,y) /=
(del,'\n'))
That groupBy will
On 16/06/07, Jim Burton [EMAIL PROTECTED] wrote:
Sebastian Sylvan wrote:
A sorry, I thought the delimiter was a line delimiter. I'm trying to get
to
that fusion goodness by using built-in functions as much as possible...
How about this one:
clean del = B.map ( B.filter (/='\n') ) .
On 6/15/07, Sebastian Sylvan [EMAIL PROTECTED] wrote:
Benchmark it I guess :-)
Both versions use a non-bytestring recursive functions (the outer B.map
should just be a straight map, and yours use a foldr), which may mess fusion
up... Not sure what would happe here...
I don't have a Haskell
On Fri, 2007-15-06 at 11:42 -0700, Dan Weston wrote:
As there are so far relatively few Haskell programs listed (~100),
perhaps an interested party might go through and do a sanity check on them.
Where are you seeing 100 Haskell programs? I'm seeing 9.
Now where is that Unsend button! :(
I realize in hindsight that my wording could have been a little less
flippant. Thanks for contributing to that website.
Now pardon me while I enter a shame spiral to atone for my needless
hostility...
Dan
Michael T. Richter wrote:
On Fri, 2007-15-06 at
If I define something like this:
data Bar = Bi Int
| Bf String
deriving Show
data Foo = Fi Int
| Fs Float
deriving Show
func::Foo - Bar
func (Fi xx) = Bi xx
func (Fs ff) = Bf (show ff)
I can do:
map func [(Fi 1), (Fs 2.0)]
[Bi 1,Bf 2.0]
but what i really
52 matches
Mail list logo
