Lambda PHP

Lambda calculus interpreter in PHP.

Code Quality Rank: L5

Programming language: PHP

License: MIT License

Tags: Miscellaneous    

README

lambda-php

[reduce forever](doc/reduce-forever.png)

Lambda calculus interpreter in PHP.

Lambda calculus

Lambda calculus is a very minimal programming language that was invented in 1936 by Alonzo Church. It is the functional equivalent of the Turing Machine.

Lambda calculus has only three concepts: Function definitions, lexically scoped variables, function application.

An example term would be the identity function:

λx.x

The first part λx defines a function that takes an x, the . signifies that the part that follows is the function body. The body just returns x.

In PHP, you would write the same thing as follows:

function ($x) {
    return $x;
}

You can nest function definitions. Here is a function returning a function:

λx.λy.x

And you can also apply a function to an argument, which just means calling the function.

λf.λg.f g

Which is the short hand (left-associative) form of writing

λf.λg.(f g)

Nested calls like:

λf.λg.λh.f g h

Are interpreted as:

λf.λg.λh.((f g) h)

If you want to change the grouping to be right-associative, you need to explicitly group them in parentheses:

λf.λg.λh.(f (g h))

Interestingly, lambda calculus is turing complete. Using just these three concepts you can represent any computation.

Check out the links at the bottom for more details on how to do stuff in lambda calculus.

Interpreter

This project consists of a lambda calculus expression parser using dissect, and an eval-apply interpreter based on Matt Might's implementation in scheme.

The interpreter is call-by-value which means that recursive calls need to be wrapped in a function to prevent them from being evaluated eagerly.

For examples of how to do numbers (church encoding), booleans, arithmetic, boolean logic, looping (recursion), etc. look at example.php.

REPL

This project ships with a read-eval-print-loop that you can use to evaluate lambda calculus expressions:

$ php repl.php

By default, it is in int-mode, expecting the result of the expression to be a church-encoded number. Example:

$ php repl.php
i> λf.λx.f (f (f x))
3

You can switch to bool-mode by sending the b command:

$ php repl.php
i> b
b> λx.λy.x
true

Or r for raw mode:

$ php repl.php
i> r
r> λx.x
λx.x

WIP

A few things are still a work in progress:

• Krivine machine: This alternate interpreter would allow call-by-need and indexing into de-bruijn indices, which is needed by...

• Binary lambda calculus: Allows encoding lambda calculus programs in binary form which produces extremely small programs. This also defines an I/O mechanism.

References

• Matt Might: 7 lines of code, 3 minutes
• Tom Stuart: Programming with Nothing
• Jean-Louis Krivine: A call-by-name lambda-calculus machine
• Rémi Douence, Pascal Fradet: The Next 700 Krivine Machines
• Xavier Leroy: The Zinc Experiment
• John Tromp: Binary Lambda Calculus and Combinatory Logic
• John Tromp: Binary Lambda Calculus interpreter for IOCCC
• Erkki Lindpere: Parsing Lambda Calculus in Scala
• Binary Lambda Calculus in Python
• Krivine Machine in Scheme
• Algorithmic Information Theory in Haskell
• Lambda Calculus - Wikipedia
• Binary Lambda Calculus - Wikipedia
• De Bruijn index - Wikipedia

Thanks to

• @ympbyc
• @smdiehl