Slides from Selected Talks
BibTeX database: BirkedalL:talks.bib
15 references, last updated Sat Sep 4 21:15:21 2010
- Kripke models
over recursive worlds (the joy of ultrametric spaces).
Talk at Dagstuhl, Germany, August 2010.
(PDF, 334191 bytes)
- Step-indexed
Kripke models over recursive worlds.
Talk at INRIA Rocquencourt, Paris, France, May 2010.
(PDF, 381928 bytes)
- Realizability
semantics of parametric polymorphism, general referendes and recursive
types.
Talk at Ph.D. School on Logics and Semantics of State 2008, IT University of
Copenhagen, Denmark, October 2008.
(PDF, 273899 bytes)
- Bi hyperdoctrines
and higher-order separation logic.
Talk at Ph.D. School on Logics and Semantics of State 2008, IT University of
Copenhagen, Denmark, October 2008.
(PDF, 107828 bytes)
- Realizability semantics
of parametric polymorphism, general references, and recursive types.
Talk at Domains Workshop 2008, Brighton, UK, September 2008.
(PDF, 250845 bytes)
- A simple model of
separation logic for higher-order store.
Talk at ICALP 2008, Iceland, July 2008.
(PDF, 189599 bytes)
- A realizability model
of impredicative hoare type theory.
Talk at Chalmers, Gothenburg, Sweden, November 2007.
(PDF, 141356 bytes)
- Bi hyperdoctrines and
higher-order separation logic.
Talk at ESOP 2005, Edinburgh, UK, April 2005.
(PDF, 340696 bytes)
- Parametric domain-theoretic
models of linear/intuitionistic polymorphic lambda calculus.
Talk at MFPS XX, Pittsburgh, USA, May 2004.
(PDF, 148697 bytes)
- Proving correctness of a
garbage collector via local reasoning.
Talk at the First Appsem-II Workshop, Nottingham, England, March 2003.
(PDF, 621916 bytes)
- LaCoMoCo -
Crossroads Copenhagen.
Talk at the J2ME course at the IT University of Copenhagen, March 2003.
(PDF, 60002 bytes)
- Relative and modified
relative realizability.
Talk at the Category Theory 2000 Conference, Como, Italy, July 2000.
(Gzipped PostScript, 28 pages, 370922 bytes)
(PDF, 195464 bytes)
- A general notion of
realizability.
Talk at the 15th Annual IEEE Symposium on Logic in Computer Science, Santa
Barbara, USA, June 2000.
(Gzipped PostScript, 15 pages, 337352 bytes)
- Developing theories of types
and computability.
Thesis Defense. Carnegie Mellon University, December 1999.
(Gzipped PostScript, 28 pages, 75174 bytes)
- Local realizability toposes
and a modal logic for computability.
Tutorial Workshop on Realizability Semantics, FLoC'99, Trento, Italy, July
1999.
(Gzipped PostScript, 18 pages, 55605 bytes)