![[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)
Thursday 17 September 2015, 10:00-11:00
POSTPONED: Abstract machines and certified compilers
- 👤 Speaker: Maciej Piróg
- 📅 Date & Time: Thursday 17 September 2015, 10:00 - 11:00
- 📍 Venue: FW26
Questions? Contact
Peter Sewell
Abstract
A compiler is called certified if it comes with a machine-verified proof of its correctness with respect to the semantics of the source and target languages. In am going to talk about certified compilers for high-level languages with non-trivial semantics, such as the lazy semantics of Haskell, and how systematic manipulation of semantics can guide the design of such a compiler, or even automatise the process.
Series This talk is part of the REMS lunch 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
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.