High-Order Functions: Unification Theory

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (32)

Page 1 of 4

Lambda Calculus and Type Safety: An Overview

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

Parsing with Combinators

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.