Slides from Selected Talks


BibTeX database: BirkedalL:talks.bib
16 references, last updated Fri Oct 13 11:35:47 2017

[1]
Relational models and program logics: Logical relations in iris. Talk at NII Shonan, Japan, October 2017. (PDF)

[2]
Kripke models over recursive worlds (the joy of ultrametric spaces). Talk at Dagstuhl, Germany, August 2010. (PDF)

[3]
Step-indexed Kripke models over recursive worlds. Talk at INRIA Rocquencourt, Paris, France, May 2010. (PDF)

[4]
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)

[5]
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)

[6]
Realizability semantics of parametric polymorphism, general references, and recursive types. Talk at Domains Workshop 2008, Brighton, UK, September 2008. (PDF)

[7]
A simple model of separation logic for higher-order store. Talk at ICALP 2008, Iceland, July 2008. (PDF)

[8]
A realizability model of impredicative hoare type theory. Talk at Chalmers, Gothenburg, Sweden, November 2007. (PDF)

[9]
Bi hyperdoctrines and higher-order separation logic. Talk at ESOP 2005, Edinburgh, UK, April 2005. (PDF)

[10]
Parametric domain-theoretic models of linear/intuitionistic polymorphic lambda calculus. Talk at MFPS XX, Pittsburgh, USA, May 2004. (PDF)

[11]
Proving correctness of a garbage collector via local reasoning. Talk at the First Appsem-II Workshop, Nottingham, England, March 2003. (PDF)

[12]
LaCoMoCo - Crossroads Copenhagen. Talk at the J2ME course at the IT University of Copenhagen, March 2003. (PDF)

[13]
Relative and modified relative realizability. Talk at the Category Theory 2000 Conference, Como, Italy, July 2000. (Gzipped PostScript) (PDF)

[14]
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]
Developing theories of types and computability. Thesis Defense. Carnegie Mellon University, December 1999. (Gzipped PostScript)

[16]
Local realizability toposes and a modal logic for computability. Tutorial Workshop on Realizability Semantics, FLoC'99, Trento, Italy, July 1999. (Gzipped PostScript)

0 references, last updated Fri Oct 13 11:35:23 2017