On 7 September 2010 16:09, Mathew de Detrich wrote:
> That definitely makes more sense
Well, the report (section 5.7) says you're allowed to request extra
info for mutually recursive modules...
--
Ivan Lazar Miljenovic
ivan.miljeno...@gmail.com
IvanMiljenovic.wordpress.com
_
That definitely makes more sense
On 07/09/2010 3:06 PM, "Daniel Peebles" wrote:
I was under the impression that the main reason GHC requires .hs-boot files
is that nobody has had the time or inclination to make it resolve circular
dependencies automatically, and not an intentional design decisio
Sorry to be late coming into this conversation.
Something that has bothered me (which I have mentioned to John Lato
privately) is that it is very easy to write non-compositional code due
to the chunking. For example, there is a standard function
map :: (a -> b) -> Enumeratee a b c
whose mea
I was under the impression that the main reason GHC requires .hs-boot files
is that nobody has had the time or inclination to make it resolve circular
dependencies automatically, and not an intentional design decision to
encourage "good design".
On Tue, Sep 7, 2010 at 6:51 AM, Mathew de Detrich w
I had the same issue zonks ago, and I resorted to using the hs-boot file
method as well (which worked fine)
Which I guess brings me to my second point, is this something that GHC
should do automatically when it sees circular dependencies? When I asked
about it earlier on #haskell, I was told that
On 7 September 2010 14:24, wren ng thornton wrote:
> On 9/7/10 12:04 AM, Ivan Lazar Miljenovic wrote:
>>>
>>> Perhaps this just means that union/insert should be part of some other
>>> class.
>>
>> That is part of the plan (I'm tentatively calling the class with the
>> "insert" method "Buildable"
On 9/7/10 12:04 AM, Ivan Lazar Miljenovic wrote:
Perhaps this just means that union/insert should be part of some other
class.
That is part of the plan (I'm tentatively calling the class with the
"insert" method "Buildable" or "Extendable"); this means that if a
type is an instance of Monoid (f
On 7 September 2010 13:23, wren ng thornton wrote:
> On 9/6/10 11:50 AM, Gábor Lehel wrote:
>>
>> On Mon, Sep 6, 2010 at 5:11 PM, John Lato wrote:
>>>
>>> But please don't make Pointed depend on Functor - we've already
>>> seen that it won't work for Bloom filters.
>>
>> I think most people have
On 7 September 2010 12:18, wren ng thornton wrote:
> On 9/6/10 2:35 AM, Ivan Lazar Miljenovic wrote:
>>
>> Well, if we consider what this does, pure is equivalent to singleton
>> for container types. The actual definition of pure (or any other
>> aspect of Pointed) doesn't require Functor; howeve
2010/9/7 Gábor Lehel :
> *That said*, I actually have nothing at all against splitting the 'a
> -> f a' method out into a separate class if you think it's useful,
> whether you call it Pointed or something else. (And `class (Pointed f,
> Functor f) => PointedFunctor f` is sort of cute.)
It might b
On 9/6/10 11:46 PM, Ivan Lazar Miljenovic wrote:
Well, my current work is to implement restricted versions of the
various type classes (I'm undecided if they should be split off into a
separate package or not) and then have the Data.Containers module
basically define type aliases (which will prob
On 7 September 2010 03:44, Edward Z. Yang wrote:
> Excerpts from Evan Laforge's message of Mon Sep 06 13:30:43 -0400 2010:
>> I feel like the circular imports problem is worse in haskell than
>> other languages. Maybe because there is a tendency to centralize all
>> state, since you need to defin
On 9/6/10 12:53 PM, John Lato wrote:
I'd like to make one more argument in favor of my preference for more
splitting of type classes.
FWIW, I agree that more splitting is generally good. This is one of the
problems I have with the various proposals for a ListLike class. They
conflate the cons
On 7 September 2010 02:53, John Lato wrote:
> I'd like to make one more argument in favor of my preference for more
> splitting of type classes. IMO it's beneficial to split up classes to
> minimize unnecessary dependencies. That is, while e.g. Monoid is very
> useful for containers, many contai
On 9/6/10 11:50 AM, Gábor Lehel wrote:
On Mon, Sep 6, 2010 at 5:11 PM, John Lato wrote:
But please don't make Pointed depend on Functor - we've already
seen that it won't work for Bloom filters.
I think most people have been using "Pointed" merely as shorthand for
"Pointed Functor" -- in the
On Mon, Sep 6, 2010 at 10:22 PM, wren ng thornton wrote:
> On 9/6/10 1:33 PM, David Menendez wrote:
>>
>> For that matter, can you even describe what pure is intended to do
>> without reference to<*> or join?
>
> As already stated: fmap f . pure = pure . f
That's pretty general. For lists, the f
On 9/6/10 1:33 PM, David Menendez wrote:
For that matter, can you even describe what pure is intended to do
without reference to<*> or join?
As already stated: fmap f . pure = pure . f
--
Live well,
~wren
___
Haskell-Cafe mailing list
Haskell-Cafe@h
On 9/6/10 2:35 AM, Ivan Lazar Miljenovic wrote:
Well, if we consider what this does, pure is equivalent to singleton
for container types. The actual definition of pure (or any other
aspect of Pointed) doesn't require Functor; however there are
properties for types that are instances of Functor a
*Mistake, in where I said "majority of Haskell programs were pure" I meant
"majority of code in Haskell programs was pure"
On Tue, Sep 7, 2010 at 11:07 AM, Mathew de Detrich wrote:
> Before Haskell took off with parallelism, it was assumed that Haskell would
> be trivial to run concurrently on co
Before Haskell took off with parallelism, it was assumed that Haskell would
be trivial to run concurrently on cores because majority of Haskell programs
were pure, so you could simply run different functions on different cores
and string the results together when your done
It turned out that using
On Mon, Sep 6, 2010 at 2:45 PM, Olle Fredriksson
wrote:
> expr :: Grammar Char E
> expr = do
> rec
> e <- rule [ Plus <@> e <# '+' <#> t
> , id <@> t
> ]
> t <- rule [ Times <@> t <# '*' <#> f
> , id <@> f
>
Hi,
actually this idea generalizes quite nicely. Details and examples are
available in Section 3 of "Language and Program Design for Functional
Dependencies", available at
http://web.cecs.pdx.edu/~mpj/pubs/fundeps-design.html
-Iavor
On Mon, Sep 6, 2010 at 3:58 PM, Wolfgang Jeltsch
wrote:
> Am M
Am Montag, den 06.09.2010, 19:38 +0400 schrieb Bulat Ziganshin:
> btw, i also had proposal to automatically convert typeclasses used in
> type declarations into constraints, so that:
>
> putStr :: StringLike -> IO ()
>
> treated as
>
> putStr :: StringLike s => s -> IO ()
This blurs the distincti
waldmann:
> > > functional/declarative code "automatically" parallelizes,
>
> > Well, that's not really a good thing to say.
>
> Sure, sure, and I expand on the details in my lectures.
>
> But in advertising (the elevator sales pitch), we simplify.
> Cf. "well-typed programs don't go wrong".
>
> > functional/declarative code "automatically" parallelizes,
> Well, that's not really a good thing to say.
Sure, sure, and I expand on the details in my lectures.
But in advertising (the elevator sales pitch), we simplify.
Cf. "well-typed programs don't go wrong".
- Johannes.
__
waldmann:
> Don Stewart galois.com> writes:
>
> > Note that DPH is a programming model, but the implementation currently
> > targets shared memory multicores (and to some extent GPUs), not
> > distributed systems.
>
> Yes. I understand that's only part of what the original poster wanted,
> but I
Don Stewart galois.com> writes:
> Note that DPH is a programming model, but the implementation currently
> targets shared memory multicores (and to some extent GPUs), not
> distributed systems.
Yes. I understand that's only part of what the original poster wanted,
but I'd sure want to use ghc-ge
waldmann:
> http://book.realworldhaskell.org/read/concurrent-and-multicore-programming.html
>
> http://www.haskell.org/haskellwiki/GHC/Data_Parallel_Haskell
> Although the last two edits on that page are from 2010 and 2009.
> So what *is* the current status of DPH?
>
Note that DPH is a programmi
http://book.realworldhaskell.org/read/concurrent-and-multicore-programming.html
http://www.haskell.org/haskellwiki/GHC/Data_Parallel_Haskell
Although the last two edits on that page are from 2010 and 2009.
So what *is* the current status of DPH?
J.W.
_
Hi Brent,
ditto what Jeremy said. hledger is an end-user app with lots of needs including code & design review, performance and
laziness analysis, quickcheck/smallcheck testing, development process refinement, web design, and features/fixes of all
sizes. I'd be happy to mentor volunteers.
-Si
ivansichfreitas:
> Hi fellow haskellers,
>
> I'm interested in the performance of parallel and/or distributed
> implementations in haskell language. For example, supose I want to
> develop an application that distributes a computation between many
> multicore computers, what are the advantages I c
Hi fellow haskellers,
I'm interested in the performance of parallel and/or distributed
implementations in haskell language. For example, supose I want to
develop an application that distributes a computation between many
multicore computers, what are the advantages I can take from haskell
in that?
On Mon, Sep 6, 2010 at 2:08 PM, Thomas DuBuisson wrote:
> >> You could have gone to Hackage and checked your protocols correctness
> >> using CPSA, not that the side-channel attacks would be discovered by
> >> such a tool.
> >
> > Interesting. I had seen CPSA announced at one point, but there app
Hello,
The Happstack web application framework would be glad to sponsor any
students interested in contributing. We almost always have a
collection of small, interesting tasks to tackle which do not require
a deep understanding of Happstack or Haskell. When you are closer to
actually giv
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On 9/6/10 04:08 , Ivan Lazar Miljenovic wrote:
> On 6 September 2010 18:00, Johann Bach wrote:
>> Regarding runhaskell: the last time I tried it, it compiled the
>> program, but I want to use the interpreter. I have a script-like
>> application in whi
I'm pleased to announce hledger 0.12.1, with a new web interface and
bugfixes. Thanks to Ben Boeckel and David Patrick for their help this
time around. Installation docs, linux/mac/windows binaries and more
are at http://hledger.org and http://hackage.haskell.org/package/
hledger .
Release
>> You could have gone to Hackage and checked your protocols correctness
>> using CPSA, not that the side-channel attacks would be discovered by
>> such a tool.
>
> Interesting. I had seen CPSA announced at one point, but there appears to be
> no documentation whatsoever. Did I miss the doc links?
creswick:
> On Mon, Sep 6, 2010 at 5:29 AM, Ivan Lazar Miljenovic
> wrote:
> > On 6 September 2010 21:57, han wrote:
> >> So the question is: Do you agree that "Graphics.Rendering.OpenGL" actually
> >> should have been "Graphics.OpenGL" (or just OpenGL) for wieldiness?
> >
> > I think Graphics.Op
On Mon, Sep 6, 2010 at 12:45 PM, Thomas DuBuisson <
thomas.dubuis...@gmail.com> wrote:
> David said:
> > I'd be interested with breaking the dependency on OpenSSL, for various
> > reasons:
> > [snip]
>
> Can't say I'm surprised by these. Its unfortunate the situation
> hasn't improved. I recall
On Mon, Sep 6, 2010 at 5:29 AM, Ivan Lazar Miljenovic
wrote:
> On 6 September 2010 21:57, han wrote:
>> So the question is: Do you agree that "Graphics.Rendering.OpenGL" actually
>> should have been "Graphics.OpenGL" (or just OpenGL) for wieldiness?
>
> I think Graphics.OpenGL would have sufficed
On 6 September 2010 20:18, John Lato wrote:
> Can you give an example of a Functor that doesn't have pure? I think it's
> Pointed Functors which are useful; not Functor by itself.
Strictly speaking is Pair one? The current implementation tacks on monoid.
Best wishes
Stephen
__
David said:
> I'd be interested with breaking the dependency on OpenSSL, for various
> reasons:
> [snip]
Can't say I'm surprised by these. Its unfortunate the situation
hasn't improved. I recall a half decent O'Reilly book on OpenSSL but
if you weren't using it as a cookbook (and wanted a 1-off
2010/9/6 Bulat Ziganshin :
> Hello Serguey,
>
> Monday, September 6, 2010, 8:16:03 PM, you wrote:
>> Basically, you - and others, - propose to add another class isomorphic
>> to already present lists. I think, most benefits of that class can be
>> achieved by using list conversion and RULE pragma.
On Mon, Sep 6, 2010 at 9:16 AM, Thomas DuBuisson wrote:
> Good work Dan! Would you be interested in providing a build option
> that replaces the OpenSSL dependency with something more stand-alone?
>
I'd be interested with breaking the dependency on OpenSSL, for various
reasons:
- OpenSSL's API
On Mon, Sep 6, 2010 at 12:33 PM, David Menendez wrote:
> On Mon, Sep 6, 2010 at 7:51 AM, John Lato wrote:
> > On Sun, Sep 5, 2010 at 7:18 PM, David Menendez
> wrote:
> >>
> >> On Sun, Sep 5, 2010 at 8:40 AM, John Lato wrote:
> >> >
> >> >
> >> > On Sat, Sep 4, 2010 at 12:34 PM, David Menendez
On Mon, Sep 6, 2010 at 8:52 PM, Maciej Piechotka wrote:
> PS.
>
> data FooBar a = Foo
> | Bar
> deriving Show
>
> class IsString (FooBar Char) where
> toString _ = Foo
>
> class IsList FooBar where
> toList _ = Bar
>
> show ("1234" :: FooBar Char) == ???
Foo
--
W
Hi all,
I'm working on update gtk2hs APIs.
'gio' has update to newest version, all patches has push to repo, i need
more test before release gio-0.12.0
About `gtk` packages, i have push some gtk+-2.18/gtk+-2.20 patches to
repo but not all, i plan finish all APIs before release gtk-0.12.0.
If an
On Mon, Sep 6, 2010 at 2:21 PM, Daniel Díaz wrote:
>
> El Lun, 6 de Septiembre de 2010, 7:50 pm, David Menendez escribió:
>> Operators default to infixl 9 unless specified otherwise,
>> so no infix declaration is needed.
>
> Why there is a default infix? Why it is 9?
That's what the Haskell Repor
On Mon, 2010-09-06 at 10:23 +, Johannes Waldmann wrote:
> We have overloaded numerical literals (Num.fromInteger)
> and we can overload string literals (IsString.fromString),
> so how about using list syntax ( [], : )
> for anything list-like (e.g., Data.Sequence)?
>
> Of course some "minor de
On Mon, 2010-09-06 at 03:54 -0700, Ashley Yakeley wrote:
> countable: Countable, Searchable, Finite, Empty classes.
>
>class Countable, for countable types
>class AtLeastOneCountable, for countable types that have at least one
> value
>class InfiniteCountable, for infinite countable
El Lun, 6 de Septiembre de 2010, 7:50 pm, David Menendez escribió:
> Operators default to infixl 9 unless specified otherwise,
> so no infix declaration is needed.
Why there is a default infix? Why it is 9?
--
Daniel Díaz
___
Haskell-Cafe mailing lis
Hi David,
You're right, I keep forgetting to look at the source code.
And I wasn't aware of the info (:i) command. Should come in handy in the future.
Michael
--- On Mon, 9/6/10, David Menendez wrote:
From: David Menendez
Subject: Re: [Haskell-cafe] Operator precedence
To: "michael rice"
Cc
On Mon, Sep 6, 2010 at 1:37 PM, michael rice wrote:
>
> A "concrete" library?
>
> I'm playing around with Data.Bits. It has .&. and .|. which I assume are
> functions
> (rather than operators) because I don't see and infix statement for them.
> Correct?
.|. and .&. are operators because they ar
Hello michael,
Monday, September 6, 2010, 9:00:32 PM, you wrote:
> Is there a handy list of operators and their precedence somewhere?
unlike most languages, operators are user-definable in haskell. so
there is no comprehensive list
any function with two arguments van be used as operator:
a `mi
Hello everyone,
I'm pleased to announce the first release of Grempa:
A library for expressing programming language grammars in a form similar
to BNF, which is extended with the semantic actions to take when
a production has been parsed. The grammars are typed and are to be be
used
Excerpts from Evan Laforge's message of Mon Sep 06 13:30:43 -0400 2010:
> I feel like the circular imports problem is worse in haskell than
> other languages. Maybe because there is a tendency to centralize all
> state, since you need to define it along with your state monad. But
> the state mona
On Mon, 6 Sep 2010, Evan Laforge wrote:
I have a few techniques to get out:
- Replace Things with ThingIds which have no big dependencies, and can
then be looked up in a Map later. This replaces direct access with
lookup and thows some extra Maybes in there, which is not very nice.
- Cleverl
A "concrete" library?
I'm playing around with Data.Bits. It has .&. and .|. which I assume are
functions (rather than operators) because I don't see and infix statement for
them. Correct?
Michael
--- On Mon, 9/6/10, Daniel Díaz wrote:
From: Daniel Díaz
Subject: Re: [Haskell-cafe] Operator p
On Mon, Sep 6, 2010 at 7:51 AM, John Lato wrote:
> On Sun, Sep 5, 2010 at 7:18 PM, David Menendez wrote:
>>
>> On Sun, Sep 5, 2010 at 8:40 AM, John Lato wrote:
>> >
>> >
>> > On Sat, Sep 4, 2010 at 12:34 PM, David Menendez
>> > wrote:
>> >>
>> >> On Fri, Sep 3, 2010 at 8:23 AM, John Lato wrote
Lately I've been spending more and more time trying to figure out how
to resolve circular import problems. I add some new data type and
suddenly someone has a new dependency and now the modules are
circular. The usual solution is to move the mutually dependent
definitions into the same module, bu
Those are all operators in Prelude. See a concrete library for their
operator precedences.
--
Daniel Díaz
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Thanks, Daniel.
This be all of them?
Michael
infixr 9 .
infixr 8 ^, ^^, ⋆⋆
infixl 7 ⋆, /, ‘quot‘, ‘rem‘, ‘div‘, ‘mod‘
infixl 6 +, -
Take a look to the Haskell Report:
http://www.haskell.org/onlinereport/haskell2010/haskellch9.html#x16-1710009
--
Daniel Díaz
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Bulat,
> btw, i also had proposal to automatically convert typeclasses used in
> type declarations into constraints, [...]
> Together with proposals i mentioned previously, it will allow to treat
> existing code dealing with lists/strings as generic code working
> with any sequential container ty
Is there a handy list of operators and their precedence somewhere?
Michael
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'd like to make one more argument in favor of my preference for more
splitting of type classes. IMO it's beneficial to split up classes to
minimize unnecessary dependencies. That is, while e.g. Monoid is very
useful for containers, many container methods won't need it, e.g. "elem" or
"filter".
On Sep 2, 2010, at 11:24 AM, Yuras Shumovich wrote:
> Is it possible to switch back from frame version to non frame version?
> The "Frames" button disappears in frame mode...
I usually just right-click on the main page and select "Open frame in new
window...". I could have made the "Frames" but
On Mon, Sep 6, 2010 at 9:16 AM, Thomas DuBuisson
wrote:
> Good work Dan!
Sorry! David. Good work David. Not sure where "Dan" came from.
Would you be interested in providing a build option
> that replaces the OpenSSL dependency with something more stand-alone?
> Or does ossl perform a signifi
On Mon, Sep 6, 2010 at 12:47 PM, Neil Brown wrote:
> On 06/09/10 11:23, Johannes Waldmann wrote:
>>
>> We have overloaded numerical literals (Num.fromInteger)
>> and we can overload string literals (IsString.fromString),
>> so how about using list syntax ( [], : )
>> for anything list-like (e.g.,
Hello Serguey,
Monday, September 6, 2010, 8:16:03 PM, you wrote:
> Basically, you - and others, - propose to add another class isomorphic
> to already present lists. I think, most benefits of that class can be
> achieved by using list conversion and RULE pragma.
what i propose should allow to con
Good work Dan! Would you be interested in providing a build option
that replaces the OpenSSL dependency with something more stand-alone?
Or does ossl perform a significant part of the TLS protocol work for
you (vs just being used for algorithms)?
Anyone impatient for the midnight haddocking can s
2010/9/6 Bulat Ziganshin :
> Hello Serguey,
> Monday, September 6, 2010, 7:57:46 PM, you wrote:
>>> http://www.mail-archive.com/haskell-cafe@haskell.org/msg15656.html
>> Will Data.Map with its' empty, insert, findMin, etc, "methods" conform
>> to your proposed type?
> but Data.Map isn't sequential
On 6 September 2010 17:11, Mark Lentczner wrote:
> On Sep 6, 2010, at 2:40 AM, Henning Thielemann wrote:
>> ... focusing on a small set of assumed popular browsers ...
>
> I didn't want to assume either. I ran a survey of the Haskell community and
> got over a 150 responses.
> On Sep 6, 2010, at
Hello Serguey,
Monday, September 6, 2010, 7:57:46 PM, you wrote:
>> http://www.mail-archive.com/haskell-cafe@haskell.org/msg15656.html
> Will Data.Map with its' empty, insert, findMin, etc, "methods" conform
> to your proposed type?
but Data.Map isn't sequential container. instead, it maps arbi
2010/9/6 Bulat Ziganshin :
> Hello Johannes,
>
> Monday, September 6, 2010, 2:23:35 PM, you wrote:
>
>> so how about using list syntax ( [], : )
>> for anything list-like (e.g., Data.Sequence)?
>
> i'vwe found my own proposal of such type:
> http://www.mail-archive.com/haskell-cafe@haskell.org/msg1
On Mon, Sep 6, 2010 at 5:11 PM, John Lato wrote:
>>
>> Message: 20
>> Date: Sat, 04 Sep 2010 03:40:49 -0400
>> From: wren ng thornton
>> Subject: Re: [Haskell-cafe] Restricted type classes
>> To: Haskell Cafe
>> Message-ID: <4c81f801@freegeek.org>
>> Content-Type: text/plain; charset=UTF-8;
Hello Johannes,
Monday, September 6, 2010, 2:23:35 PM, you wrote:
> so how about using list syntax ( [], : )
> for anything list-like (e.g., Data.Sequence)?
i'vwe found my own proposal of such type:
http://www.mail-archive.com/haskell-cafe@haskell.org/msg15656.html
--
Best regards,
Bulat
Hello Stefan,
Monday, September 6, 2010, 3:47:11 PM, you wrote:
> In general, it is kind of unfortunate that type classes and type
> constructors share a namespace, even though there is no way to ever mix them
> up.
btw, i also had proposal to automatically convert typeclasses used in
type decl
>
>
> Message: 20
> Date: Sat, 04 Sep 2010 03:40:49 -0400
> From: wren ng thornton
> Subject: Re: [Haskell-cafe] Restricted type classes
> To: Haskell Cafe
> Message-ID: <4c81f801@freegeek.org>
> Content-Type: text/plain; charset=UTF-8; format=flowed
>
> On 9/3/10 12:16 AM, Ivan Lazar Miljeno
On Sep 6, 2010, at 2:40 AM, Henning Thielemann wrote:
> ... focusing on a small set of assumed popular browsers ...
I didn't want to assume either. I ran a survey of the Haskell community and got
over a 150 responses. The multiple choice browser question yielded:
Firefox: 59%
Chr
Simon Peyton-Jones wrote:
| As membership of "the Haskell community" is not well-defined, and voting
| would potentially be open to abuse if anyone were able to vote, we
| propose that the committee should choose their replacements from open
| nominations.
I agree with the problem, and I think y
On Monday 06 September 2010 10:47:54, Henning Thielemann wrote:
> Daniel Fischer schrieb:
> > On Sunday 05 September 2010 21:52:44, Henning Thielemann wrote:
> >> Daniel Fischer schrieb:
> >>> Yes. Ordinarily, lines in text files aren't longer than a few
> >>> hundred characters, leaking those, who
AngloHaskell 2010 is this week!
AngloHaskell 2010 - 5th Annual Haskell Meeting in England
Friday September 10th and Saturday September 11th, 2010
Microsoft Research, Cambridge, UK
http://www.haskell.org/haskellwiki/AngloHaskell/2010
AngloHaskell is a free gathering of all people Haskell-related
On Sep 6, 2010, at 1:47 PM, Stefan Holdermans wrote:
In general, it is kind of unfortunate that type classes and type
constructors share a namespace, even though there is no way to ever
mix them up.
Class and type names mix in im- and export lists. IIRC, this is the
reason for putting th
On 6 September 2010 21:57, han wrote:
> So the question is: Do you agree that "Graphics.Rendering.OpenGL" actually
> should have been "Graphics.OpenGL" (or just OpenGL) for wieldiness?
I think Graphics.OpenGL would have sufficed, unless there was
sufficient reason to want to group it with other r
Hi All,
Not a complete guide, but just something, which can help:
Perl6 is inspired by haskell. That was, how I end up by haskell. And I
believe a lot of people of the perl community got interested in haskell that
way. Maybe this works for some of collegues too. I still like perl, but
haskell is
On Sep 6, 2010, at 1:57 PM, han wrote:
So the question is: Do you agree that "Graphics.Rendering.OpenGL"
actually should have been "Graphics.OpenGL" (or just OpenGL) for
wieldiness? If you don't, what is your reason? I would like to know.
Often, when this topic comes up, someone claims tha
Before we proceed, let's make some points clear.
For example, OpenGL is currently imported via "Graphics.Rendering.OpenGL".
With the reasoning that "Graphics.SomeModule" (instead of
"Graphics.Drawing.SomeModule") has no problem ("since we don't really look
for packages based upon the module hierar
On Mon, 6 Sep 2010, Stefan Holdermans wrote:
Wolfgang,
We should definitely get rid of these Is* class identifiers like
IsString and IsList. We also don’t have IsNum, IsMonad, etc.
I see your point. For strings, however, there was of course never the
possibility to dub the class String as
On Sun, Sep 5, 2010 at 7:18 PM, David Menendez wrote:
> On Sun, Sep 5, 2010 at 8:40 AM, John Lato wrote:
> >
> >
> > On Sat, Sep 4, 2010 at 12:34 PM, David Menendez
> wrote:
> >>
> >> On Fri, Sep 3, 2010 at 8:23 AM, John Lato wrote:
> >>
> >> > +1 for using the proper constraints, and especial
Wolfgang,
> We should definitely get rid of these Is* class identifiers like
> IsString and IsList. We also don’t have IsNum, IsMonad, etc.
I see your point. For strings, however, there was of course never the
possibility to dub the class String as that name is already taken by the type
synonym
On Mon, 06 Sep 2010 03:46:18 -0700, Ashley Yakeley wrote:
> countable: Countable, Searchable, Finite, Empty classes.
>
>class Countable, for countable types
>class AtLeastOneCountable, for countable types that have at least one
> value
>class InfiniteCountable, for infinite countable
Am Montag, den 06.09.2010, 11:47 +0100 schrieb Neil Brown:
> I would have thought you have two obvious choices for the type-class
> (things like folding are irrelevant to overloading list literals):
>
> class IsList f where
>fromList :: [a] -> f a
>
> or:
>
> class IsList f where
>cons
On Sep 6, 2010, at 12:23 PM, Johannes Waldmann wrote:
We have overloaded numerical literals (Num.fromInteger)
and we can overload string literals (IsString.fromString),
so how about using list syntax ( [], : )
for anything list-like (e.g., Data.Sequence)?
As lists of some type A represent the
Hello Johannes,
Monday, September 6, 2010, 2:23:35 PM, you wrote:
i had such idea several years ago and proposed to name class ListLike.
this class was finally implemented by John Goerzen and it does
everything we can w/o changing language
the main thing about literals is that they need to be re
I Think you misinterpreted what I said. I didn't say you should tell the
programmers how to code, I said you should show the perl coders how Haskell
has advantages over pearls without much cost
On 06/09/2010 5:21 PM, "Stephen Tetley" wrote:
On 6 September 2010 03:46, Mathew de Detrich wrote:
>
On 06/09/10 11:23, Johannes Waldmann wrote:
We have overloaded numerical literals (Num.fromInteger)
and we can overload string literals (IsString.fromString),
so how about using list syntax ( [], : )
for anything list-like (e.g., Data.Sequence)?
I would have thought you have two obvious choic
On Mon, 6 Sep 2010, Johannes Waldmann wrote:
We have overloaded numerical literals (Num.fromInteger)
and we can overload string literals (IsString.fromString),
so how about using list syntax ( [], : )
for anything list-like (e.g., Data.Sequence)?
My favorite solution would be to throw away sp
I think left-biased (= singly linked) lists
are much overrated in Haskell coding (and teaching).
The language (syntax and Prelude) makes it just too easy to use them,
and old habits (from LISP) die hard.
Sure, lists serve a purpose:
* they model (infinite, lazy) streams, used
in the producer/t
Mark Lentczner schrieb:
> The choice to generate Haddock output as XHTML 1.0 Transitional and Frames,
> stored into files with an extension of .html, and that would likely be served
> as text/html, was mine and I did so with review of current best practices.
> The output Haddock now generates r
1 - 100 of 110 matches
Mail list logo
