Hi,
Here is an example:
let l = fun num in
if isIntegral l
then l
else 0
How to do the isIntegral thing?
On Tue, Sep 29, 2009 at 1:58 PM, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
Hi,
In other weak-type language, `round i == i` would work. But in
haskell, what
Magicloud,
There are numerous ways to construct such a function. Hoogling
(Fractional a, Integral b) = a - b brings up a host of functions
that would be of use here in combination with fromIntegral.
Thomas
On Mon, Sep 28, 2009 at 11:11 PM, Magicloud Magiclouds
magicloud.magiclo...@gmail.com
Use properFraction:
http://haskell.org/ghc/docs/latest/html/libraries/base/Prelude.html#v%3AproperFraction
Hi,
In other weak-type language, `round i == i` would work. But in
haskell, what should I do? Thanks.
--
竹å¯å²å¦¨æµæ°´è¿
å±±é«åªé»éäºé£
It never matches to (_, 0.0)
I mean
case properFraction l of
(_, 0) - l
_ - 0 -- always goes here.
On Tue, Sep 29, 2009 at 2:18 PM, Jimmy Hartzell j...@shareyourgifts.net wrote:
Use properFraction:
http://haskell.org/ghc/docs/latest/html/libraries/base/Prelude.html#v%3AproperFraction
On Mon, Sep 28, 2009 at 4:13 PM, John A. De Goes j...@n-brain.net wrote:
If you have counterexamples, then perhaps you can name them. I'm looking
for Java shops with 5+ developers and code bases of 100k converting over
to Haskell. I don't know _any such shop_ that has switched to Haskell,
On Mon, Sep 28, 2009 at 11:35 PM, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
It never matches to (_, 0.0)
I mean
case properFraction l of
(_, 0) - l
_ - 0 -- always goes here.
Odd, it works fine for me.
f x =
case properFraction x of
(_,0) -
$ ghci
Prelude let isInteger' l = case properFraction l of { (_,0) - 1; _ - 0 }
Prelude isInteger' 2.0
1
Prelude isInteger' 1.9
0
Do you really get 1? For what input types/values? Although I would write:
isInteger = (== 0) . snd . properFraction
It never matches to (_, 0.0)
I mean
case
The original code is
givenSum num = map (\a -
let l = (sqrt $ fromIntegral (a * a + 2 + 2 *
num)) - (fromIntegral a) in
case properFraction l of
(_, 0) -
True
_ -
Michael == Michael Snoyman mich...@snoyman.com writes:
Michael not be written in pure Haskell, but then again I'm not
Michael sure if there are any fully W3 compliant browsers *not*
Michael written in C++.
I'm not sure if there are any fully W3 compliant browsers.
How could there
Unless I missed something, the function in question is:
sqrt (a * a + 2 + 2 * num) - fromIntegral a
where num = 10
1 - sqrt (1 * 1 + 2 + 2 * 10) - 1 - sqrt (1 + 2 + 20) - 1 - sqrt
(23) - 1 - 3.79x
the fractional will only ever come from the sqrt function. Do any of
the following actually
Did you test the properFraction-based code in isolation? If code is
broken, it's important to figure out which part of it is broken. Also,
this function is not divided into constituent parts, but is a long unruly
mess. Dividing it into parts would make it much much more readable, and
you would
Of course them are not. But that is why I need the detector
2009/9/29 Thomas DuBuisson thomas.dubuis...@gmail.com:
Unless I missed something, the function in question is:
sqrt (a * a + 2 + 2 * num) - fromIntegral a
where num = 10
1 - sqrt (1 * 1 + 2 + 2 * 10) - 1 - sqrt (1 + 2 + 20) - 1
The properFaction part is correct. So I posted the whole code, since
isInteger should accept any reasonable incoming types. Well, in this
one situation, it does not. And I cannot figure out why
On Tue, Sep 29, 2009 at 3:07 PM, Jimmy Hartzell j...@shareyourgifts.net wrote:
Did you test the
On Tue, Sep 29, 2009 at 9:13 AM, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
The properFaction part is correct. So I posted the whole code, since
isInteger should accept any reasonable incoming types. Well, in this
one situation, it does not. And I cannot figure out why
Which I will not blather on too long about here, but point you at a blog
posting instead:
http://www.serpentine.com/blog/2009/09/29/criterion-a-new-benchmarking-library-for-haskell/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
*Should* isInteger be returning True for any numbers generated by this
code? If so, can you simplify this test down to that example, so that
it's obvious what the test should do, and that it's not doing it (if it in
fact is not doing as it should)? In any case, it would help to divide this
block
I'm pleased to announce version 2999.6.0.0 [1] of the graphviz library,
which provides bindings to the GraphViz [2] suite of tools for drawing
graphs.
[1] http://hackage.haskell.org/package/graphviz-2999.6.0.0
[2] http://www.graphviz.org/
Changes since the previous version are:
* Remove some
Alp Mestan wrote:
Indeed, OCaml has stuctural polymorphism, it's a wonderful feature.
*# let f myobj = myobj#foo Hi !;;
val f : foo : string - 'a; .. - 'a = fun*
And Haskell has that too:
-- This is how we define labels.
data Field1 deriving Typeable; field1 = proxy::Proxy Field1
--
Graphalyze [1] is a library for using graph-theoretic techniques to
analyse the relationships inherent within discrete data. It was
originally written for my Honours thesis [2] last year, and I have now
started updating it.
[1] http://hackage.haskell.org/package/Graphalyze
[2]
number = do { num - natural
; return $ num
}
main = do
txt - hGetContents stdin
print $ parse number stdin txt
why doesn't that work?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Ivan, could you please mention some examples of things you can do with
the library here in the mailing list? I am intrigued by the idea.
2009/9/29 Ivan Lazar Miljenovic ivan.miljeno...@gmail.com:
Graphalyze [1] is a library for using graph-theoretic techniques to
analyse the relationships
Hi Bryan
looks great.
The examples directory mentioned in the README, however, does not seem
to be included in the package updated to hackage (though is available
in darcs).
This might be a bit confusing for new users.
Regards,
titto
2009/9/29 Bryan O'Sullivan b...@serpentine.com:
SourceGraph [1] is a tool to statically analyse your Haskell code by
applying graph-theoretic techniques on the call graph. It utilised the
Graphalyze [2] library to do so, both of which were originally written
as part of my Honours thesis last year [3].
[1]
I had never seen this work, it's just awesome !
And it only needs few Haskell extensions.
Is this work deeply documented somewhere except in research papers ? If not,
it could be worth doing, IMO.
On Tue, Sep 29, 2009 at 9:37 AM, o...@okmij.org wrote:
Alp Mestan wrote:
Indeed, OCaml has
Eugene Kirpichov ekirpic...@gmail.com writes:
Ivan, could you please mention some examples of things you can do with
the library here in the mailing list? I am intrigued by the idea.
Couldn't you wait until you read my announcement email for SourceGraph? :p
Other ideas I had for this kind of
By unanimous opinion the text library is the man.
Thanks to all who answered.
titto
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
2009/9/29 Paulo Tanimoto tanim...@arizona.edu:
Hi Bryan and others,
On Mon, Sep 28, 2009 at 5:29 PM, Bryan O'Sullivan b...@serpentine.com wrote:
bytestring predates the other two libraries by several years. The underlying
stream type for uvector and text are almost the same, so they could in
I don't know, but:
number
-- definition
= do { num - natural ; return $ num }
-- desugar
= natural = \num - return $ num
-- apply ($)
= natural = \num - return num
-- eta elimination (f == \x - f x)
= natural = return
-- monad law
= natural
(modulo monomorphism restriction, since number doesn't
Resolved. As Thomas said, mixing up sure is a bad thing. But then I
have to name so many meanless (at least I think) computing process
On Tue, Sep 29, 2009 at 3:32 PM, Jimmy Hartzell j...@shareyourgifts.net wrote:
*Should* isInteger be returning True for any numbers generated by this
code?
Johan Tibell johan.tib...@gmail.com writes:
I agree with Don. Also, I don't think that a Unicode type should
mention what encoding it uses as it's an implementation detail.
Right. I see from the documentation that it uses Word16s (and presumably
the utf-16 encoding). Out of curiosity, why
Ivan == Ivan Lazar Miljenovic ivan.miljeno...@gmail.com writes:
Ivan I'd appreciate it if people could give SourceGraph a whirl
Fails to install (Linux x86_64):
Data/Graph/Analysis/Utils.hs:207:43:
Ambiguous occurrence `dotizeGraph'
It could refer to either
On Sat, 26 Sep 2009 09:18:01 -0700 (PDT), Joe Fredette
jfred...@gmail.com wrote:
* ksf: (But if (on the other hand)) (I think only a number in general
(whether it be five or a hundred)) (this thought is rather the
representation of a method (whereby a multiplicity (for instance
These problems are critical -- but not hopeless, I think:
(1) A simple technical matter, any average Haskell programmer (including
myself...) can build a platform, e.g. in Happstack or the like, to clear
this up (given you want to do this in Haskell ;-).
(4) This is a special one, which I
On Tue, Sep 29, 2009 at 2:30 AM, Magicloud Magiclouds
magicloud.magiclo...@gmail.com wrote:
Resolved. As Thomas said, mixing up sure is a bad thing. But then I
have to name so many meanless (at least I think) computing process
That is the primary challenge of writing readable code:
Colin Paul Adams co...@colina.demon.co.uk writes:
Compare the version in the subject to the version you're trying to install...
Ivan == Ivan Lazar Miljenovic ivan.miljeno...@gmail.com writes:
Ivan I'd appreciate it if people could give SourceGraph a whirl
Fails to install (Linux
On Tue, 2009-09-29 at 10:48 +0200, Ketil Malde wrote:
Johan Tibell johan.tib...@gmail.com writes:
I agree with Don. Also, I don't think that a Unicode type should
mention what encoding it uses as it's an implementation detail.
Right. I see from the documentation that it uses Word16s
Ivan == Ivan Lazar Miljenovic ivan.miljeno...@gmail.com writes:
Ivan Colin Paul Adams co...@colina.demon.co.uk writes: Compare
Ivan the version in the subject to the version you're trying to
Ivan install...
You are right. i forgot to do a cabal update first.
--
Colin Adams
Preston
On 29 Sep 2009, at 03:19, Casey Hawthorne wrote:
If you do a student's homework, you are cheating that student out of
an education.
He/She may realize that t late in the future.
--
Regards,
Casey
I'm not sure I agree with that. If they're old enough to be doing
Haskell homework then
Some thoughs:
Most successful languages spread because they are part of a platform which
solves an IT problem. C was part of Unix, both brougth CPU independence when
this was necessary. Java is part of the Java platform, that brougth OS
independence and interoperability at the right time.
Am Dienstag 29 September 2009 09:02:19 schrieb Thomas DuBuisson:
Unless I missed something, the function in question is:
sqrt (a * a + 2 + 2 * num) - fromIntegral a
where num = 10
1 - sqrt (1 * 1 + 2 + 2 * 10) - 1 - sqrt (1 + 2 + 20) - 1 - sqrt
(23) - 1 - 3.79x
the fractional will
Type splices are implemented in the upcoming GHC 6.10.
Simon
| -Original Message-
| From: haskell-cafe-boun...@haskell.org
[mailto:haskell-cafe-boun...@haskell.org] On
| Behalf Of George Pollard
| Sent: 16 September 2009 13:45
| To: Haskell Café
| Subject: [Haskell-cafe] Re: A thought
Am Dienstag 29 September 2009 13:04:38 schrieb Iain Barnett:
Personally, I tend to find exercises without access to the answers
a poor way to learn. You'll learn more from a well crafted example
than you ever will by struggling at something yourself.
I sort of disagree. You'll learn more
Hi,
The API of Language.Haskell.Interpreter says, that 'runInterpreter'
runInterpreter :: (MonadCatchIO m, Functor m) =
InterpreterT m a -
m (Either InterpreterError a)
returns 'Left' in case of errors and 'GhcExceptions from the underlying
GHC API are caught and rethrown as
On 29 Sep 2009, at 12:48, Daniel Fischer wrote:
Am Dienstag 29 September 2009 13:04:38 schrieb Iain Barnett:
Personally, I tend to find exercises without access to the answers
a poor way to learn. You'll learn more from a well crafted example
than you ever will by struggling at something
Hmm... Simon, was it a typo? Is it 6.10.x or 6.12?
Regards,
Rafael
2009/9/29 Simon Peyton-Jones simo...@microsoft.com
Type splices are implemented in the upcoming GHC 6.10.
Simon
| -Original Message-
| From: haskell-cafe-boun...@haskell.org [mailto:
sorry – 6.12
From: haskell-cafe-boun...@haskell.org
[mailto:haskell-cafe-boun...@haskell.org] On Behalf Of Rafael Gustavo da Cunha
Pereira Pinto
Sent: 29 September 2009 13:59
To: Simon Peyton-Jones
Cc: Haskell Café
Subject: Re: [Haskell-cafe] Re: A thought about liberating Haskell's syntax
If you do a student's homework, you are cheating that student out of
an education.
Personally, I tend to find exercises without access to the answers a
poor way to learn. You'll learn more from a well crafted example than
you ever will by struggling at something yourself.
In these lines,
You misunderstood my point. The browser, BigTable clone, and peer-to-
peer networking libraries are starting points for applications -- ones
that I've actually needed at various points in my career. You can grab
them and start developing with them in a few minutes. If you want
these
John A. De Goes wrote:
write them yourself (at a cost of several to dozens of man years),
Is that right?
--
Tony Morris
http://tmorris.net/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
It's the early adopters who develop the first libraries that pull in
ever wider audiences. Yes, the early adopters are drawn by the syntax
of the language, but commercial adoption doesn't come until it's
economically competitive to do so. And that doesn't happen until the
library market
If there is demand for shops to work on smaller jobs in haskell then I
think a having a more specific marketplace/communication platform for
haskell work would be very helpful. If there is a perceived demand, supply
will soon follow.
- Job
On Tue, Sep 29, 2009 at 5:48 AM, Jörg Roman Rudnick
On Sep 29, 2009, at 8:56 AM, Martin Hofmann wrote:
Hi,
The API of Language.Haskell.Interpreter says, that 'runInterpreter'
runInterpreter :: (MonadCatchIO m, Functor m) =
InterpreterT m a -
m (Either InterpreterError a)
returns 'Left' in case of errors and 'GhcExceptions from
Looks very nice! One thing I noticed are a bunch of escaped newlines
somehow ending up in the report:
Class: Num\nData: Bit, Class: Num
They appear each time a class is displayed.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
Saul Malesac wrote:
Excuse me if that is out of subject here, but does anyone know which
tool/writing framework was used to write the Real world Haskell book
?
I'm wondering, in particular, about the capability to
write/edit/publish it online while allowing people to leave comments,
then
Hi all,
I would really appreciate if anyone could
give a look to the following problem.
Thanks in advance!!!
Paolo
-- Forwarded message --
From: Paolo Losi paolo.l...@gmail.com
Date: Mon, Sep 14, 2009 at 10:33 AM
Subject: C++ libraries and GHCI
To:
Perfect ! I've missed this.
Thank you very much.
2009/9/29 Heinrich Apfelmus apfel...@quantentunnel.de:
Saul Malesac wrote:
Excuse me if that is out of subject here, but does anyone know which
tool/writing framework was used to write the Real world Haskell book
?
I'm wondering, in
Don,
On Mon, Sep 28, 2009 at 11:52 PM, Don Stewart d...@galois.com wrote:
brad.larsen:
On Mon, Sep 28, 2009 at 11:11 PM, Hong Yang hyang...@gmail.com wrote:
[...]
Maybe later on we can add an Example section to Description, Synopsis, and
Documentation sections produced by Haddock.
Hi Titto,
On Tue, Sep 29, 2009 at 3:15 AM, Pasqualino Titto Assini
tittoass...@gmail.com wrote:
More in general: what is the right policy for instances definition?
Should the library author provide them, at least for the most common
and appropriate classes (at the cost of adding some
On 2009-09-29 13:18 +0200 (Tue), Alberto G. Corona wrote:
Java is part of the Java platform, that brought OS independence and
interoperability at the right time. .Download-execution on the client
was also a reason for the initial success of Java in the Internet era.
I was a die-hard Java
On 2009-09-29 13:47 +0100 (Tue), Iain Barnett wrote:
So, if I was trying to come up with a solution to a problem that
possibly has multiple solutions, like building an engine for a car, I
would do better if I hadn't seen a (well crafted) working engine by
someone else than if I had?
Iain Barnett wrote:
So, if I was trying to come up with a solution to a problem that
possibly has multiple solutions, like building an engine for a car, I
would do better if I hadn't seen a (well crafted) working engine by
someone else than if I had?
If effort is there, then give me the
Am Dienstag 29 September 2009 14:47:27 schrieb Iain Barnett:
On 29 Sep 2009, at 12:48, Daniel Fischer wrote:
Am Dienstag 29 September 2009 13:04:38 schrieb Iain Barnett:
Personally, I tend to find exercises without access to the answers
a poor way to learn. You'll learn more from a well
On Tue, Sep 29, 2009 at 1:15 AM, Pasqualino Titto Assini
tittoass...@gmail.com wrote:
This is a good point, I also need to make Data.Text an instance of a
few basic classes and I am not sure that I did it correctly.
So far I have:
import Data.Text
instance Binary Text where
put = put
On Tue, 29 Sep 2009, Magicloud Magiclouds wrote:
Hi,
In other weak-type language, `round i == i` would work. But in
haskell, what should I do? Thanks.
Am I right, that you want to check whether a number is a square number?
http://www.haskell.org/haskellwiki/Generic_number_type#isSquare
Atom is a Haskell DSL for designing hard real-time embedded
applications. At Eaton, we use it for automotive control systems. An
Atom description is composed of a set of guarded atomic actions that
operate on a global program state. Atom makes it easy to manage
program concurrency without the
instance Serial Text where
-- DOUBT: is this efficient?
series d = [T.pack (series d :: String)]
-- DOUBT: how to define this
coseries rs = error coseries
What's Serial?
The class used in SmallCheck, similar to the Arbitrary class used by
QuickCheck.
Regards,
Malcolm
Hi everyone,
Dumb question about declaring a function and type synonyms.
There are to different declarations of the same function:
attrNames :: String - AttrDict - [String]
attrNames :: AttrClass - AttrDict - AttrNames
First gives you the idea about exact types it expects (except AttrDict for
Principal investment firm based in Manhattan is looking for an outstanding
software developer to maintain and develop proprietary accounting and
portfolio management systems. Job duties will include coding projects as
well as management of outsourced system maintenance.
Candidates should have
Hi, is there anyone can tell me what does the ::= mean?And what does the
code below mean?
expr ::= expr addop term | term
Thank you in advance!
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
google://BNF
2009/9/29 xu zhang douy...@gmail.com:
Hi, is there anyone can tell me what does the ::= mean?
And what does the code below mean?
expr ::= expr addop term | term
Thank you in advance!
___
Haskell-Cafe mailing list
Hello,
I have a program that does a lot of unicode manipulation. I'd like to use
hslogger to log various operations.
However, since hslogger uses System.IO.putX, the unicode comes out mangled.
I hacked the source to
use System.IO.UTF8 instead, but it would be nice if that was an option so I
On Tue, Sep 29, 2009 at 7:40 PM, Olex P hoknam...@gmail.com wrote:
Hi everyone,
Dumb question about declaring a function and type synonyms.
There are to different declarations of the same function:
attrNames :: String - AttrDict - [String]
attrNames :: AttrClass - AttrDict - AttrNames
That expression below Is a part of a Grammar in BNF. It means that an
expression is form by an expression, an add operation and a Term or simply just
a Term...
-Original Message-
From: xu zhang douy...@gmail.com
Date: Tue, 29 Sep 2009 14:15:48
To: haskell-cafe@haskell.org
Subject:
On Mon, Sep 28, 2009 at 9:50 PM, Hong Yang hyang...@gmail.com wrote:
Good libraries are not enough for a language to go beyond mere existence.
There must exist good documents, i.e., good tutorials, good books, and good
explanations and examples in the libraries, etc, that are easy for people to
Tom Tobin wrote:
This. As an experienced Pythonista but a beginning Haskeller, there
is *no way* I would have been able to wrap my head around the basics
of Haskell without the tutorage of Learn You A Haskell, Real World
Haskell, and various smaller tutorials scattered around the Haskell
wiki —
Andrew Coppin wrote:
While some of the stuff that comes with GHC is quite well documented,
others are highly under-documented. (As an exercise, go count how many
module descriptions say inspired by the paper by XXX at this URL...)
Somewhat related: If I click on Control.Monad.Error, I get...
On Sun, Sep 27, 2009 at 12:50 PM, Paul Moore p.f.mo...@gmail.com wrote:
The problem is that I have *no idea* how to begin debugging this. In
C, Python, or any other imperative language, I'd put traces in, etc.
But in Haskell, I don't even know where to start.
One of the standard modules is
On Tue, Sep 29, 2009 at 3:36 PM, Andrew Coppin
andrewcop...@btinternet.com wrote:
Tom Tobin wrote:
This. As an experienced Pythonista but a beginning Haskeller, there
is *no way* I would have been able to wrap my head around the basics
of Haskell without the tutorage of Learn You A Haskell,
On Tue, Sep 29, 2009 at 11:40 AM, Olex P hoknam...@gmail.com wrote:
Hi everyone,
Dumb question about declaring a function and type synonyms.
There are to different declarations of the same function:
attrNames :: String - AttrDict - [String]
attrNames :: AttrClass - AttrDict - AttrNames
Andrew Coppin andrewcop...@btinternet.com wrote:
how do we fix all this?
I think the key here is to reduce the cost of contribution to a minimum.
Make it as easy as possible to contribute an example, or to fill in some
missing documentation (and to find it later).
Cabal and hackage have made
korpios:
On Mon, Sep 28, 2009 at 9:50 PM, Hong Yang hyang...@gmail.com wrote:
Good libraries are not enough for a language to go beyond mere existence.
There must exist good documents, i.e., good tutorials, good books, and good
explanations and examples in the libraries, etc, that are easy
This idea with new level of abstraction is good but in some cases it can
make things overcomplicated / less efficient. Does that mean leave simple
built-in types as is?
But probably that's all is the matter of habit and style.
Thanks guys
On Tue, Sep 29, 2009 at 8:58 PM, Luke Palmer
On Tue, Sep 29, 2009 at 3:16 PM, Don Stewart d...@galois.com wrote:
korpios:
wiki — but I still find the array of libraries confusing (just what
comes with GHC — I'm not even talking about Hackage here), since the
What comes with GHC is the Haskell Platform these days.
Actually, the other
korpios:
On Tue, Sep 29, 2009 at 3:16 PM, Don Stewart d...@galois.com wrote:
korpios:
wiki — but I still find the array of libraries confusing (just what
comes with GHC — I'm not even talking about Hackage here), since the
What comes with GHC is the Haskell Platform these days.
On Mon, 2009-09-28 at 12:53 -0700, John Millikin wrote:
In that case, I'll update my code and the wiki to use an alternative code
style.
Ok.
On Mon, Sep 28, 2009 at 09:21, Duncan Coutts
duncan.cou...@googlemail.com wrote:
Your local Cabal version is older than the one Hackage is using and
On Tue, Sep 29, 2009 at 2:21 PM, Olex P hoknam...@gmail.com wrote:
This idea with new level of abstraction is good but in some cases it can
make things overcomplicated / less efficient. Does that mean leave simple
built-in types as is?
But probably that's all is the matter of habit and style.
Yes, the OOHaskell paper blew my mind too, but I still only understood half
of it when reading it for the second time (especially the mfix thing was
scary :-) Not giving up though ;-)
But I wander if the error messages you would get from GHC make it easy to
see what is going wrong. It would be
Forwarding on to the maintainer, in case he's not on the list.
-- Forwarded message --
From: Sean McLaughlin sean...@gmail.com
Date: Tue, Sep 29, 2009 at 1:31 PM
Subject: [Haskell-cafe] suggestion for hslogger
To: haskell-cafe@haskell.org
Hello,
I have a program that does a
dear haskellers --
i'm trying this question again, in haskell-cafe. i got some responses
in haskell-beginners but am looking for more guidance. also, i
understand this functionality is encapsulated in the Workflow module
in hackage, but i'd like to understand this myself. this email is an
On Sun, Sep 27, 2009 at 9:17 PM, Paul Moore p.f.mo...@gmail.com wrote:
That's odd, it seems to be saying it's not installed at all! Hmm, no -
I did a cabal install --user (because Vista doesn't let me do
site-wide installs), looks like cabal list doesn't pick up user
installs.
Hmm, cabal
Alberto G. Corona wrote:
Most successful languages spread because they are part of a platform
which solves an IT problem. C was part of Unix, both brougth CPU
independence when this was necessary. Java is part of the Java
platform, that brougth OS independence and interoperability at the
I read somewhere that for 90% of a wide class of computing problems,
you only need 10% of the source code in Haskell, that you would in an
imperative language.
If this is true, it needs to be pushed.
And if by changing a few lines of source code one can develop a whole
family of similar
On Tue, Sep 29, 2009 at 5:24 PM, Casey Hawthorne cas...@istar.ca wrote:
I read somewhere that for 90% of a wide class of computing problems,
you only need 10% of the source code in Haskell, that you would in an
imperative language.
If this is true, it needs to be pushed.
And if by changing
SORRY... it's *far after midnight* here... of course: Paul Hudak:
http://cs-www.cs.yale.edu/homes/hudak-paul/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Tue, 29 Sep 2009 18:19:08 -0700, you wrote:
On Tue, Sep 29, 2009 at 5:24 PM, Casey Hawthorne cas...@istar.ca wrote:
I read somewhere that for 90% of a wide class of computing problems,
you only need 10% of the source code in Haskell, that you would in an
imperative language.
If this is
We should have GHC 6.12 launch parties like the Windows 7 ones ;)
(if you haven't seen it, and are feeling masochistic:
http://www.youtube.com/watch?v=1cX4t5-YpHQ)
Dan
On Tue, Sep 29, 2009 at 9:36 PM, Casey Hawthorne cas...@istar.ca wrote:
On Tue, 29 Sep 2009 18:19:08 -0700, you wrote:
On
N.B. I'm a newbie to Haskell, and this problem is a bit complex, so
bear with me.
I'm using typeclasses to implement a sort of common interface for all
things -- call them things of type 'Cls' -- that can be expected to
implement a set of functions -- an 'interface' in OOP-speak. (Yes,
yes, I'm
Correction by the author:
It seems that ghc doesn't like the fact that I am saying 'foo' must
return a class 'b' of typeclass 'Bar', while providing a function that
returns a concrete data instance of 'Bar' (viz., FU or FI) later on
when I implement 'foo' in each type classes.
Should read:
In your class, you have:
class Cls c where
foo :: (Bar b) = c - b
There's an implicit forall for b, meaning that the caller of the
method gets to choose what it wants for b (as long as it's an instance
of Bar). For you to be able to write such a method you'd need to write
functions that can
vty-ui is:
An extensible library of user interface widgets for composing and
laying out Vty user interfaces. This library provides a collection of
widgets and a type class for rendering widgets to Vty Images.
Get it from Hackage:
http://hackage.haskell.org/package/vty-ui
Or get the source
1 - 100 of 102 matches
Mail list logo
