mikrokosmos

Mikrokosmos is an untyped lambda calculus interpreter, borrowing its name from the series of progressive piano études Mikrokosmos written by Bela Bartok. It aims to provide students with a tool to learn and understand lambda calculus. If you want to start learning about lambda calculus, I suggest you to read:

• The wikipedia page on Lambda calculus
• A tutorial introduction to the Lambda calculus by Raúl Rojas

And to install and to tinker with this interpreter.

Installation

Mikrokosmos will be soon installable from Hackage. Meanwhile, you can install it cloning the repository and using cabal:

git clone https://github.com/M42/mikrokosmos.git
cd mikrokosmos
cabal install

First steps

Once installed, you can open the interpreter typing mikrokosmos in your terminal. It will show you a prompt where you can write lambda expressions to evaluate them:

You can write expressions using \var. to denote a lambda abstraction on the var variable and you can bind names to expressions using =. But why am I getting this weird output? Well, the interpreter outputs the lambda expressions in De Bruijn notation; it is more compact and the interpreter works internally with it. However, as you can see in the image, whenever the interpreter finds a known constant, it labels the expression with its name.

If you need help at any moment, you can type :help into the prompt to get a summary of the available options:

The standard library

Mikrokosmos comes bundled with a standard library. It allows you to experiment with Church encoding of booleans, integers and much more. You can load it with :load std.mkr; after that, you can use a lot of new constants:

All this is written in lambda calculus! You can check the definitions on the std.mkr file.

Debugging and verbose mode

If you want to check how the lambda reductions are being performed you can use the verbose mode. It can be activated and deactivated writing :verbose, and it will show you every step on the reduction of the expression, coloring the substitution at every step.

Advanced data structures

There are representations of structures such as linked lists or trees in the standard library. You can use them to do a bit of your usual functional programming:

Oh! And you can insert comments with #, both in the interpreter and in the files the interpreter can load.

References & interesting links

• Build you a Haskell - Stephen Diehl
• Haskell from Scratch - Jekor
• The Glambda interpreter
• Lecture notes on the lambda calculus - Peter Selinger