Description

Lambada is a functional programming language heavily inspired by lambda calculus.

• The language aims to be simple, or at least as simple as lambda calculus can be.
• The syntax is very similar to Haskell, meaning that existing syntax highlighting should work.
• Documentation can be found here

Building and executing

With Stack

$ stack build
$ stack exec lambada-exe

Or if you don't want to use Stack, you can build the executable with GHC alone

$ make lambada
$ ./lambada

What does it look like?

Values, lambda expressions, and application.

let double = \x . * 2 x in
let five = 5 in
double five

5

Basic boolean logic implementation.

let true = \x . \y . x in
let false = \x . \y . y in
let not = \p . \x . \y . p y x
let if = \p . \x . p x in
if not true 1 0

0

Features

The following are already completed.

• Values
• Lambda abstractions
• Application of lambda abstractions on values
• Let-expressions
• Evaluation of expressions

While these are ideas for the future

• Data types like lists, tuples and records
• Type checking
• Printing values

Todo

• Fix error messages when using operators
• Add more tests
• No exceptions (evalTest "let negate = \x . -x in negate x")