University of Birmingham > Talks@bham > Theoretical computer science seminar > Seemingly impossible programs and proofs

Seemingly impossible programs and proofs

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

If you have a question about this talk, please contact Martin Escardo.

In previous work we developed algorithms that perform the seemingly impossible task of exhaustively searching infinite sets in finite time. To formulate and prove their correctness, we used a combination of programming language semantics, topology and higher-type computability theory. In this talk, we explore the same ideas from a different, logical angle. The algorithms are derived from constructive proofs of instances of the law of the excluded middle that, at first sight, look constructively implausible. To achieve this, we work in dependent type theory, a foundation for constructive mathematics that can also be considered as a programming language. Familiarity with type theory will not be assumed. — This is a practice talk for my CSL ’2022 talk on 19th February — Zoom

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.