University of Cambridge > > Isaac Newton Institute Seminar Series > The Lean Theorem Prover

The Lean Theorem Prover

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact INI IT.

BPR - Big proof

Lean is a new, open source, interactive theorem prover designed to
support mathematical reasoning as well as hardware and software
verification. Because its logical foundation, dependent
type theory, has a computational interpretation, we can use Lean
as a programming language and evaluate expressions with a fast
bytecode evaluator. We obtain a metaprogramming language—
that is, a language that we can use to construct expressions
and proofs in dependent type theory itself—by exposing Lean
internals through a suitable API . This provides us with a means
of extending Lean's functionality and automation within Lean
itself. In this talk, I will describe this
metaprogramming framework and some of its mechanisms for manipulating
expressions efficiently.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2022, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity