Encoding Recursion as Self-Application

Related lectures (30)

Page 2 of 3

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.