# sgillespie/lambda-calculus

An introduction to the Lambda Calculus
sgillespie Update `subGlobals` logic
`Try to avoid creating captures`
Latest commit ff34b26 Jan 28, 2018
Type Name Latest commit message Commit time
Failed to load latest commit information. app Jan 27, 2018 doc Dec 1, 2016 scripts Dec 26, 2017 src/Language Jan 28, 2018 test Jan 28, 2018 .gitignore Jan 20, 2018 .travis.yml Oct 23, 2016 LICENSE Sep 21, 2016 README.md Apr 7, 2017 Setup.hs lambda-calculator.cabal Jan 20, 2018 package.yaml Jan 20, 2018 stack.yaml

# Lambda Calculus Lambda Calculus is a tiny functional language for expressing computation based on function abstraction and application.

This project is intended to be an educational resource for learning and implementing functional programming languages.

# Introduction to Lambda Calculus

Introductory material is provided. They can be found at

## Extended Examples

More examples can be found in the test-suite, located at

test/Language/Lambda/Examples

# Implementation

A simple implementation of the untyped lambda calculus is included. It is written in Haskell and is implemented to be as easy to follow, at the possible expense of performance.

## Building

In order to build, you will need

• GHC >= 8
• stack

Build:

``````stack build
``````

Then install:

``````stack install
``````

## Running

Once the program is installed, you simply run it:

``````lambda-calculator
``````

This will open a repl (read-eval-print loop) prompt

``````Lambda Calculator (0.5.0)
Type :h for help
``````

You can start typing lambda calculus expressions and the program will evaluate them and print the result. Here are a few examples:

``````Lambda Calculator (0.5.0)
Type :h for help
λ > \x. x
λx. x
λ > (\x. x) n
n
λ > (\n f x. f (n f x)) (\f x. f (f x))
λf x. f (f (f x))
λ > :q
``````

You can exit by typing the command :q.

## Running Tests

In order to run the testsuite, run

``````stack test
``````

# Author

Sean Gillespie sean@mistersg.net