[Haskell-beginners] The Holy Trinity of Functional Programming

Brandon Allbery allbery.b at gmail.com
Wed Aug 22 17:04:48 CEST 2012

On Wed, Aug 22, 2012 at 7:38 AM, Costello, Roger L. <costello at mitre.org>wrote:

> > But do you think you could provide a
> > more "real world" example of an application
> > of the "Holy Trinity" ideas?
> A commonly cited real-world example that illustrates the first key idea
> (recursive data type) is a binary tree:

I'd have used lists, since in Haskell we make use of infinite lists quite a
bit; a simple example being zipping some list against [0..] (a list
comprising an infinitely ascending sequence of numbers) to pair each item
with its index.

brandon s allbery                                      allbery.b at gmail.com
wandering unix systems administrator (available)     (412) 475-9364 vm/sms
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/beginners/attachments/20120822/f6109c04/attachment.htm>

More information about the Beginners mailing list