Lectures related to High-Order Functions: Unification Theory

Lambda Calculus and Type Safety: An Overview

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

Explores parsing text into trees using parser combinators in Scala, covering filtering, transforming, sequencing, alternatives, recursion, spaces handling, lexing, monadic nature, and for-notation.

Types in Lambda Calculus

Covers types in lambda calculus, including defining types, specifying rules, and proving soundness.

Object-Oriented Parser Combinators

Covers object-oriented parser combinators in Scala for building parsers, including JSON parsing and testing.

Type Checking and Reconstruction: Equations and Unification

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

Simply Typed Lambda Calculus: Foundations and Properties

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

Name Analysis: Compiler Phases and Symbol Tables

Explores compiler phases and symbol tables' role in mapping variables to declarations.

Lambda Calculus: Church Numerals

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

CLP Parser Lab Presentation

Covers implementing a parser for transforming tokens into an Abstract Syntax Tree.

CYK Parsing Algorithm for General Grammars

Introduces the CYK parsing algorithm for context-free grammars, explaining its handling of ambiguity and importance in parsing general grammars.

Grammars and Parsers: An Overview of Language Processing

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

Church Numerals and Conditionals

Explores Church numerals and encoding conditionals in lambda calculus.

LL(1) Parsing

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

CYK Algorithm for Parsing General Grammars

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

Tuples: Desugaring and Implementation

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

Pen-and-paper session: Lambda Calculus Proofs

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

Lambda Calculus: Operational Semantics and Evaluation Strategies

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

WS1S Solver: Project Structure

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

Foundations of Software: Modeling Programming Languages

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

Syntactic Parsing and Graph2Graph Transformers

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