COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > TALK CANCELLED: An overview of structural corecursion

## TALK CANCELLED: An overview of structural corecursionAdd to your list(s) Download to your calendar using vCal - Venanzio Capretta (University of Nottingham)
- Friday 24 April 2009, 14:00-15:00
- Room FW11, Computer Laboratory, William Gates Building.
If you have a question about this talk, please contact Sam Staton. THIS TALK HAS BEEN POSTPONED. We hope to reschedule for later in the term. The topic of the talk is programming over infinite structures. Non-wellfounded objects can be represented and manipulated by recursive functions whose circularity is restricted in several ways. We do not yet have a satisfactory theory of what recursive definitions should be allowed and how we can reason over them. I will give an overview of the main questions that we are facing and then describe an approach to an abstract characterisation of corecursion that we are developing. The notion of corecursive algebra characterises structures whose elements contain infinite information. Functions into them can be defined by infinite iteration of productive procedures. On the other hand, the notion of antifounded algebra characterises structures on which we can reason by using bisimulation. It is not a surprise that this concept is more general than that of corecursive algebra: the principle of bisimulation holds also for wellfounded structures, although it is equivalent with the more manageable structural equality. The real surprise of our research is that not all corecursive algebras are antifounded. We found a structure that satisfies the principle of corecursion but not that of bisimulation. It is constructed by exploiting a certain colouring of the edges of an infinite tree. I will introduce and illustrate the notion and then describe our counterexample. Work in collaboration with Tarmo Uustalu and Varmo Vene. This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series. ## This talk is included in these lists:- All Talks (aka the CURE list)
- Cambridge talks
- Computing and Mathematics
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Logic and Semantics Seminar (Computer Laboratory)
- Room FW11, Computer Laboratory, William Gates Building
- School of Technology
- Trust & Technology Initiative - interesting events
- bld31
- yk373's list
Note that ex-directory lists are not shown. |
## Other listsBiophysical Seminar Series 2016/17 Martin Centre, 37th Annual Series, Architecture Leadership in the Emerging Markets## Other talksStereodivergent Catalysis, Strategies and Tactics Towards Secondary Metabolites as enabling tools for the Study of Natural Products Biology CANCELLED-Open tools in Marchantia for plant bioengineering work and as a platform for elucidating morphogenesis Random Feature Expansions for Deep Gaussian Processes A stochastic model for understanding PIN polarity in isolated cells Production Processes Group Seminar - 'Re-thinking biosensors for resource-limited settings' Scaling of tissue proportions to body size during vertebrate development CafĂ© Synthetique: Graduate Talks! Knot Floer homology and algebraic methods To be confirmed The Gopakumar-Vafa conjecture for symplectic manifolds Glucagon like peptide-1 receptor - a possible role for beta cell physiology in susceptibility to autoimmune diabetes Eurostar with Philippe Mouly |