Turing machine

From HaskellWiki
Haskell theoretical foundations

General:
Mathematics - Category theory
Research - Curry/Howard/Lambek

Lambda calculus:
Alpha conversion - Beta reduction
Eta conversion - Lambda abstraction

Other:
Recursion - Combinatory logic
Chaitin's construction - Turing machine
Relational algebra

The Turing machine is a formal mathematical system for describing the notion of computation. Almost all imperative programming languages have an ancestry based on the Turing machine.

For more information on the matter: Turing machine