Pen-and-paper session: Lambda Calculus Proofs

Related lectures (33)

Covers topics related to induction and recursion, including mathematical induction proofs and recursive definitions.

Covers examples of direct and indirect proofs in mathematics.

Provides an overview of lambda calculus, type safety, and type inference in programming languages.

Covers the simply typed lambda calculus, focusing on its syntax, semantics, and type system properties such as progress and preservation.

Covers high-order functions, parser, and type checker concepts.

Explores subtyping, type calculus, and type bounds calculation in a system with subtyping, guiding through exercises and proofs step by step.

Discusses inductive propositions, their definitions, and applications in reasoning and evaluation techniques in Coq.

Covers strong normalization, error handling, and typing rules for Calculi design.

Covers the basics of Coq, focusing on arithmetic expressions, evaluation, and proof techniques.

Covers the essential concepts of the Standard Template Library (STL) in C++ for efficient data manipulation.

Explores advanced Python programming concepts, focusing on list comprehensions and higher order functions.

Covers the Fourier inversion formula, exploring its mathematical concepts and applications, emphasizing the importance of understanding the sign.

Covers Taylor polynomials and their role in approximating functions in multiple variables.

Page 2 of 2