## Theoretical computer science seminar
Add to your list(s)
Send you e-mail reminders
Further detail
Seminar series in theoretical computer science 1 upcoming talk and ## On the complexity of linear arithmetic theories over the integersDmitry Chistikov, University of Warwick. Computer Science, The Sloman Lounge (UG). Friday 17 January 2020, 11:00-12:00 ## Constructing Infinitary Quotient-Inductive TypesAndy Pitts (University of Cambridge). Computer Science, The Sloman Lounge (UG). Friday 10 January 2020, 11:00-12:00 ## Taylor expansion in linear logic is invertible: A completeness resultDaniel de Carvalho, Innopolis University. Computer Science, The Sloman Lounge (UG). Friday 01 November 2019, 11:00-12:00 ## Nested proof systems for modal logics (and beyond)Sonia Marin, UCL. Computer Science, The Sloman Lounge (UG). Friday 25 October 2019, 11:00-12:00 ## Algorithmic Human Development: What is it and why do we need it now?Note unusual time Professor Abbas Edalat, Imperial College London. Computer Science, The Sloman Lounge (UG). Friday 18 October 2019, 14:00-15:00 ## On the logical complexity of cyclic arithmeticAnupam Das, University of Birmingham. Computer Science, The Sloman Lounge (UG). Friday 11 October 2019, 11:00-12:00 ## Diagram rewriting in double categoriesAntonin Delpeuch, University of Oxford. Computer Science, The Sloman Lounge (UG). Friday 04 October 2019, 11:00-12:00 ## Foundational end-to-end verification of cyber-physical systems: The VeriPhy pipeline and its ApplicationsBrandon Bohrer (Carnegie Mellon). Computer Science, The Sloman Lounge (UG). Friday 19 July 2019, 11:00-12:00 ## Constructive Brouwer Fixed Point TheoremPaul Taylor (Computer Science, University of Birmingham, honorary). Friday 12 July 2019, 11:00-12:00 ## Rudimentary recursionAdrian Mathias. Computer Science, The Sloman Lounge (UG). Friday 21 June 2019, 11:00-12:00 ## A Sound and Complete Logic for Algebraic EffectsCristina Matache (Oxford). Computer Science, The Sloman Lounge (UG). Friday 14 June 2019, 11:00-12:00 ## Geometric morphisms as structure preserving maps and other nice characterisationsChristopher Townsend. Computer Science, The Sloman Lounge (UG). Friday 07 June 2019, 10:30-12:00 ## Reasoning about effectful programs and evaluation orderDylan McDermott (Cambridge). Computer Science, The Sloman Lounge (UG). Friday 31 May 2019, 11:00-12:00 ## Reasoning about entailment in natural language data using vectors, density matrices, and category theoryMehrnoosh Sadrzadeh, Queen Mary. Wednesday 29 May 2019, 11:00-12:00 ## Two Sides of the Same Coin: Session Types and Game SemanticsSimon Castellan, Imperial College London. Computer Science, The Sloman Lounge (UG). Friday 24 May 2019, 11:00-12:00 ## Graph Theory and the TransfiniteMichael Rathjen (Leeds). Computer Science, The Sloman Lounge (UG). Friday 17 May 2019, 11:00-12:00 ## Designing an algebraic effect system for OCamlLeo White, Jane Street. Computer Science, The Sloman Lounge (UG). Friday 22 March 2019, 11:00-12:00 ## Operational approaches to the foundations of physicsLucien Hardy, Perimeter Institute. Thursday 14 March 2019, 12:00-13:00 ## Linear Implicative Algebras, a Brouwer-Heyting-Kolmogorov interpretation of linear logicLuc Pellissier, IRIF, Université Paris Diderot. Computer Science, The Sloman Lounge (UG). Friday 08 March 2019, 11:00-12:00 ## Proof-Carrying PlansEkaterina Komendantskaya, Heriot-Watt University. Computer Science, The Sloman Lounge (UG). Friday 01 March 2019, 11:00-12:00 ## Unrestricted Quantification and the Structure of Type TheorySalvatore Florio and Nicholas K Jones, University of Birmingham (Philosophy). Computer Science, The Sloman Lounge (UG). Friday 15 February 2019, 11:00-12:00 ## COMPUTER PROBLEMS POSED BY DESSINS D'ENFANTS THEORYGeorge Shabat, Russian State University for the Humanities and Independent University of Moscow. Monday 11 February 2019, 14:00-15:00 ## Numerically Definite LogicRichard Kaye, University of Birmingham (Mathematics). Computer Science, The Sloman Lounge (UG). Friday 08 February 2019, 11:00-12:00 ## Strategic Graph Rewriting in PORGY — an interactive modelling frameworkMaria Isabel Fernandez, King's College London. Computer Science, The Sloman Lounge (UG). Friday 25 January 2019, 11:00-12:00 ## Higher Universal Algebra in Type TheoryEric Finster, INRIA, Paris. Tuesday 22 January 2019, 15:00-16:00 ## Towards Coherence for Guarded TracesSergey Goncharov, FAU Erlangen-Nürnberg. Monday 07 January 2019, 11:00-12:00 ## Don't Try This at Home: No-Go Theorems for Distributive LawsDaniel Marsden, University of Oxford. Computer Science, The Sloman Lounge (UG). Friday 14 December 2018, 11:00-12:00 ## Reflection principles in subsystems of analysisEmanuele Frittaion, University of Leeds. Computer Science, The Sloman Lounge (UG). Friday 23 November 2018, 10:30-11:30 ## Reverse mathematics of non-deterministic inductive definitionsHajime Ishihara (JAIST). Monday 19 November 2018, 15:00-16:30 ## Polynomials via fibrationsTamara von Glehn, University of Cambridge. Computer Science, The Sloman Lounge (UG). Friday 16 November 2018, 10:30-11:30 ## Some Open Problems in Homotopy Type TheoryNicolai Kraus, University of Nottingham. Computer Science, The Sloman Lounge (UG). Friday 09 November 2018, 10:30-11:30 ## Quantitative Algebraic ReasoningRadu Mardare, University of Aalborg. Computer Science, The Sloman Lounge (UG). Friday 02 November 2018, 10:30-11:30 ## Quasitopoi and universes of propositionsPaolo Capriotti, University of Nottingham. Computer Science, The Sloman Lounge (UG). Friday 26 October 2018, 11:00-12:00 ## Towards a Formal Theory of Renaming for OCamlReuben Rowe, University of Kent. Computer Science, The Sloman Lounge (UG). Friday 19 October 2018, 10:30-11:30 ## Completing the ZX-calculusMiriam Backens, University of Oxford. Computer Science, The Sloman Lounge (UG). Friday 12 October 2018, 11:00-12:00 ## Hypergraph categories as cospan algebrasBrendan Fong, MIT. Computer Science, The Sloman Lounge (UG). Wednesday 19 September 2018, 14:00-15:00 ## Understanding Girard’s ParadoxThorsten Altenkirch (Nottingham). 217, School of Computer Science. Tuesday 03 July 2018, 13:15-14:15 ## A homotopy type theory for directed homotopy theoryPaige North. Computer Science, The Sloman Lounge (UG). Friday 08 June 2018, 11:00-12:00 ## Magnitude of Metric SpacesSimon Willerton (Maths, Sheffield). Computer Science, The Sloman Lounge (UG). Friday 11 May 2018, 11:00-12:00 ## Future directions for JavaGavin Bierman (Oracle, Cambridge). Computer Science, The Sloman Lounge (UG). Friday 04 May 2018, 11:00-12:00 ## A Unified Perspective of Linear Time Logics using CoalgebrasCorina Cirstea (Southampton). Computer Science, The Sloman Lounge (UG). Friday 27 April 2018, 11:00-12:00 ## Ordinals vs. Cardinals in N? and BeyondSpecial seminar arranged by Aaron Sloman Aviv Keren (Jerusalem). Computer Science, The Sloman Lounge (UG). Wednesday 11 April 2018, 11:00-12:00 ## Physical oracles: Measurement, complexity and cyber-physical systemsEdwin Beggs (Maths, Swansea University). Computer Science, The Sloman Lounge (UG). Friday 23 March 2018, 11:00-12:00 ## An Algebraic Combinatorial Approach to the Abstract Syntax of Opetopic StructuresMarcelo Fiore (Cambridge). Computer Science, The Sloman Lounge (UG). Friday 02 March 2018, 11:00-12:00 ## Handlers in Scope with AdjunctionsNicholas Wu (Bristol). Computer Science, The Sloman Lounge (UG). Friday 23 February 2018, 11:00-12:00 ## Concurrent Kleene Algebra: free model and completenessAlexandra Silva (UCL). Computer Science, The Sloman Lounge (UG). Friday 16 February 2018, 11:00-12:00 ## The Dialectica models of type theoryroom 217, not Sloman Lounge Sean Moss (Oxford, formerly Cambridge). 217, School of Computer Science. Friday 09 February 2018, 11:00-12:00 ## The Church-Turing Thesis and denotational semanticsroom 217, not Sloman Lounge Achim Jung (School of Computer Science). 217, School of Computer Science. Friday 02 February 2018, 11:00-12:00 ## Teaching old type systems new tricks with type providersTomas Petricek (Alan Turing Institute). Computer Science, The Sloman Lounge (UG). Friday 26 January 2018, 11:00-12:00 ## Spaces of alpha-Lipschitz continuous maps, in a quasi-metric setting.Jean Goubault-Larrecq (LSV, ENS Paris-Saclay). Computer Science, The Sloman Lounge (UG). Friday 19 January 2018, 11:00-12:00 ## From curves to train tracks to compressed wordsNB 217 not Sloman Lounge Saul Schleimer (Maths, Warwick). 217, School of Computer Science. Friday 12 January 2018, 11:00-12:00 ## A Curry-Howard Correspondence for Event-Based ProgrammingNeel Krishnaswami (University of Cambridge, formerly Birmingham). Computer Science, The Sloman Lounge (UG). Friday 08 December 2017, 11:00-12:00 ## Universally optimal mitigation strategies for leakage of informationPasquale Malacaria (Queen Mary, London). Computer Science, The Sloman Lounge (UG). Friday 01 December 2017, 11:00-12:00 ## Syntactic and semantic fun with monadsFredrik Dahlqvist (UCL). Computer Science, The Sloman Lounge (UG). Friday 24 November 2017, 11:00-12:00 ## A concurrent interpretation of the law of excluded middleUlrich Berger (University of Swansea). Computer Science, The Sloman Lounge (UG). Friday 17 November 2017, 11:00-12:00 ## Decidable Logics for Path Feasibility of Programs with StringsAnthony Widjaja Lin (University of Oxford). Computer Science, The Sloman Lounge (UG). Friday 10 November 2017, 11:00-12:00 ## Segal-type models of higher categoriesSimona Paoli (University of Leicester). Computer Science, The Sloman Lounge (UG). Friday 03 November 2017, 11:00-12:00 ## Taming poultry, an attempt to use Coq for teaching mathematicians about (assisted) proofsCorneliu Hoffman (University of Birmingham). Computer Science, The Sloman Lounge (UG). Friday 27 October 2017, 11:00-12:00 ## From finitary monads to Lawvere theories: Cauchy completionsNB 217 not Sloman Lounge John Power (University of Bath). 217, School of Computer Science. Friday 20 October 2017, 11:00-12:00 ## Theoretical Computer Science in Quantum Circuit DesignAlso of interest in Security Peter Hines (University of York). Computer Science, The Sloman Lounge (UG). Friday 13 October 2017, 11:00-12:00 ## Realizability in Cyclic Proof: Extracting Ordering Information for Infinite DescentReuben Rowe (University of Kent at Canterbury). Computer Science, The Sloman Lounge (UG). Friday 06 October 2017, 11:00-12:00 ## What kind of virtual machine would be needed to simulate an ancient mathematician investigating geometry?Aaron Sloman (School of Computer Science, bham). Computer Science, The Sloman Lounge (UG). Friday 29 September 2017, 11:00-12:00 ## Deciding subtype entailmentStephen Dolan (Computer Lab, University of Cambridge). Computer Science, The Sloman Lounge (UG). Friday 16 June 2017, 11:00-12:00 ## New foundations for string diagram rewritingFabio Zanasi (UCL). Computer Science Sloman Lounge. Friday 02 June 2017, 11:00-12:00 ## Relative pseudomonadsRoom change! Nicola Gambino (University of Leeds). Friday 26 May 2017, 11:00-12:00 ## Algorithms and barriers for random instances of computational problemsWill Perkins (Dept of Mathematics, University of Birmingham). Computer Science Sloman Lounge. Friday 19 May 2017, 11:00-12:00 ## Solution of an old problem in vector optimisation: Support function of the generalised JacobianAbbas Edalat (Imperial College). Computer Science Sloman Lounge. Friday 28 April 2017, 11:00-12:00 ## A Geometry of Interaction semantics for TensorFlowDan Ghica (University of Birmingham). Computer Science Sloman Lounge. Friday 07 April 2017, 11:00-12:00 ## The frame generated by closed sublocalesAles Pultr (Charles University, Prague). Computer Science Sloman Lounge. Friday 31 March 2017, 11:00-12:00 ## Coalgebraic Dynamic LogicsClemens Kupke (University of Strathclyde). Computer Science Sloman Lounge. Friday 24 March 2017, 11:00-12:00 ## On the commutativity of the powerspace monadsMatthew de Brecht (University of Kyoto). Computer Science Sloman Lounge. Friday 17 March 2017, 11:00-12:00 ## Towards the verified compilation of LustreTimothy Bourke (Inria Paris, École Normale Supérieure). Computer Science, The Sloman Lounge (UG). Friday 10 March 2017, 11:00-12:00 ## Closure of system T under the bar recursion rulePaulo Oliva (Queen Mary, University of London). Computer Science, The Sloman Lounge (UG). Friday 24 February 2017, 11:00-12:00 ## Homotopy coherent distributive lawsNick Gurski (University of Sheffield). Computer Science Sloman Lounge. Friday 17 February 2017, 11:00-12:00 ## Functoriality of modified realizabilityRoom 245 not Sloman Lounge Peter Johnstone (DPMMS, University of Cambridge). Friday 03 February 2017, 11:00-12:00 ## Reversible System TIan Mackie (University of Sussex). Computer Science, The Sloman Lounge (UG). Friday 13 January 2017, 11:00-12:00 ## Representations for feasibly approximable functionsMichal Konečný (Aston University). Computer Science, The Sloman Lounge (UG). Friday 16 December 2016, 11:00-12:00 ## Interaction morphismsTarmo Uustalu (Institute of Cybernetics, Tallinn University of Technology). Computer Science, The Sloman Lounge (UG). Friday 02 December 2016, 11:00-12:00 ## Probabilistic ProgrammingHongseok Yang (University of Oxford). Computer Science, The Sloman Lounge (UG). Friday 25 November 2016, 11:00-12:00 ## Physical/evolutionary foundations for mathematics vs logico/semantic foundations for mathematicsAaron Sloman (University of Birmingham). Computer Science, The Sloman Lounge (UG). Friday 11 November 2016, 11:00-12:00 ## Semantic Foundations for Probabilistic ProgrammingSam Staton (University of Oxford). Computer Science, The Sloman Lounge (UG). Friday 04 November 2016, 11:00-12:00 ## A domain-theoretic approach to Brownian motion and general continuous stochastic processesPaul Bilokon. Computer Science, The Sloman Lounge (UG). Friday 21 October 2016, 11:00-12:00 ## Formalizing compositional proofsJamie Vicary (University of Oxford). Computer Science, The Sloman Lounge (UG). Friday 14 October 2016, 11:00-12:00 ## Reconciling structural and nominal syntax in the language of diagramsDan Ghica (Computer Science). Computer Science, The Sloman Lounge (UG). Friday 07 October 2016, 11:00-12:00 ## Adjunctions and Actions of Co/Cartesian CategoriesFrancisco Lobo (University of Manchester). Computer Science, The Sloman Lounge (UG). Friday 30 September 2016, 11:00-12:00 ## Dynamic games and strategiesNorihiro Yamada (Oxford). Computer Science, The Sloman Lounge (UG). Friday 20 May 2016, 11:00-12:00 ## Type Theory in Type Theory using Quotient Inductive TypesAmbrus Kaposi (Nottingham). Computer Science, The Sloman Lounge (UG). Friday 26 February 2016, 11:00-12:00 ## Enriched-adjunction models and polarisation for modelling effects and resourcesGuillaume Munch-Maccagnoni (Cambridge). Computer Science, The Sloman Lounge (UG). Friday 19 February 2016, 11:00-12:00 ## Effects as sessions, sessions as effectsDominic Orchard (Imperial). Computer Science, The Sloman Lounge (UG). Friday 12 February 2016, 11:00-12:00 ## Programming and Proving with Concurrent ResourcesIlya Sergey (UCL). Computer Science, The Sloman Lounge (UG). Friday 29 January 2016, 11:00-12:00 ## NetKAT: A FORMAL SYSTEM FOR THE VERIFICATION OF NETWORKSAlexandra Silva (UCL). Friday 15 January 2016, 11:00-12:00 ## Structural Resolution meets Curry-HowardEkaterina Komendantskaya (Dundee). Friday 06 November 2015, 13:00-14:00 ## Improving proof compression by better controlling cut and sharingPaola Bruscoli (Bath). Friday 16 October 2015, 15:00-16:00 ## On the Forwarding Paths Produced by Internet Routing AlgorithmsTimothy Griffin (Cambridge). Friday 25 September 2015, 13:00-14:00 ## Strong Complementarity in Quantum ComputingRoss Duncan (University of Strathclyde). Friday 18 September 2015, 14:00-15:00 ## The recursion hierarchy for PCF is strictJohn Longley (Edinburgh). Tuesday 08 September 2015, 11:00-13:00 ## Diagrammatic mathematics and signal flow graphsPawel Sobocinski (Southampton). Friday 04 September 2015, 15:00-16:00 ## FreshMLTT: Dependent Type Theory with Names and Name-AbstractionAndy Pitts (University of Cambridge). Friday 08 May 2015, 16:00-17:00 ## Coeffects: Context-aware programming languagesTomas Petricek (University of Cambridge). Friday 20 March 2015, 16:00-17:00 ## Automata over infinite alphabetsNikos Tzevelekos (Queen Mary University). Friday 27 February 2015, 16:00-17:00 ## Worldly Type SystemsConor McBride (University of Strathclyde). Friday 06 February 2015, 16:00-17:00 ## On Cubes and TypesThorsten Altenkirch (University of Nottingham). Friday 30 January 2015, 16:00-17:00 ## Cohomology of Contextuality and Logical ParadoxesKohei Kishida, University of Oxford. Friday 23 January 2015, 16:00-17:00 ## Innocent Strategies are Sheaves over PlaysTakeshi Tsukada (University of Oxford). Friday 12 December 2014, 12:00-13:00 ## A bridge between semiringsFlavien Breuvart, PPS, University of Paris 7. Friday 21 March 2014, 16:00-17:00 ## Update monads: cointerpreting directed containersTarmo Uustalu, Tallinn University of Technology. Friday 14 March 2014, 14:00-15:00 ## An introduction to overt subspaces of R^nPaul Taylor, University of Birmingham. Thursday 16 January 2014, 16:00-17:00 ## General Purpose Programming with Dependent TypesEdwin Brady, University of St Andrews. Friday 10 January 2014, 16:00-17:00 ## The dual of pattern matching - copattern matchingAnton Setzer, Swansea University. Friday 22 November 2013, 16:00-17:00 ## Two extensions of Reynolds' Relational Parametricity: Classical Mechanics and Dependent TypesBob Atkey. Friday 08 November 2013, 16:00-17:00 ## Product representation of default bilatticesHilary Priestley, University of Oxford. Friday 01 November 2013, 16:00-17:00 ## Parametric completeness for separation theories (via hybrid logic)James Brotherston, University College London. Friday 18 October 2013, 16:00-17:00 ## Reflection in sheaf modelsMichael Fourman, University of Edinburgh. Thursday 04 July 2013, 14:00-15:00 ## Graphical Foundations for Dialogue GamesCai Wingfield, University of Bath. Friday 17 May 2013, 16:00-17:00 ## Concurrent Games with SymmetryJoint Theory Seminar / Lab Lunch Pierre Clairambault, University of Cambridge. Tuesday 23 April 2013, 11:00-12:00 ## Fibrational parametricityNeil Ghani, University of Strathclyde. Thursday 18 April 2013, 10:00-11:00 ## The Ramifications of Sharing in Data StructuresJules Villard, UCL. Friday 15 March 2013, 16:00-17:00 ## Decision problems for linear recurrence sequencesJames Worrell, University of Oxford. Friday 01 February 2013, 16:00-17:00 ## Frank, a direct style language with typed effectsConor McBride, University of Strathclyde. Friday 11 January 2013, 16:00-17:00 ## Compositional algebras of C/E and P/T netsPawel Sobocinski, University of Southampton. Friday 30 November 2012, 16:00-17:00 ## Agent programming languagesNatasha Alechina, University of Nottingham. Friday 16 November 2012, 16:00-17:00 ## Concurrent Computational Interpretation of Dummett's Axiom and PrelinearityYoichi Hirai, University of Tokyo. Monday 27 August 2012, 11:00-12:00 ## A Voyage to the Deep-HeapDino Distefano, Queen Mary, University of London. Friday 10 August 2012, 16:00-17:00 ## Forcing, effects and continuityMartin Escardo, University of Birmingham. Friday 03 August 2012, 16:00-17:00 ## The value of the two valuesJoão Marcos, Universidade Federal do Rio Grande do Norte. Wednesday 18 July 2012, 16:00-17:00 ## Analysing PCF and Kleene computability via sequential proceduresJohn Longley, University of Edinburgh. Friday 06 July 2012, 16:00-17:00 ## Modes of Bar RecursionTom Powell, Queen Mary, University of London. Tuesday 03 July 2012, 16:00-17:00 ## Geometric constructions for (op)fibrationsBertfried Fauser, University of Birmingham. Friday 22 June 2012, 16:00-17:00 ## Linear dependent types: Complexity of PCF term evaluation.Joint Theory Seminar and Lab Lunch Barbara Petit, Università di Bologna. Monday 11 June 2012, 14:00-15:00 ## Multiparty session types and distributed systemsNobuko Yoshida, Imperial College London. Friday 01 June 2012, 16:00-17:00 ## A Saturation Method for Collapsible Pushdown SystemsJoint Theory Seminar and Lab Lunch Matthew Hague, Université Paris-Est. Tuesday 29 May 2012, 12:00-13:00 ## Measuring progress of probabilistic model-checkersFranck van Breugel, York University, Toronto. Thursday 05 April 2012, 16:00-17:00 ## Parameterized algebraic theories and computational effectsSam Staton, University of Cambridge. Friday 09 March 2012, 16:00-17:00 ## Automata and logics on structures with dataRanko Lazic, University of Warwick. Friday 24 February 2012, 16:00-17:00 ## Observations about definability in an abstract datatype of real numbersAlex Simpson, University of Edinburgh. Friday 03 February 2012, 13:00-14:00 ## Topological dualities for distributive meet-semilattices, implicative semilattices and Hilbert algebrasRamon Jansana, University of Barcelona. Friday 20 January 2012, 16:00-17:00 ## Constructing Differential Categories and Deconstructing Categories of GamesGuy McCusker, University of Bath. Friday 13 January 2012, 16:00-17:00 ## Suszko's Thesis and ExtensionalityMatteo Bianchetti, University of St Andrews. Friday 09 December 2011, 16:00-17:00 ## The language X: term rewriting, continuations and classical types, and the impossibility of filter semanticsSteffen van Bakel, Imperial College London. Friday 25 November 2011, 16:00-17:00 ## Induction and Coinduction in fibrationsClément Fumex, University of Strathclyde. Friday 18 November 2011, 16:00-17:00 ## How To Be More ProductiveGraham Hutton, University of Nottingham. Friday 11 November 2011, 16:00-17:00 ## Inductive-inductive definitions: axiomatisation and categorical semanticsFredrik Nordvall Forsberg, Swansea University. Friday 28 October 2011, 16:00-17:00 ## Understanding Multi-core ConcurrencyScott Owens, University of Cambridge. Friday 21 October 2011, 16:00-17:00 ## Towards a Categorical Foundation for Generic ProgrammingRalf Hinze, University of Oxford. Tuesday 18 October 2011, 13:00-14:00 ## Are all substitutions invertible; are all monoids groups?Murdoch Gabbay, Heriot-Watt University. Friday 23 September 2011, 13:00-14:00 ## Towards a localic proof of the localic groupoid representation of Grothendieck toposesChristopher Townsend. Friday 02 September 2011, 16:00-17:00 ## Imperative Programs as Proofs via Game SemanticsMartin Churchill, University of Bath. Friday 08 July 2011, 16:00-17:00 ## Towards a Geometry of Interaction for Polarized Linear LogicPhil Scott, University of Ottawa. Friday 01 July 2011, 16:00-17:00 ## Algebraic Foundations for Type and Effect AnalysisOhad Kammar, University of Edinburgh. Thursday 23 June 2011, 14:00-15:00 ## From Containers to Induction RecursionNeil Ghani, University of Strathclyde. Friday 03 June 2011, 16:00-17:00 ## A Categorical Compositional Distributional Model of Meaning and some Supporting ExperimentsMehrnoosh Sadrzadeh, University of Oxford. Friday 20 May 2011, 16:00-17:00 ## Verification of Quantum MechanicsElham Kashefi, University of Edinburgh. Friday 06 May 2011, 16:00-17:00 ## Energy as SyntaxJoint Theory/School Seminar Vincent Danos, University of Edinburgh. Thursday 05 May 2011, 16:00-17:00 ## Systems and Security Modelling: From Theory to Practice (Really)David Pym, University of Aberdeen. Friday 18 March 2011, 16:00-17:00 ## Automatic program analysis for overlaid data structuresHongseok Yang, Queen Mary, University of London. Friday 11 March 2011, 16:00-17:00 ## Approximating Labelled Markov Processes by AveragingPrakash Panangaden, University of Oxford, on leave from McGill University (Montreal). Friday 04 March 2011, 16:00-17:00 ## Ultrametric Semantics of Reactive ProgramsNeel Krishnaswami, Microsoft Research Cambridge. Friday 25 February 2011, 16:00-17:00 ## Permissive-Nominal LogicMurdoch Gabbay, Heriot-Watt University. Friday 18 February 2011, 16:00-17:00 ## Adventures in XML UpdatesJames Cheney, University of Edinburgh. Friday 04 February 2011, 16:00-17:00 ## Abstraction and Refinement for Local ReasoningThomas Dinsdale-Young, Imperial College London. Friday 28 January 2011, 16:00-17:00 ## Formalizing Domains, Ultrametric Spaces and Semantics of Programming LanguagesNick Benton, Microsoft Research Cambridge. Friday 21 January 2011, 16:00-17:00 ## A topos-theoretic approach to Stone-type dualitiesOlivia Caramello, University of Cambridge. Friday 10 December 2010, 16:00-17:00 ## Information carriers in biomolecular networksVincent Danos, University of Edinburgh. Friday 03 December 2010, 16:00-17:00 ## Solving corecursive equationsVenanzio Capretta, University of Nottingham. Friday 19 November 2010, 16:00-17:00 ## Isomorphism of types in presence of higher-order storePierre Clairambault, University of Bath. Friday 12 November 2010, 16:00-17:00 ## Fully Homomorphic EncryptionNigel Smart, University of Bristol. Friday 05 November 2010, 16:00-17:00 ## Concurrent Games on Partial OrdersJulian Gutierrez, University of Edinburgh. Friday 29 October 2010, 16:00-17:00 ## Multicategories, unwirability and gamesNathan Bowler, University of Cambridge. Friday 15 October 2010, 16:00-17:00 ## Display Calculus for Bunched LogicJames Brotherston, Imperial College London. Friday 24 September 2010, 14:00-15:00 ## Understanding Game Semantics through Coherence SpacesAna Calderon, University of Bath. Friday 27 August 2010, 14:00-15:00 ## Local Action Traces and Abstract Concurrent Separation LogicSteve Brookes, Carnegie Mellon University and Queen Mary, University of London. Friday 23 July 2010, 14:00-15:00 ## Program extraction from proofs using classical dependent choiceMonika Seisenberger, University of Swansea. Thursday 22 July 2010, 10:00-11:00 ## Bilattices: an algebraic (logic) perspectiveUmberto Rivieccio, University of Genoa. Friday 02 July 2010, 14:00-15:00 ## When exactly is Scott sober?Weng Kin Ho, National Institute of Education, Singapore. Friday 18 June 2010, 14:00-15:00 ## A coalgebraic approach to term graphsRichard Garner, University of Cambridge. Friday 04 June 2010, 14:00-15:00 ## Verification of Windows Device DriversSamin Ishtiaq, Microsoft Research Cambridge. Friday 14 May 2010, 14:00-15:00 ## A Fibrational Induction Rule for Inductive TypesPatricia Johann, University of Strathclyde. Tuesday 04 May 2010, 13:00-14:00 ## Metric Spaces, Abstract Interpretation and Termination AnalysisAziem Chawdhary, University of Durham. Friday 30 April 2010, 16:00-17:00 ## Universal algebra over nominal setsDaniela Petrisan, University of Leicester. Friday 12 March 2010, 14:00-15:00 ## Automatic Analysis of Scratch-pad Memory Code for Heterogeneous Multicore ProcessorsAlastair Donaldson, University of Oxford. Friday 05 March 2010, 14:00-15:00 ## The Continuous π-Calculus: A Process Algebra for Biochemical ModellingIan Stark, University of Edinburgh. Friday 26 February 2010, 14:00-15:00 ## Reconstructing the SECD machineMike Spivey, University of Oxford. Friday 19 February 2010, 14:00-15:00 ## A Demonic Approach to Information in Probabilistic SystemsJosée Desharnais, Université Laval (Quebec). Friday 12 February 2010, 14:00-15:00 ## A topos-theoretic approach to non-commutative topologyChris Heunen, University of Oxford. Friday 22 January 2010, 14:00-15:00 ## A Unifying Analytical Framework for Discrete Linear TimeJoint Theory/Departmental Seminar Ben Moszkowski, De Montfort University, Leicester. Thursday 21 January 2010, 16:00-17:00 ## Complex numbers and categorical structuresJamie Vicary, University of Oxford. Friday 15 January 2010, 14:00-15:00 ## Linearly-used Continuations and Self-dualityAlex Simpson, University of Edinburgh. Thursday 17 December 2009, 14:00-15:00 ## Realisability for Coinduction with Applications in Computable AnalysisUlrich Berger, University of Swansea. Friday 11 December 2009, 14:00-15:00 ## First-Order Reasoning about Higher-Order ConcurrencyVasileios Koutavas, Trinity College Dublin. Friday 04 December 2009, 14:00-15:00 ## A process algebra for the modelling of hybrid systemsVashti Galpin, University of Edinburgh. Friday 27 November 2009, 14:00-15:00 ## Branching vs Linear Time: Semantical PerspectiveMoshe Y. Vardi, Rice University. Friday 13 November 2009, 14:00-15:00 ## Path-Based Coalgebraic Temporal LogicsCorina Cirstea, University of Southampton. Friday 06 November 2009, 14:00-15:00 ## Providing a Fiction of Disjoint ConcurrencyMike Dodds, University of Cambridge. Friday 16 October 2009, 14:00-15:00 ## Distributive Laws in Programming StructuresOndrej Rypacek, University of Nottingham. Friday 09 October 2009, 14:00-15:00 ## Relative monadsTarmo Uustalu, Tallinn University of Technology. Friday 18 September 2009, 14:00-15:00 ## Focusing on Binding and ComputationDan Licata, Carnegie Mellon University. Monday 07 September 2009, 14:00-15:00 If you have a question about this list, please contact: Jamie Vicary; Noam Zeilberger; Benedikt Ahrens; Miriam Backens; Martin Escardo; Achim Jung; Paul Levy; David Parker; Uday Reddy; Eike Ritter; Dr Anupam Das; Dan Ghica; Nicolai Kraus; Rajesh Chitnis; Vincent Rahli. If you have a question about a specific talk, click on that talk to find its organiser. |
## Other listsBritGrav 15 Type the title of a new list here Astrophysics Seminars## Other talksMulti-dimensional vector assignment problems (MVA) : Complexity, Approximation and Algorithms Weak universalities for some singular stochastic PDEs School Seminar Physics at van der Waals interfaces: Twists, incommensurability and emergent phenomena Hydrodynamics and Chaos in Quantum Matter School Seminar |