An Introduction to Functional Programming Through Lambda Calculus by Greg Michaelson

Author:Greg Michaelson
Language: eng
Format: epub, azw3
Publisher: Dover Publications, Inc.
Published: 2013-06-26T16:00:00+00:00

the first name is:

and we use:

to access it, the second name is:

and we use:

to access it, the third name is:

and we use:

to access it and so on.

In general, to access the <number>+1th name, we take the TAIL <number> times and then take the HEAD:

Note that the first element is number 0, the second element is number 1 and so on, because we are basing our definition on how often the tail is taken, to make the element the head of the remaining list. If the list does not have <number> elements we will just return the empty list:

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.