Send Beginners mailing list submissions to
[email protected]
To subscribe or unsubscribe via the World Wide Web, visit
http://www.haskell.org/mailman/listinfo/beginners
or, via email, send a message with subject or body 'help' to
[email protected]
You can reach the person managing the list at
[email protected]
When replying, please edit your Subject line so it is more specific
than "Re: Contents of Beginners digest..."
Today's Topics:
1. Re: Cabal Dependency Hell (Brandon Allbery)
2. Re: Categories in Haskell (Friedrich Wiemer)
3. Re: Categories in Haskell (mukesh tiwari)
----------------------------------------------------------------------
Message: 1
Date: Wed, 29 May 2013 22:15:14 -0400
From: Brandon Allbery <[email protected]>
Subject: Re: [Haskell-beginners] Cabal Dependency Hell
To: Peter Hall <[email protected]>, The Haskell-Beginners
Mailing List - Discussion of primarily beginner-level topics related
to Haskell <[email protected]>
Message-ID:
<CAKFCL4WeUFRMEFGhXH+=z6ooyg2rfan3m5karzhb72nznb0...@mail.gmail.com>
Content-Type: text/plain; charset="utf-8"
On Wed, May 29, 2013 at 7:32 PM, Peter Hall <[email protected]>wrote:
> > The GHC devs know a better solution is needed; unfortunately, the best
> they've come up with is a proposal to build everything against
> > everything else in every possible combination....
>
> Surely that isn't necessary; it could be done lazily. That is, compile
> every combination that is actually demanded by their respective cabal
> files. No?
>
That is probably how it would be done, but it still means potentially a
combinatorial explosion of libraries, plus a lot of extra building
sometimes that you might not expect because "isn't that already built?!".
--
brandon s allbery kf8nh sine nomine associates
[email protected] [email protected]
unix, openafs, kerberos, infrastructure, xmonad http://sinenomine.net
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://www.haskell.org/pipermail/beginners/attachments/20130529/2450da30/attachment-0001.htm>
------------------------------
Message: 2
Date: Thu, 30 May 2013 08:50:51 +0200
From: Friedrich Wiemer <[email protected]>
Subject: Re: [Haskell-beginners] Categories in Haskell
To: [email protected], The Haskell-Beginners Mailing List -
Discussion of primarily beginner-level topics related to Haskell
<[email protected]>
Message-ID:
<cagvtqw7+64ohr-tc0p5owffuzse0mnwhcm16bq37s3kpvuf...@mail.gmail.com>
Content-Type: text/plain; charset=ISO-8859-1
I've heard a talk about Idris last weekend at BerlinSides. Looks very
interesting - I think I'll have to take a closer look at it. The guy
said it isn't stable enough for productive use but as Robert asked for
some learning experiences, this should be interessting for him, too.
( Btw: there should be four (?) video lectures about Idris somewhere
at http://idris-lang.org/ )
Friedrich
2013/5/30 Peter Hall <[email protected]>:
> I haven't tried Idris yet myself, and I'm not sure how stable it is, but I
> think it can do a lot that Agda can do but more suitable for actual
> calculations. I would be interested to hear any experiences you have (or
> have had) with it.
>
> Peter
>
>
> On 29 May 2013 23:11, Robert Goss <[email protected]> wrote:
>>
>>
>>
>>
>> On 29 May 2013 22:04, Ertugrul S?ylemez <[email protected]> wrote:
>>>
>>>
>>>
>>> Perhaps what you need is not a programming language like Haskell, but a
>>> proof assistant like Agda, where you can express arbitrary categories.
>>> A limited form of this is possible in Haskell as well, but the lack of
>>> dependent types would force you through a lot of boilerplate and heavy
>>> value/type/kind lifting.
>>>
>>
>> I had had a look at Agda a while ago I will have to have another look. How
>> possible is it to do computations in Agda? For example is it possible to
>> compute the equalizer of 2 arrows (obv is a category in which equalizers
>> exit)?
>>
>> A part of this was a learning experience it seemed natural to express
>> certain bits of computer algebra in terms of categories and I wanted to see
>> how well these ideas could be expressed in haskell.
>>
>> _______________________________________________
>> Beginners mailing list
>> [email protected]
>> http://www.haskell.org/mailman/listinfo/beginners
>>
>
>
> _______________________________________________
> Beginners mailing list
> [email protected]
> http://www.haskell.org/mailman/listinfo/beginners
>
------------------------------
Message: 3
Date: Thu, 30 May 2013 12:55:34 +0530
From: mukesh tiwari <[email protected]>
Subject: Re: [Haskell-beginners] Categories in Haskell
To: The Haskell-Beginners Mailing List - Discussion of primarily
beginner-level topics related to Haskell <[email protected]>
Cc: [email protected]
Message-ID:
<cafhzve_tzng_fyispymttqjscivukjazaysnad6-hrc1cjj...@mail.gmail.com>
Content-Type: text/plain; charset="iso-8859-1"
Hi Friedrich,
video lectures and slides of Idris
http://edwinb.wordpress.com/2013/03/15/idris-course-at-itu-slides-and-video/
-Mukesh
On Thu, May 30, 2013 at 12:20 PM, Friedrich Wiemer <
[email protected]> wrote:
> I've heard a talk about Idris last weekend at BerlinSides. Looks very
> interesting - I think I'll have to take a closer look at it. The guy
> said it isn't stable enough for productive use but as Robert asked for
> some learning experiences, this should be interessting for him, too.
> ( Btw: there should be four (?) video lectures about Idris somewhere
> at http://idris-lang.org/ )
>
> Friedrich
>
> 2013/5/30 Peter Hall <[email protected]>:
> > I haven't tried Idris yet myself, and I'm not sure how stable it is, but
> I
> > think it can do a lot that Agda can do but more suitable for actual
> > calculations. I would be interested to hear any experiences you have (or
> > have had) with it.
> >
> > Peter
> >
> >
> > On 29 May 2013 23:11, Robert Goss <[email protected]> wrote:
> >>
> >>
> >>
> >>
> >> On 29 May 2013 22:04, Ertugrul S?ylemez <[email protected]> wrote:
> >>>
> >>>
> >>>
> >>> Perhaps what you need is not a programming language like Haskell, but a
> >>> proof assistant like Agda, where you can express arbitrary categories.
> >>> A limited form of this is possible in Haskell as well, but the lack of
> >>> dependent types would force you through a lot of boilerplate and heavy
> >>> value/type/kind lifting.
> >>>
> >>
> >> I had had a look at Agda a while ago I will have to have another look.
> How
> >> possible is it to do computations in Agda? For example is it possible to
> >> compute the equalizer of 2 arrows (obv is a category in which equalizers
> >> exit)?
> >>
> >> A part of this was a learning experience it seemed natural to express
> >> certain bits of computer algebra in terms of categories and I wanted to
> see
> >> how well these ideas could be expressed in haskell.
> >>
> >> _______________________________________________
> >> Beginners mailing list
> >> [email protected]
> >> http://www.haskell.org/mailman/listinfo/beginners
> >>
> >
> >
> > _______________________________________________
> > Beginners mailing list
> > [email protected]
> > http://www.haskell.org/mailman/listinfo/beginners
> >
>
> _______________________________________________
> Beginners mailing list
> [email protected]
> http://www.haskell.org/mailman/listinfo/beginners
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://www.haskell.org/pipermail/beginners/attachments/20130530/3de7a676/attachment-0001.htm>
------------------------------
_______________________________________________
Beginners mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/beginners
End of Beginners Digest, Vol 59, Issue 41
*****************************************
