University of Birmingham > Talks@bham > Theoretical computer science seminar > A minimal cyclic formal framework for coinduction

A minimal cyclic formal framework for coinduction

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

If you have a question about this talk, please contact Vincent Rahli.

A salient principle for reasoning about infinite data types, such as infinite streams or trees, is the principle of coinduction. However, despite intensive progress in recent years, practical formal frameworks that support coinductive reasoning remain a significant challenge. In this talk I will present a natural, concise formal framework that integrates coinductive reasoning in a way that captures its intuitive use and clearly reveals the duality between induction and coinduction. Semantically, the framework is based on the approach of transitive closure logic, a generic logic for expressing inductive structures; and for deduction, it adopts non–well-founded (cyclic) proof theory.

This is a joint work with Reuben N. S. Rowe (Royal Holloway University of London, UK)

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.