Lectures related to Polymorphism and Proofs

Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.

Provides an overview of essential search and sort algorithms in computer science.

Explores the significance of types in programming and discusses unsound type systems and inductively defined relations.

Covers pointers to strings, functions, and casting in C programming.

Focuses on solving recurrences in divide-and-conquer algorithms using various techniques and examples.

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

Explores loop invariants, time analysis, and the Divide-and-Conquer approach with a focus on Merge Sort.

Explores optimization problems and greedy algorithms for efficient decision-making.

Discusses the importance of types, unsound type systems, and inductively defined relations for a small language's type system.