Exploring the connection between lambda calculus and programming
As we all know, Lisp is based on the Lambda Calculus. In this issue, we will open the lambda can of worms, especially as it relates to programming languages.
A brief introduction:
Lambda Calculus consists of three parts (with their Lisp equivalents):
- variables (symbols)
- lambda abstraction (defining a function)
- lambda application (applying a function)
Beta reduction is the step of replacing the arguments of a function with their value inside the body of the function.
I am only informally acquainted with lambda calculus, so this has been a learning experience for me.
Have fun! Eric Normand
PS I love to hear from readers. Just reply to this email to get in touch!
PPS Tell your friends about the Clojure Gazette.