University of Birmingham > Talks@bham > Theoretical computer science seminar > Canonical proof-objects for coinductive programming

Canonical proof-objects for coinductive programming

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

If you have a question about this talk, please contact Anupam Das.

Proof assistants such as Coq and Agda support coinduction but it’s not perfect. We will discuss a few issues of coinduction in Coq. Non-wellfounded and circular proof theory have been recognised over the past decade as a valuable tool to study (co)induction. In a first step to tackle some of the aforementioned issues, we develop the theory of infinets – proof-nets for non-wellfounded proofs.

This is a joint work with Luc Pellisier and Alexis Saurin.


Topic: Theory Seminar Friday 3 September Time: Sep 3, 2021 02:00 PM London

Join Zoom Meeting

Meeting ID: 848 5957 5160 One tap mobile +442080806591,,84859575160# United Kingdom +442080806592,,84859575160# United Kingdom

Dial by your location +44 208 080 6591 United Kingdom +44 208 080 6592 United Kingdom +44 330 088 5830 United Kingdom +44 131 460 1196 United Kingdom +44 203 481 5237 United Kingdom +44 203 481 5240 United Kingdom +44 203 901 7895 United Kingdom Meeting ID: 848 5957 5160 Find your local number:

Join by SIP

Join by H.323 (US West) (US East) (India Mumbai) (India Hyderabad) (Amsterdam Netherlands) (Germany) (Australia Sydney) (Australia Melbourne) (Singapore) (Brazil) (Mexico) (Canada Toronto) (Canada Vancouver) (Japan Tokyo) (Japan Osaka) Meeting ID: 848 5957 5160

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.