Pen-and-paper session: Lambda Calculus Proofs

Related lectures (32)

Page 2 of 4

Covers operational semantics and evaluation strategies in lambda calculus, including redex, alternative evaluation strategies, and Church Booleans.

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

Introduces Cartesian product and induction for proofs using integers and sets.

Introduces Coq, an interactive theorem assistant based on the Curry-Howard isomorphism.

Explores maps, type operators, equivalence, first-class types, System Fw, Coq, and the challenges of type checking in programming languages.

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.

Explores proof concepts, techniques, and applications in logic, mathematics, and algorithms.