Encoding Recursion as Self-Application

Related lectures (30)

Page 1 of 3

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.