University of Birmingham theoretical computer science seminar

computational complexity discrete mathematics formal languages and automata theory logic in computer science programming languages category theory logic

Audience:	Researchers in the topic
Seminar series time:	Friday 14:00-15:00 in your time zone, UTC
Organizers:	Abhishek De, Sam Speight
	*contact for this listing

Meeting ID: 818 7333 5084 ~ Password: 217

Upcoming talks

Past talks

Your time			Speaker	Title
Fri	Jan 24	14:00	Laura Bocchi	Asynchronous Session Subtyping by Trace Relaxation
Fri	Jan 31	14:00	John Sylvester	Adjacency Labeling Schemes for Small Classes
Fri	Feb 07	14:00	Daniel Hausmann	TBA
Fri	Feb 28	14:00	Matthew Alan Le Brun	TBA
Fri	Mar 14	14:00	Ekaterina Komendantskaya	TBA
Fri	Apr 04	13:00	Rodrigo Nicolau Almeida	TBA

Embed this schedule

Your time			Speaker	Title
Fri	Dec 13	14:00	Morgan Rogers	Topoi with enough points
Fri	Dec 06	14:00	Amin Karamlou	Quantum relaxations of CSP and structure isomorphism
Fri	Nov 29	14:00	Sebastian Enqvist	Computational content of classical cyclic proofs
Fri	Nov 22	14:00	Luca Reggio	Resource-bounded logics: a categorical and modal view
Fri	Nov 15	14:00	Sergey Goncharov	Introduction to Higher-Order Mathematical Operational Semantics
Fri	Nov 08	14:00	Giovanni Soldà	A proof of Nash-Williams theorem in ATR0
Fri	Nov 01	14:00	Soumyajit Paul	Drinking is not good for driving, nor for computation : complexity of solving games with imperfect information
Fri	Oct 25	13:00	Sky Wilshaw	New Foundations: the story of a large formalisation project
Fri	Oct 18	13:00	Daniel Gratzer	On synthetic category theory in homotopy type theory
Fri	Oct 11	13:00	Tamio-Vesa Nakajima	Bipartite versus triangle-free subgraphs
Fri	Oct 04	13:00	Christian Konrad	Maximal Matching in Bounded-deletion Streams
Fri	Sep 27	13:00	Arkadev Chattopadhyay	The Power of Randomness in Query and Communication
Thu	Sep 19	10:00	Stepan Kuznetsov	Substructural logics with Kleene star
Fri	Jun 07	10:00	Wilmer Ricciotti	Syntactic representation of program execution history
Fri	May 31	10:00	Ambroise Lafont	A diagram editor to mechanise categorical proofs
Fri	May 24	10:00	Sam van Gool	Deciding unifiability by folding coalgebras
Fri	May 17	10:00	Calum Hughes	Models of Martin-Löf Type Theory and Algebraic Model Structures
Fri	May 10	10:00	Andrew Sogokon	Inductive Invariants in Continuous Systems
Fri	Apr 26	10:00	Paul Taylor	Free algebras for functors, with not an ordinal in sight
Fri	Apr 19	10:00	Pablo Donato	Deep Inference for Graphical Theorem Proving
Thu	Apr 18	10:00	Hugo Ferée	Mechanised uniform interpolation for modal logics K, GL and iSL
Fri	Mar 22	11:00	Cristina Matache	Parameterized algebraic theories and applications
Mon	Mar 18	13:00	Igor Carboni Oliveira	Polynomial-Time Pseudodeterministic Construction of Primes
Fri	Mar 15	11:00	Leo Lobski	Towards functorial chemistry: completeness and universality for reaction representation
Fri	Mar 08	11:00	Charles Grellois	Semantic approaches to verification of functional programs
Fri	Mar 01	11:00	Nesta van der Schaaf	Ordered Locales
Fri	Feb 23	11:00	Alex Kavvos	Two-dimensional Kripke Semantics
Fri	Feb 16	11:00	Dylan Braithwaite	Probabilistic Programming with Session Types
Fri	Feb 09	11:00	Satoshi Kura	Higher-Order Weakest Precondition Transformers via a CPS Transformation
Fri	Feb 02	11:00	Tomáš Jakl	Feferman–Vaught–Mostowski theorems and game comonads
Fri	Jan 26	11:00	Jeremy Gibbons	Turner, Bird, Eratosthenes: An Eternal Burning Thread

Embed this schedule

Export series to