Polymorphism in Coq: Data Structures and Functions

Related lectures (28)

Page 2 of 3

Explores the verification of programs using Stainless, focusing on functional correctness, proof assistants, and automation of reasoning tasks.

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

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

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

Covers parameterized types, their implementation, advantages, weaknesses, and the principles of inheritance in programming.

Covers Amyli, a tiny functional language, type rules, and soundness.

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

Explores advanced Python programming concepts, focusing on list comprehensions and higher order functions.

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

Introduces Coq and focuses on proving the theorem and_comm step by step.