Formal semantics

Related lectures (23)

Page 1 of 3

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 Hoare Logic, its foundations, applications, and significance in program verification.

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

Covers polymorphism in Coq, focusing on data structures and functions like lists, length, and append.

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

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

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

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

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