<html>
<body>
That's great, thanks.<br>
Matt<br><br>
At 11:53 26/11/2015, you wrote:<br><br>
<blockquote type=cite class=cite cite="">On Thu, Nov 26, 2015 at 6:20 PM,
MJ Williams
<<a href="mailto:matthewjwilliams101@gmail.com">
matthewjwilliams101@gmail.com</a>> wrote:<br><br>
<br>
<dl>
<dd>therefore f ( g a ) = g ( f a ) . (transitivity)<br><br>
</dl><br>
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:<br><br>
<a href="https://www.coursera.org/course/intrologic">
https://www.coursera.org/course/intrologic</a><br><br>
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.<br><br>
It's unfortunate that it's some kind of well-kept secret.<br><br>
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.<br><br>
Did I mention the exercises are web-based? Yes, you get instantaneous
feedback on whether you've got a correct proof or not.<br><br>
-- Kim-Ee<br>
_______________________________________________<br>
Beginners mailing list<br>
Beginners@haskell.org<br>
<a href="http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners" eudora="autourl">
http://mail.haskell.org/cgi-bin/mailman/listinfo/beginners</a>
</blockquote></body>
</html>