The diploma thesis presents an algorithm for solving an arbitrary lambda
expression that is possible to implement with an FPGA circuit. The diploma
thesis covers the theory of the lambda calculus, memory representation of a
lambda expression and a general algorithm for solving lambda expressions.
The result of the diploma thesis is an algorithm, designed as a deterministic
finite automaton, which uses a set of registers, a stack and memory to solve
any lambda expression. Because the algorithm is designed as a deterministic
finite automaton, it can be easily implemented with an FPGA circuit. The
algorithm is implemented in the C programming langugage and supports
testing and measuring runtime data.