![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Vladimir Komendantsky (St Andrews)
Friday 25 May 2012, 11:00-12:00
Virtue of certified programming with decision procedures
â ī¸ Important: NB: unusual day/time
- đ¤ Speaker: Vladimir Komendantsky (St Andrews)
- đ Date & Time: Friday 25 May 2012, 11:00 - 12:00
- đ Venue: FW26
Questions? Contact
Peter Sewell
Abstract
In this moderately technical talk, I will discuss explicit termination of computations certified in Coq, and recall the importance of correct decision procedures for constructive understanding of computational problems. I will refer to examples of first-order definable relations on finite-state transition systems to show how logical analysis can underpin different degrees of type dependencies.
Series This talk is part of the Semantics Lunch (Computer Laboratory) series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Department of Computer Science and Technology talks and seminars
- FW26
- Interested Talks
- Martin's interesting talks
- School of Technology
- Semantics Lunch (Computer Laboratory)
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.