High-Order Functions: Unification Theory

Related lectures (32)

Page 2 of 4

Provides an overview of grammars and parsers in computer language processing.

Explores Church numerals and encoding conditionals in lambda calculus.

Covers LL(1) parsing, formalization, automation, constraints, and parsing tables.

Explores parsing general grammars using the CYK algorithm and Chomsky Normal Form.

Covers the implementation details of tuples in Scala, including desugaring, lexical analysis, parsing, and code generation.

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

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

Explores the project structure for solving WS1S formulas and planned additions.

Covers the mathematical study of program behaviors, parsing, domain-specific languages, and powerful tools for language design.

Covers syntactic parsing, dependency grammar, and graph-based neural network parsing.