Back to Homepage

Programme


A concrete schedule of the programme will appear here nearer to the time of the meeting. Until then you will find below a link to the invited talks and a list of contributed talks (subject to change).

Invited Lectures
No Presenter Title
1 Zhao Dongsheng Dcpo-completion of posets
2 Michel Schellekens Bridging Semantics and Complexity: a new approach
3 Ernst-Erich Doberkat Basing Markov transitions on the Giry monad
4 Pawel Waszkiewicz ON DOMAIN THEORY OVER CDG QUANTALES
5 Rasmus Møgelberg From Parametric Polymorphism to Models of Polymorphic FPC
6 Lars Birkedal Possible World Semantics for Impredicative Polymorphism, References,and Recursive Types
7 Petter Kristian Køber Power Domain Representations of Spaces of Compact Subsets
8 Reinhold Heckmann Similarity, Topology, and Uniformity
9 Nick Bezhanishvili BITOPOLOGICAL DUALITY FOR DISTRIBUTIVE LATTICES AND HEYTING ALGEBRAS
10 Dominique Larchey-Wendling Kripke Models of Boolean BI and Invertible Resources
11 Daniela Petrisan Equational logic for higher-order abstract syntax
12 Dirk Hofmann Continuous V-categories
13 Alexander Kurz Completeness of Moss's Coalgebraic Logic
14 Jim Laird Sequential Algorithms for Unbounded Nondeterminism
15 Josè Raymundo Marcial First-order definability of LRT
16 Ingo Battenfeld Two Probabilistic Powerdomains for Topological Domain Theory
17 Anton Hedin A continuous dcpo representation of regular formal topologies
18 Martín Escardó Computability of solutions of higher-type equations
19 Paul Blain Levy Modal properties of recursively defined commands
21 Uli Berger A coinductive approach to digital computation
22 Dirk Pattinson On the use of Domain-Theoretic Derivatives for Solving ODEs
23 Jimmie Lawson New Developments on the Formal Ball Domain
24 Paul Taylor Equideductive Logic and CCCs with Subspaces
25 Paulo Oliva On variants of modified bar recursion