ivan.miljenovic:
Thomas Bereknyei are currently re-writing fgl (just about completely
from scratch) and we plan to make an initial release to get feedback
on the API in the next few weeks.
However, I'm sending this email out now to warn people that I highly
doubt any code that was written
Dear all,
This a final reminder that the deadline for WGP submissions is in one
week! See the call for papers below:
==
CALL FOR PAPERS
WGP 2010
6th ACM
*** Apologies for multiple copies ***
*** Call for POSTERS ***
3rd International Conference on Verified Software: Theories, Tools, and
Experiments (VSTTE 2010)
Edinburgh, Scotland
August 16th-19th, 2010
http://www.macs.hw.ac.uk/vstte10
POSTER SESSION
The
Thomas Bereknyei are currently re-writing fgl (just about completely
from scratch) and we plan to make an initial release to get feedback
on the API in the next few weeks.
However, I'm sending this email out now to warn people that I highly
doubt any code that was written for the current version
Oh, great, the email _did_ go out on the mailing lists (what with
haskell.org being down I wasn't sure it would).
Don Stewart d...@galois.com writes:
ivan.miljenovic:
Thomas Bereknyei are currently re-writing fgl (just about completely
from scratch) and we plan to make an initial release to
#4121: Ghc stage1 panic, ASSERT failure: libraries/base/Control/Applicative.hs
-+--
Reporter: dterei| Owner:
Type: bug | Status: new
#4116: Type supplement for constructor specific uses of sum types
-+--
Reporter: gabrielrf | Owner:
Type: proposal | Status: new
Priority: normal
#3961: -O results in incorrect behavior
-+--
Reporter: RichardG |Owner: simonpj
Type: bug | Status: new
Priority: high |Milestone:
#3822: guards in arrow notation (Arrows extension) case statement cause compiler
panic
-+--
Reporter: StephenBlackheath |Owner: ross
Type: bug | Status:
#3972: ghc 6.12.1 and 6.13.20090922 consume a lot more memory than 6.10.4 when
compiling language-python package
---+
Reporter: bjpop |Owner: simonpj
#4120: Iface type variable out of scope in cast
-+--
Reporter: benl | Owner:
Type: bug | Status: new
Priority: normal
#3984: interpret layout in GHCi
--+-
Reporter: aavogt | Owner:
Type: feature request | Status: new
Priority: normal | Milestone: 6.14.1
#3982: Random instance for Double can generate values out of requested range
--+-
Reporter: mokus| Owner: igloo
Type: bug | Status:
#3984: interpret layout in GHCi
--+-
Reporter: aavogt | Owner: igloo
Type: feature request | Status: closed
Priority: normal | Milestone: 6.14.1
#4115: hsc2hs puts linker flags before object file, causes linker errors
-+--
Reporter: guest | Owner:
Type: bug | Status: new
Priority: normal|
#4119: File buffering isn't flushed at exit
---+
Reporter: EyalLotem | Owner:
Type: bug | Status: new
Priority: normal
#4106: undefined reference to `__stg_EAGER_BLACKHOLE_INFO'
---+
Reporter: Mikolaj | Owner: simonmar
Type: bug | Status: closed
Priority: normal| Milestone:
#4118: GHC forces gcc version on mingw32
-+--
Reporter: uzytkownik| Owner:
Type: bug | Status: new
Priority: normal|
#4117: GHC does not accept --srcdir
-+--
Reporter: uzytkownik| Owner:
Type: bug | Status: new
Priority: normal| Component:
#3947: ghc: panic! (the 'impossible' happened)
---+
Reporter: steenreem | Owner:
Type: bug | Status: closed
Priority: normal| Milestone:
#4116: Type supplement for constructor specific uses of sum types
-+--
Reporter: gabrielrf | Owner:
Type: proposal | Status: new
Priority: normal
#4115: hsc2hs puts linker flags before object file, causes linker errors
-+--
Reporter: guest |Owner:
Type: bug | Status: patch
Priority: normal|
#2458: Unknown symbol `_environ' on MacOS X
-+--
Reporter: IgorBoehm | Owner:
Type: bug | Status: new
Priority: high| Milestone: 6.14.1
#4118: GHC forces gcc version on mingw32
+---
Reporter: uzytkownik | Owner:
Type: bug | Status: closed
Priority: normal |
#3649: inconsistent exception between unix/windows for running non-existant
program
--+-
Reporter: duncan |Owner:
Type: bug| Status: new
#4110: hsc2hs gives bad error message when it cannot execute the generated
program
-+--
Reporter: duncan| Owner:
Type: bug | Status: new
Priority:
On 03/06/2010 07:29, Evan Laforge wrote:
On Sun, May 30, 2010 at 5:15 PM, Antoine Latteraslat...@gmail.com wrote:
Hi GHC,
Is there a reason that Foreign.Marshall.Array.allocaArray calls into
allocaBytes instead of allocaBytesAligned? Since alloca needs the
alignment, wouldn't allocaArray also
Can someone provide a hand calculation of:
span ( 0) [-1, -2, -3, 0, 1, 2, -3, -4, -5]?
I know the result is ([-1, -2, -3], [0, 1, 2, -3, -4, -5]), but the recursion
flummoxes me.
Here's the Prelude definition:
mySpan :: (a - Bool) - [a] - ([a], [a])mySpan _
[]
What's the cleanest definition for a function f :: [a] - [a] that takes a list
and returns the same list, with alternate items removed? e.g., f [0, 1, 2, 3,
4, 5] = [1,3,5]?
_
The New
A few days ago, I watched a presentation by Gerard Holzmann on the
development methodology and programming techniques used at JPL for
writing the software for the next Mars mission. I found the talk
entertaining and learned a few things.
http://www.infoq.com/presentations/Scrub-Spin
Among
On Jun 4, 2010, at 23:04 , Don Stewart wrote:
Build/does not build? That can be automated.
Automated converters have a certain tendency to become confused and
put files in unexpected places, etc. Usually this has less to do with
the source than the destination; in particular, RPM
Alexey Khudyakov alexey.sklad...@gmail.com writes:
This issue was discussed on the list before. Get monad definition
was changed in binary 0.5.0.2. It was made strict and evaluation
of result of runGet is forced. This increased performance but
broke programs which relies on lazyness to work.
On Friday, 4. June 2010 18:02:15 Daniel Fischer wrote:
On Friday 04 June 2010 17:37:16, Martin Drautzburg wrote:
Dear all,
If I have a problem where I have to select from a set of operations, how
would I print the result?
Example: If I can chose from (x+y), (x*y), (x^2+y)...
and I
Hi, Just thought I'd follow up,
I implemented a VirtualFile target in the current head version of ghc just
to test, unfortunately unless I did something wrong It's not really that
much faster.
Most likely because in the scenario I'm using it in, the file would still be
in the disk cache, so I'd
Perhaps it was only listening on IPv6 ? ::1 ?
- jeremy
On Thu, Jun 3, 2010 at 10:30 PM, aditya siram aditya.si...@gmail.comwrote:
Hi all,
I had an issue where using the connectTo [1] function would fail to
connect to localhost if my wireless card was turned off. The moment
I turned on my
Great! If there is a wiki or FAQ page for networking with Haskell it
might be worth updating.
-deech
On 6/4/10, Roman Cheplyaka r...@ro-che.info wrote:
/etc/hosts is the file responsible for resolving 'localhost' hostname.
As you can see from it, there are two entries for localhost: one
If you want to use libs to make your life easier, maybe something
along these lines?
Prelude Data.List.Split Safe fmap length . headMay . split (onSublist
asdf) $ blee blah asdf bloo
Just 10
If they are big strings, it's probably faster to use bytestrings, or
arrays of some kinds, rather than
allbery:
On Jun 4, 2010, at 23:04 , Don Stewart wrote:
Build/does not build? That can be automated.
Automated converters have a certain tendency to become confused and put
files in unexpected places, etc. Usually this has less to do with the
source than the destination; in particular,
allbery:
On Jun 4, 2010, at 06:54 , Ivan Lazar Miljenovic wrote:
Don Stewart d...@galois.com writes:
However, we have tools for some distros that do this, and some distro
tools support it directly (e.g. bauerbill --hackage on Arch Linux
knows how to ask cabal2arch to translate the .cabal
ivan.miljenovic:
Don Stewart d...@galois.com writes:
allbery:
Supposedly a future Cabal extension will be to, instead of installing,
write out a package for a vendor packaging system (yum, apt, yast, what
have you). Consider contributing to that effort.
However, we have tools
Gabriel Riba wrote:
New proposal draft:
Proposal: Type supplement for constructor specific uses of sum types
Purpose: Avoid error clauses (runtime errors), exception control or Maybe
types in partially defined (constructor specific) functions on sum types.
As an example, with
data List a
How should I work around that. I could use two different name function, but
I don't like this. Would I have to define a typeclass namedFunction which
all have a name function?
How about a named type:
data Named a = Named {
val_of :: a,
name_of :: String
}
You can put it in Functor and
Hello all,
I like some of the naming conventions in haskell quite a lot, like calling a
list of something xs, or function which takes a function as a
parameter ..By as in sortBy or groupBy.
If I have a function, say compute whose last parameter is some value ...
and I create another function,
maybe this?
map snd . filter (odd . fst) . zip [1,2..] $ [1,2,3,4,5]
2010/6/6 R J rj248...@hotmail.com:
What's the cleanest definition for a function f :: [a] - [a] that takes a
list and returns the same list, with alternate items removed? e.g., f [0,
1, 2, 3, 4, 5] = [1,3,5]?
Here's two implementations of break, a snappy one from the prelude,
and a slow stupid stateful one.
They are quickchecked to be identical.
Is there a way to prove they are identical mathematically? What are
the techniques involved? Or to transform one to the other?
import Control.Monad.State
Thomas Bereknyei are currently re-writing fgl (just about completely
from scratch) and we plan to make an initial release to get feedback
on the API in the next few weeks.
However, I'm sending this email out now to warn people that I highly
doubt any code that was written for the current version
On Jun 4, 2010, at 06:54 , Ivan Lazar Miljenovic wrote:
Don Stewart d...@galois.com writes:
However, we have tools for some distros that do this, and some distro
tools support it directly (e.g. bauerbill --hackage on Arch Linux
knows how to ask cabal2arch to translate the .cabal file).
ivan.miljenovic:
Thomas Bereknyei are currently re-writing fgl (just about completely
from scratch) and we plan to make an initial release to get feedback
on the API in the next few weeks.
However, I'm sending this email out now to warn people that I highly
doubt any code that was written
Yeah, that seems to be the issue. When I commented out the ::1..
line it worked.
-deech
On 6/4/10, Jeremy Shaw jer...@n-heptane.com wrote:
Perhaps it was only listening on IPv6 ? ::1 ?
- jeremy
On Thu, Jun 3, 2010 at 10:30 PM, aditya siram aditya.si...@gmail.comwrote:
Hi all,
I had an
Hi,
I am trying to install the curl 1.3.5 hackage on the latest Haskell Platform
(2010.1.0.0) on Windows 7.
I have installed lib-curl-devel (7.19.6-1) on CygWin but I can't use Cygwin
as (apparently) every attempt to install a package ends like this:
C:\Program Files\Haskell
Hi,
I'm looking for a way to set a GHC compile option on a specific module
(not every module in the program) but only for a specific version of
GHC. Ideally within the confines of cabal, and in a portable way.
GHC provides the OPTIONS_GHC pragma, but it does not appear to provide
a way for the
James Andrew Cook wrote:
In particular, functions such as 'uniform' and 'normal' which directly construct RVars are very useful in
defining the rvar implementation of other types. I have been reluctant to drop the rvar function from the
Distribution class because it is very useful to be able
i think explicit recursion is quite clean?
f :: [a] - [a]
f (x:y:zs) = x : f zs
f x = x
On 7 June 2010 19:42, Thomas Hartman tphya...@gmail.com wrote:
maybe this?
map snd . filter (odd . fst) . zip [1,2..] $ [1,2,3,4,5]
2010/6/6 R J rj248...@hotmail.com:
What's the cleanest definition
or, since you don't need to give a name to the second element of the list:
f :: [a] - [a]
f (x:_:xs) = x : f xs
f x = x
On 7 June 2010 20:11, Ozgur Akgun ozgurak...@gmail.com wrote:
i think explicit recursion is quite clean?
f :: [a] - [a]
f (x:y:zs) = x : f zs
f x = x
On 7 June
Hi Chris
HP can be used fine with Cygwin. Where a library in the HP is a
binding to a C library, the HP supplies the relevant C library as an
*.a file, e.g libglu32.a and libglut32.a for OpenGL. Pure Haskell
libraries will install fine under Cygwin as well.
Bindings to additional C libraries
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Jun 6, 2010, at 14:22 , Martin Drautzburg wrote:
If I have a function, say compute whose last parameter is some
value ...
and I create another function, which applies compute to a list of
values,
how would I call this function?
The few
On Jun 6, 2010, at 11:22 AM, Martin Drautzburg wrote:
If I have a function, say compute whose last parameter is some
value ...
and I create another function, which applies compute to a list of
values,
how would I call this function?
computeF is my natural inclination. F is for Functor.
Thanks ever so much for your clear answer. I have no problem at all with
using MSYS to build libraries that link to libraries built in Windows
land--this seems entirely reasonable.
Is this written down somewhere? I mean I really would like to RTFM! :-)
Also, what's with
C:\Program
If the function is changing the size of the list (e.g. by removing
duplicates) a name implying 'mapping' might be misleading.
Maybe something like /process/ or /normalize/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
If I have a problem where I have to select from a set of operations,
how
would I print the result?
Example: If I can chose from (x+y), (x*y), (x^2+y)...
and I feed them all into my problem solver
and it finds that (x*y) is right, how can I print that string?
As others have pointed out,
Another way round -- it (the server) was only listening on IPv4 and
the (Haskell) client only tried to connect via IPv6.
The bug is described here (with a patch):
http://trac.haskell.org/network/ticket/30
* Jeremy Shaw jer...@n-heptane.com [2010-06-04 16:57:38-0500]
Perhaps it was only
On 7 June 2010 20:44, Chris Dornan ch...@chrisdornan.com wrote:
Also, what's with
C:\Program Files\Haskell
Platform\2010.1.0.0\lib\..\mingw\bin\windres: can't open temporary file
`\/cca01252.irc': No such file or directory
Hi Chris
I don't know what's going on there, are you using
Hmmm. Now that I've had a chance to rewatch the video, I am enlightened.
Nevertheless, I will confess that I wouldn't mind the idea of just doing an
external parallelism wrapper, running multiple sessions of GHC rather than
making GHC internally parallel. Hm.
Louis Wasserman
On 5 June 2010 09:28, Bernie Pope florbit...@gmail.com wrote:
Hi,
I'm looking for a way to set a GHC compile option on a specific module
(not every module in the program) but only for a specific version of
GHC. Ideally within the confines of cabal, and in a portable way.
GHC provides the
Thanks Stephen--that was related to my original question, about using HP
with Cygwin. The answer seems to be No!--you must use MSYS (for real work).
Or am I just being very slow? (I probably am--sorry!)
Chris
-Original Message-
From: Stephen Tetley [mailto:stephen.tet...@gmail.com]
Here's my GHCI session (with my network card off):
Prelude Network Network.Socket connectTo localhost (PortNumber 3000)
*** Exception: connect: does not exist (Connection refused)
Prelude Network Network.Socket connectTo 127.0.0.1 (PortNumber 3000)
{handle: socket: 7}
The OS is Ubuntu (Lucid)
Hi,
I am trying to use Haddock on the Haskell Platform 2010.1.0.0 and getting
haddock.exe: can't find a package database at
E:\ghc\ghc-6.12.1\lib\package.conf.d
I have tried uninstalling and re-installing HP (just in case) to no avail.
Has anybody else seen this?
Chris
Martin Drautzburg martin.drautzb...@web.de writes:
If I have a function, say compute whose last parameter is some value ...
and I create another function, which applies compute to a list of values,
how would I call this function?
If I understand you correctly, and it's not simply map .
On Mon, 07 Jun 2010 21:44:13 +0200, Chris Dornan ch...@chrisdornan.com
wrote:
Thanks ever so much for your clear answer. I have no problem at all with
using MSYS to build libraries that link to libraries built in Windows
land--this seems entirely reasonable.
Is this written down somewhere? I
While working on the Shootout, I noticed the following benchmarks:
http://shootout.alioth.debian.org/u64/program.php?test=chameneosreduxlang=ghcid=3
http://shootout.alioth.debian.org/u64/program.php?test=chameneosreduxlang=ghcid=3
wasserman.louis:
While working on the Shootout, I noticed the following benchmarks:
http://shootout.alioth.debian.org/u64/program.php?test=chameneosreduxlang=ghc;
id=3
http://shootout.alioth.debian.org/u64q/program.php?test=chameneosreduxlang=
ghcid=3
The same program becomes almost 4
Doing (1) solves my problem. What did I do and why did it work? Thanks
a lot for your help!
-deech
On 6/4/10, Roman Cheplyaka r...@ro-che.info wrote:
Confirm if any of the following solves the problem:
1. commenting out (by prepending putting hash sign '#' in the beginning
of the line) the
R J wrote:
Can someone provide a hand calculation of:
span ( 0) [-1, -2, -3, 0, 1, 2, -3, -4, -5]?
I know the result is ([-1, -2, -3], [0, 1, 2, -3, -4, -5]), but the recursion
flummoxes me.
Here's the Prelude definition:
First, let's simplify the definition.
span _ [] = ([],
Oh, great, the email _did_ go out on the mailing lists (what with
haskell.org being down I wasn't sure it would).
Don Stewart d...@galois.com writes:
ivan.miljenovic:
Thomas Bereknyei are currently re-writing fgl (just about completely
from scratch) and we plan to make an initial release to
ivan.miljenovic:
Oh, great, the email _did_ go out on the mailing lists (what with
haskell.org being down I wasn't sure it would).
Don Stewart d...@galois.com writes:
ivan.miljenovic:
Thomas Bereknyei are currently re-writing fgl (just about completely
from scratch) and we plan to
Chris Dornan ch...@chrisdornan.com writes:
I am trying to use Haddock on the Haskell Platform 2010.1.0.0 and getting
haddock.exe: can't find a package database at
E:\ghc\ghc-6.12.1\lib\package.conf.d
Where did you install GHC to (just checking...)?
--
Ivan Lazar Miljenovic
hitSSQ :: String - [Int] - IO ()
hitSSQ no hitNum = do
let newNum = unwords $ [no] ++ map (\n - show n) hitNum
hitNums - fmap lines $ readFile test.txt
writeFile test.txt $ unlines $ hitNums ++ [newNum]
*** Exception: test.txt: openFile: resource busy (file is locked)
Sincerely!
Don Stewart d...@galois.com writes:
ivan.miljenovic:
We considered giving it a new name (fgl', etc.) but figured that in the
long term this wouldn't be advantagous. We feel that the situation is
analogous to QuickCheck: when the new version came out most people kept
using the old one
zaxis z_a...@163.com writes:
hitSSQ :: String - [Int] - IO ()
hitSSQ no hitNum = do
let newNum = unwords $ [no] ++ map (\n - show n) hitNum
hitNums - fmap lines $ readFile test.txt
writeFile test.txt $ unlines $ hitNums ++ [newNum]
*** Exception: test.txt: openFile: resource
This is a final call for speakers at CUFP 2010 -- the Commercial Users of FP
Workshop, in Baltimore.
CUFP is a chance for you to talk about your use of functional programming in a
commercial setting -- and we'd love to see some Haskell speakers, given the
recent
spike in recruiting :-)
You can
On Jun 5, 2010, at 8:10 PM, Thomas Hartman wrote:
Is there a way to prove they are identical mathematically? What are
the techniques involved? Or to transform one to the other?
Typically, the easiest way to prove that functions f g are equivalent
is to (1) show that their domains are the
readFile reads the file lazily so it isn't closed until the entire contents
have been consumed.
Try System.IO.Strict.readFile, which will read the entire file at once.
zaxis z_a...@163.com writes:
hitSSQ :: String - [Int] - IO ()
hitSSQ no hitNum = do
let newNum = unwords $ [no] ++ map
On Jun 7, 2010, at 4:10 PM, Alexander Solla wrote:
For exposition, I'll do the analysis for the Prelude function. You
might note how much like evaluating the function
Correction:
You might note how much like evaluating the function generating the
analysis is.
alts :: [a] - [a]
alts xs = map fst . filter snd $ zip xs (cycle [False, True])
Prelude alts [0, 1..5]
[1,3, 5]
On Sunday Jun 6, 2010, at 10:46 AM, R J wrote:
What's the cleanest definition for a function f :: [a] - [a] that takes a
list and returns the same list, with alternate items
On Jun 4, 2010, at 15:15 , aditya siram wrote:
Doing (1) solves my problem. What did I do and why did it work? Thanks
a lot for your help!
Its the problem I pointed out; you are doing an IPv4 connect but
localhost was resolving to an IPv6 address. This is annoyingly
common on Linux.
--
--- On Mon, 6/7/10, Don Stewart d...@galois.com wrote:
From: Don Stewart d...@galois.com
Subject: Re: [Haskell-cafe] Problems with threading?
To: Louis Wasserman wasserman.lo...@gmail.com
Cc: Haskell Café List haskell-cafe@haskell.org
Date: Monday, June 7, 2010, 2:50 PM
wasserman.louis:
igouy2:
As Louis has already mentioned this to me, I'll take the opportunity
to sketch out a simple approach -
1) GHC programs compiled without -threaded and run without +RTS -N are
already shown for x86 and x64
http://shootout.alioth.debian.org/u32/compare.php?lang=ghc
Ketil Malde wrote:
There was a deliberate change in strictness in 0.5 making binary strict,
which apparently speeds up GHC.
Ah okay. I suppose that passes the buck to network-dns. Presumably it
could be fixed fairly simply by requiring binary 0.5 (as you
suggested). Ideally, though, the
Ozgur Akgun ozgurak...@gmail.com writes:
http://downforeveryoneorjustme.com/www.haskell.org-- Ozgur Akgun
Same problem here since two days ago.
Apparently, the server just went back up. Anybody know what kept the
server down for so long?
-- Benjamin L. Russell
--
Benjamin L. Russell /
Since yesterday, I have been unable to connect to www.haskell.org. Is
the site down?
-- Benjamin L. Russell
--
Benjamin L. Russell / DekuDekuplex at Yahoo dot com
http://dekudekuplex.wordpress.com/
Translator/Interpreter / Mobile: +011 81 80-3603-6725
Furuike ya, kawazu tobikomu mizu no
On Thu, 2010-06-03 at 06:48 -0700, mo...@deepbondi.net wrote:
On Thu, 3 Jun 2010, Maciej Piechotka wrote:
Hmm. Thanks - however I fail to figure out how to do something like:
generate a random number with normal distribution with average avg and
standard deviation stdev.
Hi!
I have filed a new proposal to GHC bugs/whishes process based on the previous
discussion here.
The proposal address is
http://hackage.haskell.org/trac/ghc/ticket/4116#comment:2
( I had some formatting problems with the first posting,
so it is better read at comment:2)
Voters
Hi,
I'm just re-reading the book again, this time doing the exercises though :)
Is there a site with solutions for the exercises?
Günther
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, 2010-06-01 at 21:45 +0300, Yitzchak Gale wrote:
I wrote:
I have often generated PostScript from Haskell...
Then you convert the PS to PDF using any of the nice
utilities around for that
Pierre-Etienne Meunier wrote:
Isn't there a problem with non-type 1 vectorial fonts being
On Jun 4, 2010, at 9:42 PM, wren ng thornton wrote:
---unless, perhaps, you have a way of deriving a definition of rvarT from
rvar. If so, then there could be efficiency issues in the other direction. I
could see some people just giving a pretty implementation of rvar and using
the
On Jun 5, 2010, at 10:37 , Maciej Piechotka wrote:
PDF is not just simplified, compressed encoding of PostScript. Or at
least - LaTeX have some features PDF-only.
I think that has more to do with the fact that pdftex/pdflatex is
tightly integrated with a dvi converter that understands many
On 6 June 2010 00:37, Maciej Piechotka uzytkown...@gmail.com wrote:
PDF is not just simplified, compressed encoding of PostScript. Or at
least - LaTeX have some features PDF-only.
For example PDF can have hyper-links (both to local and external
content). It can be scripted in JavaScript
should have included this in previous...
On Jun 5, 2010, at 10:37 , Maciej Piechotka wrote:
For example PDF can have hyper-links (both to local and external
content). It can be scripted in JavaScript (don't ask me why) and can
have form (OK. So I can fill them and print probably).
The only
In the new type, the parameter 'a' is misleading. It has no connection to
the
'a's on the right of the equals sign. You might as well write:
type CB = forall a. a - a - a
On Tue, Jun 1, 2010 at 12:40 PM, Cory Knapp cory.m.kn...@gmail.com wrote:
Ah! That makes sense. Which raises a new
Bill Atkins-6 wrote:
readFile reads the file lazily so it isn't closed until the entire
contents have been consumed.
Try System.IO.Strict.readFile, which will read the entire file at once.
Yes, and i can use appendFile too.
appendFile ssqHitNum.txt $ unwords $ [no] ++ map (\n - show
1 - 100 of 105 matches
Mail list logo
