Dan Weston wrote:
I hate to be a party pooper, but isn't this just:
f = foldr (\a z - (a:snd z,fst z)) ([],[])
This takes less time to grok and takes no longer to run.
For each type with exported constructors, one can always write
deconstructors for it, if not already found in libraries.
apfelmus wrote:
Hugh Perkins wrote:
Arguably there are two possible implementations, one that enforces
one-to-one mapping, and one which allows multiple values, in either
direction.
Terminology reminder :)
- the latter is called (binary) relation
http://en.wikipedia.org/wiki/Binary_relation
Andrew Coppin wrote:
...does this mean Haskell is officially harder to understand than Lisp,
Java, Perl and O'Caml? :-}
(OTOH, does this mean Haskell is easier to understand than PHP or C++?)
Or, Haskell is the easiest to understand of them all.
Reason: Extremely large channel means so hard
Neil Mitchell wrote:
Other rules that could be interesting are:
forall a b. fromInteger a + fromInteger b = fromInteger (a + b)
forall a b. fromInteger a * fromInteger b = fromInteger (a * b)
This is wrong, since the class function can do what it wants. Imagine:
instance Num String where
Andrew Coppin wrote:
Prelude :m Text.ParserCombinators.Parsec
Prelude Text.ParserCombinators.Parsec parseTest (endBy anyToken (char
'#')) abc#
Loading package parsec-2.0 ... linking ... done.
parse error at (line 1, column 1):
unexpected b
expecting #
I read the doc and determined that it is
Peter Hercek wrote:
So the question is what am I missing? Any nice use cases where
fixed point search is so good that it is worth the trouble with
figuring out new and new variable names for essentially the same
stuff?
When I write functional code, I do find myself writing recursions much
Andrea Rossato wrote:
loop s = do
putStrLn s
Most likely, the content of s sits in a local buffer and never leaves
this process, following most OS conventions and as others point out.
Another process waiting for it will deadlock.
Most similar process deadlock problems are not
Mitar wrote:
I did once try to learn Prolog. And failed. Miserably.
You should backtrack at this point and try again differently. :-)
There is likely a problem if he has inadvently walked past a cut. XD
___
Haskell-Cafe mailing list
Bryan O'Sullivan wrote:
Your problem may be buffering-related (I haven't read your code to
check), but if so, there's a fair likelihood that it has nothing to do
with the OS. GHC's runtime does its own buffer management on Handles.
It's quite possible that your deadlock lies at that level,
Albert Y. C. Lai wrote:
It is similar to saying, if you use Haskell, you don't have to learn
dependent typing. Ah, but knowing dependent typing informs you of
certain typing issues and how to use the Haskell type system more
successfully. This is despite tutorials on dependent typing talk
Brent Yorgey wrote:
Then one day he met someone else who said she was also a race car
driver, but her car was different -- she called it a Haskar. It had a
top speed of 400 miles per hour, no steering wheel (you just lean
whichever way you want to go, she said),
I wish I could just lean
To the tune of the theme song of Ghostbusters:
You've got an Int
But you want Double
Who do you call?
fromIntegral!
(The inverse conversion requires you to think about rounding first.)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
ok wrote:
So we have
C++ : imperative language whose type system is a Turing-complete
functional language (with rather twisted syntax)
Haskell: functional language whose type system is a Turing-
complete logic programming language (with rather twisted
Miguel Mitrofanov wrote:
tfoldr (-) 1 [4,3]
= 4-3-(-1)
= 2
Erm? You mean foldr?
Blame it on OCR.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
[EMAIL PROTECTED] wrote:
Data with where?
You haven't heard about GADTs?
To avoid clashing with GADT's where, I propose to rename ok's keyword
to wherein, or wheretype, or something
data B k v = E | F b b wherein type b = B k v
data B k v = E | F b b wheretype b = B k v
(I also propose
Don Stewart wrote:
It was raised at CUFP today that while Python has:
Python is a dynamic object-oriented programming language that can be
used for many kinds of software development. It offers strong
support for integration with other languages and tools, comes with
extensive
The Hackathon is a good opportunity to collect preliminary data.
Imagine: All other communities are still at the stage of we feel
productivity. We have our data shows productivity. That puts us at a
completely different level --- light-years above the crowd.
Haskell --- because we put the
PR Stanley wrote:
failure :: (Parser a) failure = \inp - []
The code might contain some syntax errors and I'd be grateful for any
corrections.
It looks right conceptually. Depending on the definition of Parser, you
may need
failure = P (\inp - [])
or whatever constructor name instead of
Tim Newsham wrote:
You are not expected to understand this.
http://swtch.com/unix/
Hehehe!
Elite system programmers understand it.
If it is rephrased in terms of continuations, elite lambda calculus
programmers will also understand it.
You are not expected to be convinced this, but it
jeff p wrote:
I think this is referring to Andrzej Filinski's paper Representing
Layered Monads in which it shown that stacks of monads can be
implemented directly (no layering) by using call/cc and mutable state.
I have been unable to see how to bring its crucial reify and reflect
to
Richard Bird's Introduction to Functional Programming using Haskell,
second edition exceeds other introductory books by introducing laws
(e.g., fold laws, fusion laws), efficiency issues (including the stack
overflow question, deforestation), and monad transformers.
IMO these are
Thomas Hartman wrote:
Since I'm interested in the stack overflow issue, and getting acquainted
with quickcheck, I thought I would take this opportunity to compare your
ordTable with some code Yitzchak Gale posted earlier, against Ham's
original problem.
As far as I can tell, they're the
Magnus Therning wrote:
I'll certainly try to look into all of that. However, I suspect your
suggestion doesn't scale very well. On my original code it's easy, it
was less than 10 lines, but how do I know where to start looking if it's
a program of 100 lines, or 1000 lines? The problem could
Stefan O'Rear wrote:
On Wed, Nov 07, 2007 at 10:30:30AM +0100, [EMAIL PROTECTED] wrote:
[I changed the subject, so (hopefully) rare people who just follow the
thread may miss it, but I couldn't look at the name of Fibonacci with
two errors in it anymore...]
People with real e-mail clients
Combinators get my code done, tralalalala, laughing out loud!
Quickcheck locates all of my bugs, tralalalala, laughing out loud!
Fusion laws make my code run fast, tralala, lalala, lololol!
Folks, I'm so done, Merry Christmas, tralalalala, laughing out loud!
Bryan O'Sullivan wrote:
Albert Y. C. Lai wrote:
I can't blame you for being not observant. Afterall, this is precisely
what I'm alluding to with everyone can haz PC [...]
Please don't flame people on the list.
I'm flaming an idea, not people on the list
Vimal wrote:
What is the difference between In-Reply-To and References?
There was a time In-Reply-To was for emails and References was for Usenet.
Nowadays emails have both In-Reply-To and References. Usenet still
sticks with just References.
___
Thomas Hartman wrote:
-- (myfoldl f q ) is a curried function that takes a list
-- If I understand currectly, in this lazy fold, this curried function
isn't applied immediately, because
-- by default the value of q is still a thunk
myfoldl f z [] = z
myfoldl f z (x:xs) = ( myfoldl f q ) xs
Joost Behrends wrote:
@Daniel: no, this doesn't solve the stack problem. These are the primefactors of
2^120+1: [97,257,673,394783681,4278255361,46908728641].
oddFactors k n | otherwise = oddFactors (k+2) n
could eventually push 394783681-673 function calls onto the stack before finding
the
Justin Bailey wrote:
Given this function:
dropTest n = head . drop n $ [1..]
I get a stack overflow when n is greater than ~ 550,000 . Is that
inevitable behavior for large n? Is there a better way to do it?
Just for fun, throw in dropTest :: Int - Int and experiment again! :)
Achim Schneider wrote:
[n..] == [m..],
the first thing I notice is
n == m n+1 == m+1
, which already expresses all of infinity in one instance and can be
trivially cancelled to
n == m
, which makes the whole darn thing only _|_ if n or m is _|_, which no
member of [n..] can be as long as
Justin Bailey wrote:
When I joined the haskell-cafe mailing list, I was surprised to see
the reply-to header on each message was set to the sender of a given
message to the list, rather than the list itself. That seemed counter
to other mailing lists I had been subscribed to, but I didn't think
Mitar wrote:
I am really missing the (general) split function built in standard
Haskell. I do not understand why there is something so specific as
words and lines but not a simple split? The same goes for join.
Don't forget Text.Regex.splitRegex.
Ben Franksen wrote:
Of course this doesn't prove that humans can, in
principle, decide equality for any pair of functions. But neither has the
opposite been proved.
Premise: The human should still give the reasoning behind his/her
decisions. The reasoning should be within a proof system
apfelmus wrote:
I don't know a formalism for easy reasoning about time in a lazy
language. Anyone any pointers? Note that the problem is already present
for difference lists in strict languages.
http://homepages.inf.ed.ac.uk/wadler/topics/strictness-analysis.html
especially strictness
Achim Schneider wrote:
Erm...
There is this story about some military (US afair) training a neural
net to detect tanks in images, I can't find the link right now.
It worked, with amazing 100% accuracy.
Then they threw another batch of images at the net.
It worked, with devastating 50%
Richard Kelsall wrote:
Imagine
two experienced Haskell programmers on the phone, one reading a Haskell
program snippet to the other.
u can txt msg XD
^^--- unworded symbol people grasp just fine.
___
Haskell-Cafe mailing list
Some docs are in a miserable state of being incomplete.
And then some programmers are in a miserable state of not respecting docs
when the docs are complete.
Why should anyone expect
deleteBy (=) 5 [0..10]
to accomplish anything meaningful, if he/she respects the written docs?
Today someone
I accidentally found a rarely encountered omission in Cabal (the lib, because
via Setup.hs) by building Haskell Platform as shared libs from source.
It is rare because you have to use both --enabled-shared and
--package-db=blah together to run into it. --package-db=blah is already rare
enough
and I forgot to say the Cabal lib tried is already version 1.8.0.6
ghc is 6.12.3
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Try adding more delay between the two loadings, e.g., make me press enter,
and hope I am not faster than a computer:
main = do
writeTarget arg
func0 - compileTarget
putStrLn $ show $ func0 2
getLine
writeTarget arg*2
func1 - compileTarget
putStrLn $ show $ func1 2
On 10-07-23 02:43 PM, michael rice wrote:
liftM2 :: Monad m = (a1 - a2 - r) - m a1 - m a2 - m r
[...]
What does it mean to promote a function to a monad?
liftM2 f m1 m2 is canned code for
do
a1 - m1
a2 - m2
return (f a1 a2)
for example liftM2 f [s,t] [x,y] is [f s x, f s y, f t x, f
On 10-07-31 01:30 PM, Brandon S Allbery KF8NH wrote:
On 7/31/10 12:59 , michael rice wrote:
But since both still have eval x to *thunk* : *thunk*, g evaluates to a
deeper level?
The whole point of laziness is that f *doesn't* have to eval x.
To elaborate, in computer-friendly syntax:
f x
On 10-08-04 01:00 AM, Mark Lentczner wrote:
Sample pages: http://www.ozonehouse.com/mark/snap-xhtml/index.html
On the Contents page, among the collapsable trees: when I click on a
link that is also a parent, such as Snap.Http.Server and
Text.Templating.Heist, it has the undesirable side
Bjorn Bringert wrote:
pwrapper is not an HTTP server, though the Haddock comment can make you
think so. pwrapper allows you to talk *CGI* over a TCP port, but I have
no idea why anyone would like to do that.
Here is a scenerio. I want a basic web application: someone makes a
request, and my
Henning Thielemann wrote:
At
http://www.haskell.org/hawiki/HaskellDbTutorial
it is described, how database queries can be modelled with a monad.
However, I wonder if this is also possible without monads. Say, writing
DB.map col1 $ DB.filter (\row - col2 row == 10+2) myTable
for
SELECT col1
[EMAIL PROTECTED] wrote:
Albert Y. C. Lai wrote:
If and only if the database is a purely functional immutable data
structure, this can be done. [...]
Many interesting databases are not purely functional immutable; most
reside in the external world and can spontaneously change behind your
h. wrote:
But it does not work as I expected. As long as there is no need to put some
input after having received some output it is no problem, but real interaction
seems not possible.
Right, this particular program works just for a particular interaction.
What real interaction do you have
Call me a technophile, but it saddens me that ASCII has already held us
back for too many decades, and looks like it will still hold us back for
another.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
All record fields are in the same namespace, and furthermore this is
also the same namespace of functions and class methods. In other words
you cannot have two record types containing the same field name, and you
cannot have a record field and a function using the same name, and you
cannot
Thomas Nelson wrote:
data ISine = Sine Integer Integer Integer String |
MetaSine Integer Integer Integer [ISine]
Having advised you to use different field names for different record
types last time, I now confuse you by saying you can share field names
in the different cases
Magnus Therning wrote:
This might seem like a silly question, but what's the reasoning behind
the following behaviour?
% ghc-pkg list dataenc
/usr/lib/ghc-6.8.2/package.conf:
% ghc --make -hide-package dataenc -isrc UT.hs
ghc-6.8.2 : unknown package: dataenc
Hiding an uninstalled package
Matthew Pocock wrote:
I've been using hxt to process xml files. Now that my files are getting a bit
bigger (30m) I'm finding that hxt uses inordinate amounts of memory. I have
8g on my box, and it's running out. As far as I can tell, this memory is
getting used up while parsing the text,
Is it good or bad to add:
instance (MonadIO m) = MonadIO (ParsecT s u m)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Alan Carter wrote:
if((fp = fopen(...)) != NULL)
{
if(fgets(...) != NULL)
{
printf(...);
}
fclose(...)
}
This reminds me of a 1976 article written by David Parnas and Harald
Würges: Response to undesired events in software systems. Since it's
old, it is harder to
Jefferson Heard wrote:
Main: No match in record selector Protein.go_terms
data R = A { sa :: Int } | B { sb :: Int }
sa (A 0) works (as expected). sa (B 0) gives
*** Exception: No match in record selector Main.sa
I think that explains your problem.
The following is in ghci 6.8.2 with default options (e.g., default heap
and stack). G denotes the ghci prompt.
At some points ghci will use 500MB of memory. Be sure you have enough
physical memory.
G :m + Data.List System.Random
G let f n = take n randoms (mkStdGen 0)) :: [Float]
I define f
Robert Vollmert wrote:
In short, I'm constantly running into what appear to be artificial type
restrictions in Control.Arrow.ArrowTree. For example, the signature of
deep is
deep :: (Tree t, ArrowTree a) = a (t b) (t b) - a (t b) (t b)
instead of the more general
deep :: (Tree t, ArrowTree
Paul Keir wrote:
I’m having some difficulty using the Parsec library, perhaps you could
help. I’ve reduced my problem as shown below. I would like the
‘only_prod’ parser to require the reserved string “only”, _optionally_
followed by an identifier. As part of ‘mytest’, this should then be
Cetin Sert wrote:
is there a version of getChar that doesn't buffer keyboard input until
enter is pressed?
Look into hSetBuffering (module System.IO or IO). As a quick start:
hSetBuffering stdin NoBuffering
___
Haskell-Cafe mailing list
Patrick Surry wrote:
I've seen other discussions that suggest that lists are always shared
while in scope (so the fibs trick works). But is that just a feature of
the standard compilers, or is it somewhere mandated in the Hakell spec
(I don't see anything obvious in the Haskell Report tho
rodrigo.bonifacio wrote:
I´m just starting with HXT. My question is, how can I expose a use case from
the main function below (the XmlPickler for UseCase has been already defined):
main :: IO ()
main = do
runX ( xunpickleDocument xpUseCase [ (a_validate,v_0) ], uc.xml )
return ()
John Goerzen wrote:
That's a wonderful interface, but unfortunately it appears to assume that
your Unicode I/O is always UTF-8, and never UTF-16. I happen to deal with
more UTF-16 data than UTF-8 over here at the moment.
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/encoding
Edsko de Vries wrote:
sum :: Tree - Int
sum t = sum' [t] 0
where
sum' [] acc = acc
sum' (Leaf i : ts) acc = sum' ts $! (i + acc)
sum' (Node l r : ts) acc = sum' (l : r : ts) acc
Because of $!, you should compare the Leaf case to foldl', not foldl.
The Node case can be said to
Lennart Augustsson wrote:
Even so, it's instructive to study how the normal order reduction of
this expression would proceed under the assumption that all 4 elements
will be used.
I think it's useful to try normal order until weak head normal form.
Not all steps are shown. Definitions of
Advanced technology ought to look like unpredictable magic.
My experience with lazy evaluation is such that every time a program is
slower or bulkier than I presumed, it is not arbitrariness, it is
something new to learn.
My experience with GHC is such that every surprise it gives me is a
Andrew Coppin wrote:
2. Does anybody know how to actually read GHC's Core output anyway? To
me, it looks almost exactly like very, very complicated Haskell source
with a suspicious concentration of case expressions - but I understand
that in the Core language, many constructs actually mean
Paul Johnson wrote:
The solution is for the programmer to rewrite mean to accumulate a
pair containing the running total and count together, then do the
division. This makes me wonder: could there be a compiler optimisation
rule for this, collapsing two iterations over a list into one.
Do
Claus Reinke wrote:
Germans have no problems with sentences which though started at
the beginning when observed closely and in the light of day (none of
which adds anything to the content of the sentence in which the very
parenthetical remark you -dear reader- are reading at this very moment
Neil Mitchell wrote:
Sounds like a bidirectional Map to me - fortunately hackage already
has one of these:
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/bimap
Yes, bimap is even better. Save lots of work.
___
Haskell-Cafe mailing list
geoffrey wrote:
Give the following code below, my question is - how do i setup a
dependency of User on Common?
Perhaps a first attempt should not have Common store a reference to
User, nor User store a reference to Common. Instead, have two
Data.Map.Map's: one looks up from Common to User,
Ronald Guida wrote:
I was looking at the real time queues in [1] and I wanted to see what
would happen if I tried to write one in Haskell. The easy part was
translating the real time queue from [1], p43 into Haskell.
The hard part is testing to see if the rotations really happen what
they
Jon Harrop wrote:
IRL the specification often dictates the complexity. If your code fails to
satisfy the spec then it is wrong. Are you saying that Haskell code can never
satisfy any such specification?
In addition to RL, it it should and it can in theory too:
apfelmus wrote:
I haven't heard the terms laziness leak and strictness leak before,
imho they sound a bit spooky because it's not clear to me what the
situation without leak would be. (Time vs Space? Is an O(n) algorithm a
strictness leak compared to an O(log n) algorithm?)
Leak refers to a
Adam Vogt wrote:
While we are kind of on this topic, what makes the characters ħ þ prefix
operator by default, while º and most other odd ones infix?
alphanumeric vs non-alphanumeric
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Daryoush Mehrtash wrote:
Can some one explain what the !a does in this:
data Color3 a = Color3 !a !a !a
Shameless plug: http://www.vex.net/~trebla/haskell/strict-field.xhtml
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On 10-09-02 12:10 PM, Stephen Sinclair wrote:
Sorry to go a bit off topic, but I find it funny that I never really
noticed you could perform less-than or greater-than comparisons on
Bool values. What's the semantic reasoning behind allowing relative
comparisons on booleans? In what context
On 10-09-02 09:57 PM, John Millikin wrote:
Is there any particular reason you're using XHTML instead of HTML?
You're using a transitional doctype, invalid IDs, and the .html file
extension -- in short, HTML with an incorrect doctype. The markup
doesn't even validate.
[...]
XHTML is supported
On 10-09-04 01:31 AM, John Millikin wrote:
It's not correct. Here's the exact same XHTML document (verify by
viewing the source), served with different mimetypes:
http://ianen.org/temp/inline-svg.html
http://ianen.org/temp/inline-svg.xhtml
This relies on xhtml+svg. While it is in the xhtml
On 10-09-04 05:46 PM, Jeremy Shaw wrote:
Mark suggested that it was easier to achieve multi-browser
compatibility using xhtml instead of html, but I am quite certain he
is mistaken. There are really three different rendering modes found in
browsers:
1. standards mode
2. quirks mode
3.
On 10-09-03 06:11 AM, Henning Thielemann wrote:
Yes, something this way. () suggests a notion of magnitude for me,
which some orderings do not have.
Like for example -1000 has a larger magnitude than -0.0001, therefore
you also reject the common ordering -1000 -0.0001?
On 10-09-09 05:30 PM, Keith Sheppard wrote:
Maybe malicious isn't the right word but there is a JS based web
counter on http://www.haskell.org/complex/why_does_haskell_matter.html
which likes to show pop up adverts. They must have switched over from
counting visitors to showing adverts at some
On 10-09-23 04:57 PM, Andrew Coppin wrote:
If you think that sounds silly, ask some random person (not a computer
programmer, just some random human) how find the sum of a list of
numbers.
My reply: to sum 10 numbers, sum 9 numbers, then account for the 10th.
More at:
On 10-10-27 06:31 AM, Günther Schmidt wrote:
this may be an odd question to some, but I think it's actually quite an
un-extraordinary one.
Who's in charge?
Of Haskell I mean. If there was some alien from Planet Java to land on
Planet Haskell and demand to be taken to our leader, whom would we
On 10-11-03 10:00 PM, Jonathan Geddes wrote:
It's called The *Ultimate* Computer Language Guide, and it's on the
internets, so it must be correct, right?
The correct conclusion: it's on the internets, so it must be LOL.
I also invite you to play with my:
On 10-11-05 06:43 AM, Magnus Therning wrote:
runhaskell Setup register --gen-script
runhaskell Setup unregister --gen-script
[...]
Except
that the generated register/unregister scripts now also point to
my-temp-db, and there seems to be no way to prevent this. I solved it
for now
Typed-directed name resolution brings Haskell closer to a write-only
language; that is, an ambiguous phrase made total sense to the author
when the author wrote it, but an independent reader will need
extraordinary effort to disambiguate.
{-# LANGUAGE TypeDirectedNameResolution #-}
import
A better solution to import-induced name clashes is Rename When Import.
You can already rename the module when importing. Let's rename the
imported names too.
Assume I want to import this module:
module SinisterlyNamedModule where
data Parsec = State { stdin :: () }
| Cont {
On 10-11-10 02:51 PM, Albert Y. C. Lai wrote:
import SinisterlyNamedModule(
par...@goodtype(st...@caseone(st...@gfa),
c...@casetwo(ru...@gfb, froml...@gfc)
),
Sorry, that part was mistaken, and not in line with standard Haskell.
Here is the correction
On 10-11-19 04:39 PM, Matthew Steele wrote:
TAPL is also a great book for getting up to speed on type theory:
http://www.cis.upenn.edu/~bcpierce/tapl/
I am no type theorist, and I nonetheless found it very approachable.
TAPL is surprisingly easy-going. It is long (many pages and many
On 10-11-20 02:54 PM, José Romildo Malaquias wrote:
In order to download a given web page, I wrote the attached program. The
problem is that the page is not being full downloaded. It is being
somehow intettupted.
The specific website and url
Most likely you also have the zlib package (cabal-install needs it), so
let's use it. Attached therefore.hs
import qualified Data.ByteString.Lazy as LB
import Codec.Compression.GZip(decompress)
import Network.URI(parseURI)
import Network.HTTP
url =
On 10-11-24 08:52 PM, Iain Alexander wrote:
F:\Util\Haskellcabal fetch mtl==2.0.0.0
Resolving dependencies...
cabal: internal error: could not construct a valid install plan.
cabal fetch mtl-2.0.0.0
___
Haskell-Cafe mailing list
On 10-11-27 09:20 AM, jutaro wrote:
ghc is a package, which exposes Ghc-Api as a library. It gets usually
installed, when you install Ghc or Haskell platform. As I remeber , it is
usually in a hidden state, but ghc-pkg list should show it.
Except that Fedora's GHC really doesn't come with the
On 10-11-28 09:55 AM, Ketil Malde wrote:
Joachim Breitnerm...@joachim-breitner.de writes:
I would not recommend using --global on Debian/Ubuntu-systems, as it
might interfere with packages installed by Debian.
But 'cabal install --global' installs in /usr/local/, does it not?
And official
On 10-11-29 03:15 PM, Albert Y. C. Lai wrote:
cabal install --global binary
apt-get install libghc6-binary-dev
They are the same version (at the time of writing, and assume Ubuntu
10.10) and they will fight for the unique throne of binary-0.5.0.2 in
the metadata.
Oh bother, Debian/Ubuntu's
On 10-11-30 05:19 AM, Ketil Malde wrote:
It seems to me that while there are *three* ways to install stuff: apt-get
install, cabal install --global, and cabal install --user, there are
just *two* ways things get installed, globally and user(ly?).
The obvious solution would be to have three
On 10-12-04 01:03 PM, Antoine Latter wrote:
Here's a Reddit post:
http://www.reddit.com/r/haskell/comments/efw38/reminder_hackagehaskellorg_outage_tomorrow_due_to/
This is the second consecutive time a planned downtime is not announced
on either mailing lists.
This seems to me planned
On 10-12-05 12:34 PM, Daniel Peebles wrote:
Oh yeah, the 2.0 stuff that snobby techies love to hate :) hrrmpf back
in my day we programmed in binary using a magnetized needle on the
exposed tape! I don't need any of this newfangled bull.
I kid! But I am curious to see why people are so
Perhaps ghc should also ignore all group-writable *.hs, *.lhs, *.c, *.o,
*.hi files.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
1 - 100 of 352 matches
Mail list logo
