Lambda

Lambda project is a software that acts as a Lambda calculus interpreter, allowing for the reduction of lambda expressions and conversion to the S, K, and I combinators (ext). It also provides the ability to associate names to lambda expressions (def), load definitions from a file (load), and list current definitions (list) for increased efficiency. Additionally, lambda expressions representing integers are automatically defined as needed.

Lambda comes packed with numerous interesting combinators provided in a definition file pre-loaded with the software. Its various settings allow users to influence the way reduction and extraction are performed (set), while its short manual provides the necessary guidance on how to use lambda.

Some of the key features include the ability to load predefined lambda expression, many preloaded definitions for numbers, Y fact map, iszero, list, 1st, 2nd, 3rd, ADD, MUL, EXP, list, suc, pred, and more. The software automatically defines numbers as per the user's need, interprets lambda expressions, and enables single-step interpretation. Additionally, it supports normal or application order reductions, variable extraction (Conversion to S K I), and list definitions.

To operate Lambda, the following requirements are necessary: libstdc++. Version upgrades come with additional features such as the addition of the xapp flag for ext command or made ext behavior consistent, and preprocessing for user manual. The latter feature allows automatic insertion of a table of contents and character entity translations.