[Haskell-beginners] Simple function comparison

[MJ Williams]

That's great, thanks.
Matt

At 11:53 26/11/2015, you wrote:

>On Thu, Nov 26, 2015 at 6:20 PM, MJ Williams 
><<mailto:matthewjwilliams101 at gmail.com>matthewjwilliams101 at gmail.com> wrote:
>
>
>therefore f ( g a ) = g ( f a ) . (transitivity)
>
>
>If you're interested in getting a firm grasp of airtight proofs -- 
>with a view toward Haskell (and Agda and Idris) mastery -- you might 
>want to pick and choose your way through the web-based proof exercises here:
>
><https://www.coursera.org/course/intrologic>https://www.coursera.org/course/intrologic
>
>This is a course firmly in the American analytic philosophy 
>tradition, so Logic here is Symbolic Logic. Bonus: the course keeps 
>AI and Machine Learning applications in the backdrop.
>
>It's unfortunate that it's some kind of well-kept secret.
>
>Those who don't need it -- because they've obtained the knowledge 
>elsewhere -- won't know about it. And those who do want that 
>knowledge also won't know about it.
>
>Did I mention the exercises are web-based? Yes, you get 
>instantaneous feedback on whether you've got a correct proof or not.
>
>-- Kim-Ee
>_______________________________________________
>Beginners mailing list
>Beginners at haskell.org
>http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/beginners/attachments/20151126/bfd7af43/attachment.html>