Lectures related to Encoding Recursion as Self-Application

Covers the concepts and implementation of functional programming in Scala, emphasizing functions, immutable data, and data abstraction.

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

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

Covers functional programming concepts in Python, showcasing filtering lists based on specific criteria.

Explores Church numerals and encoding conditionals in lambda calculus.

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

Explores higher-order functions and lambda expressions in Python, showcasing their practical applications and concise syntax.

Introduces terms, abstractions, applications, and values in the lambda calculus.

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

Covers the implementation of recursive functions using substitutions and environments, showcasing the ability to execute computable functions.

Explores advanced software engineering topics and signal processing using lazy lists to build a sound synthesizer from scratch.

Explores higher-order functions, environments, evaluation using substitution, and examples like twice factorial.

Introduces Python basics, functions, lists, and lambda functions for concise coding.

Covers modeling control statements with functions in Scala, including while loops, repeat loops, and for-loops translation.

Covers the semantics of programming languages, focusing on the Add language and the role of rewriting rules and CK machines in understanding meaning.

Delves into type checking, reconstruction, equations, unification, Hindley/Milner system, polymorphism, and principal types.

Delves into Lambda Calculus proofs, emphasizing structural induction and variable manipulation.

Explores the use of for-expressions in Scala to simplify computations and solve problems like combinatorial search and N-Queens.

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

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