Lectures related to Foundations of Software

Explains compression and Kraft inequality in codes and sequences.

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

Presents a short proof of a conjecture by Erdös, exploring related questions and detailed proof of the proposition.

Explores Church numerals, Booleans, pairs, recursion, and behavioral equivalence in Lambda Calculus.

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

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