Big-step semantics: Defining arithmetic expressions and commands

Related lectures (29)

Page 3 of 3

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

Explores the integrality gap concept in set cover and multiplicative weights algorithms.

Covers the definition of an inductive data type in Coq and how to build proofs interactively using tactics.

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

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

Covers logic programming concepts, focusing on automated proof search and unification techniques in Coq.

Covers the integration of differential forms on smooth manifolds, including the concepts of closed and exact forms.

Introduces the fundamentals of variables and types in C programming, covering declaration, initialization, and the differences from Java.

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.