![[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)
Andrew Kennedy
Monday 12 July 2010, 12:45-14:00
Every bit counts
- đ¤ Speaker: Andrew Kennedy
- đ Date & Time: Monday 12 July 2010, 12:45 - 14:00
- đ Venue: Room FW26, Computer Laboratory, William Gates Building
Questions? Contact
Sam Staton
Abstract
What is a good wire representation for typed lambda calculus terms? To answer this question we’ll take a journey through pre fix codes, infinite decision trees, and type isomorphisms, with code in Haskell and Coq. This is joint work with Dimitrios Vytiniotis.
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
- Interested Talks
- Martin's interesting talks
- Room FW26, Computer Laboratory, William Gates Building
- School of Technology
- Semantics Lunch (Computer Laboratory)
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.