Be the first to like this
Google BACAT talk.
Abstract: Dialectica Categories (also known as dialectica spaces), the main construction of my phd thesis, have had several (unrelated) applications. I've used them to model Linear Logic, FILL(Full Intuitionistic Linear Logic), the Lambek Calculus and classes of Petri Nets (with C. Brown and D. Gurr). They were also used to model state in programming language semantics, after U. Reddy (with M. Correa and H. Hausler), and fuzzy Petri nets (with A. Syropoulos) and several 'superpower games' (A. Blass). Recently Mihai Budiu, Joel Galenson and Gordon Plotkin used dialectica categories in the modelling of partial compilers. I want to discuss this application, presented in the preprint "The Compiler Forest" (#90), available from Plotkin's webpage, to see if I understand it. Since I know little about compilers, audience participation will be very welcome!