
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
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!
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment