[Haskell-beginners] The Holy Trinity of Functional Programming

Christopher Howard christopher.howard at frigidcode.com
Wed Aug 22 13:19:49 CEST 2012

On 08/22/2012 01:27 AM, Costello, Roger L. wrote:
> ---------------------------------------------------------
> The Holy Trinity of Functional Programming
> ---------------------------------------------------------
> These three ideas constitute the holy trinity of functional programming:
> 1.  User-defined recursive data types.
> 2.  Recursively defined functions over recursive data types.
> 3.  Proof by induction: show that some property P(n) holds for each element of a recursive data type.


> Although the infinite Nat value is not of much use, the same is not true of the infinite values of other data types.

Please bear with us simpletons: But do you think you could provide a
more "real world" example of an application of the "Holy Trinity" ideas?
(One of those mysterious "other data types".)

Not to say that recursive data types and proof by induction aren't
fascinating in and of themselves... but sometimes it is difficult to
make the connection to the practical programming process.


-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 554 bytes
Desc: OpenPGP digital signature
URL: <http://www.haskell.org/pipermail/beginners/attachments/20120822/0783e7a6/attachment.pgp>

More information about the Beginners mailing list