University of Cambridge > > Semantics Lunch (Computer Laboratory) > Every bit counts

Every bit counts

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

If you have a question about this talk, please contact Sam Staton.

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.

This talk is part of the Semantics Lunch (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity