Introduce the Lambda Calculus as a minimal universal programming language. Describe the three basic rules of transformation: alpha-conversion (renaming), beta-reduction (computation), and eta-conversion (extensionality). Provide step-by-step examples of beta-reduction for a simple lambda expression such as (λx.x + 1) 3.