Type Rules: Progress and Preservation

Related lectures (32)

Page 3 of 4

Explores the relational semantics of loops in programs and the mathematical interpretation of loop structures.

Introduces Stainless, an open-source tool for verifying Scala programs, covering language, modeling, verification tips, and inner workings.

Covers effective altruism in AI safety, focusing on programming semantics and memory management.

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

Covers the foundations of Scala, including modelling recursive types, parameterized types, and variance.

Explores type inference in statically typed languages, using algorithms to assign types to program expressions accurately.

Presents the development of a verified high-level synthesis compiler for elastic circuits.

Discusses data abstraction in programming, focusing on modules and specifications in Coq.

Explores Second Order Logic, WS1S, HOL, decision procedures, atomic and composite formulas, and the combination of WS1S with MONA in HOL.

Explores subtyping rules, challenges, and its connection to various forms of polymorphism in programming languages.