Theoretical computer science

Related lectures (26)

Page 1 of 3

Covers class hierarchies, pattern matching, function values, and function calls in Scala.

Covers parametric polymorphism, lists construction, tuples, generic methods, merge sort, and proving program properties.

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

Covers the basics of C programming, including syntax, data types, pointers, arrays, and compilation commands.

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

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

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

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

Explores the Spec# programming system, focusing on a verifying compiler for C# 2.0.

Explains the essential concepts of functions in C programming, including definitions, prototypes, and argument passing techniques.