Program Verification via Type Theory

Combinators

Object Calculus

Monads

Loop Invariants

Lambda Calculus

State (computer science)

Pi Calculus

Lean (proof assistant)

Typed Lambda Calculus

Type State

Combinator Calculus

Polymorphic Types

Continuations

Gradual Types

CS 242 Programming Languages Stanford University Fall 2022 Stanford University's CS 242 teaches the basics of programming language theory, its applications, and future trends. It focuses on the practical and theoretical understanding of programming languages, covering typed lambda calculus, state, monads, and more. CS242, Programming Languages, covers the basics of the theory of programming languages, its applications to widely used languages today, and trends in the field that are likely to help define the programming languages of tomorrow. The techniques covered in the class also provide a set of intellectual tools that students can use to understand unfamiliar programming languages and improve their ability to design and write software.  - Theory: CS 103
     - First-order logic, induction, discrete math
- Systems: CS 107 + 110
- Comfortable with programming
    - And learning new programming systems 

CS 242 Programming Languages

Programming Languages

Program Verification via Type Theory

1 courses cover this concept

CS 242 Programming Languages