Главная
Study mode:
on
1
Intro
2
THE LEAN THEOREM PROVER TEAM
3
INTRODUCTION: LEAN
4
SECONDARY GOALS
5
SOFTWARE VERIFICATION AND FORMALIZED MATHEMATICS
6
ARCHITECTURE
7
KERNEL
8
TWO OFFICIAL LIBRARIES
9
AGNOSTIC MATHEMATICS
10
FREEDOM TO TRUST
11
EXPORTING LIBRARIES
12
RECURSIVE EQUATIONS
13
TACTICS
14
STRUCTURES (ADDITIONAL INSTANCES)
15
STRUCTURES (CONCRETE INSTANCES)
16
SYLOW THEOREM
17
AUTOMATION IN LEAN
18
AUTOMATION (MAIN CHALLENGES)
19
CASTS
20
CONGRUENCE FOR HETEROGENEOUS EQUALITY
21
EXAMPLE
22
CONGRUENCE CLOSURE AND PROOF RELEVANCE
Description:
Explore the Lean theorem prover in this comprehensive lecture by Leonardo de Moura at the Paul G. Allen School. Delve into the goals, architecture, and key features of this open-source project developed by Microsoft Research and Carnegie Mellon University. Learn how Lean bridges the gap between interactive and automated theorem proving, offering a framework for user interaction and axiomatic proof construction. Discover its applications in formalizing datatypes, algebraic structures, homotopy type theory, category theory, and analysis. Gain insights into Lean's trusted kernel based on dependent type theory, integrated development environments, and rich API. Understand the project's long-term vision and its current capabilities in the field of automated reasoning and theorem proving.

The Lean Theorem Prover

Paul G. Allen School
Add to list