|![[Search]](/images/search.gif?1209136071)
|![[A-Z Index]](/images/az.gif?1209136071)
|![[Contact]](/images/contact.gif?1209136071)
||![[University of Birmingham]](/images/identifier2.gif?1243330508){kind=small} |
![[Talks@bham]](/images/talkslogosmall.gif?1243330508) |
CS 217
Add to your list(s)
Send you e-mail reminders
Further detail
0 upcoming talks and 173 talks in the archive. The Cantor-Schröder-Bernstein Theorem for ∞-groupoids
Revisiting the relation between subspaces and sublocales
Well founded coalgebras and recursion
Proof complexity through the lens of the pigeon hole principle II
String diagrams for cartesian bicategories and their Karoubi envelopes - and entailment systems
Algorithms and Complexity through the eyes of Vertex Cover (Part 2)Part 2 of last week's talk
Algorithms and Complexity through the eyes of Vertex Cover
Internal higher-categorical models of dependent type theoryPlease contact Todd if you wish to give a talk this term!
A Brouwerian Intuitionistic Type Theory (Part 3)Please contact Todd if you wish to give a talk this term!
A Brouwerian Intuitionistic Type Theory (Part 2)First talk of the term. Please contact Todd if you wish to give a talk this term!
Transparent synchronous dataflow
A Brouwerian Intuitionistic Type Theory
The coproduct of frames as encoding d-frame structure
Denotational Semantics of Linear Logic with Least and Greatest Fixpoints
The Scott model of PCF in UniMathMartin Escardo's talk has been postponed to Friday 22, Sloman Lounge at 11.00
Higher Universal Algebra in Type Theory
Fibrations and opfibrations of generalized point-free spaces
Univalent mathematics - continued
Geometric/AU mathematics
Linear typings as flows on 3-valent graphs (part 3)
Linear typings as flows on 3-valent graphs
Some remarks on n-fibrations
A syntactic view of adequacy
Using Yoneda rather than J to present the identity type.
A sequent calculus for a semi-associative lawTime changed - sorry
Free d-frames and quotients
No formal presentation (offers welcome!)
Type theory without exponentials
Analysis in univalent type theory
Towards abductive functional programming
Fibrations of toposesNB This talk is at the theory seminar time (11.0 Friday) in the lab lunch room (217).
Locally graded categories
Locally graded categoriesNB This talk is at the theory seminar time (11.0 Friday) in the lab lunch room (217).
Dynamic Geometry of Interaction
Partial functions and recursion via dominances in univalent type theory
String diagrams for stably compact localesNB This talk is at the theory seminar time (11.0 Friday) in the lab lunch room (217).
String diagrams for stably compact locales
Commutative or monoidal monads
Can we machine-learn a programming language semantics?
Some enumerative, topological, and algebraic aspects of linear lambda calculus
Computability and recursion theory in univalent type theoryRoom as usual, despite earlier announcement
Partial functions via dominances in univalent type theoryNote that Cory's talk has been postponed a week, to 9 Feb.
Partial functions via dominances in univalent type theory
Type theoretic aspects of AU sketchesApologies for wrong announcement that it was Wednesday
A Categorical Perspective on Type Refinement Systems
Parametricity for category theory
Type theory for the arithmetic universe sketches
Title to be confirmed
Trace equivalence of well-founded processes via commutativity
A revised graph syntax from traced monoidal categories
Jung-Tix problem in sober dcpos
Possible world semantics for heap storage
Possible world semantics for heap storage
Sketches for arithmetic universes
Fibrations in Category Theory and Topology
Lightweight Cryptography for Next Generation Vehicle Electrical Architecture
Is Mathematics Parametric?
Theoretical computer science seminar NetKAT: A FORMAL SYSTEM FOR THE VERIFICATION OF NETWORKS
Liveness for programs with higher-order state
Theoretical computer science seminar Conjugate Hylomorphisms
Theoretical computer science seminar Structural Resolution meets Curry-Howard
Theoretical computer science seminar Improving proof compression by better controlling cut and sharing
Theoretical computer science seminar On the Forwarding Paths Produced by Internet Routing Algorithms
An educational proof checker
Categorical probability theory and categorical entropy
localised side-effects using binding handlers (contd)
Theoretical computer science seminar The recursion hierarchy for PCF is strict
Distribution monads, contexuality, and cohomology
Nominal techniques for variables with interleaving scopes
Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning
A continuous computational interpretation of type theories
Did Brouwer really mean the BHK interpretation?
4-valued coalgebraic modal logic - project description
Theoretical computer science seminar A link between lambda calculus and maps
A Synchronous Functional Language with Integer Clocks
Distributing the SECD machine
Syntax and Semantics of Linear Dependent Types
Reconstructing Observational Type Theory
Synthetic domain theory versus N^\infty-sets
Functional programming with effects: what works, what doesn't, how to improve
Geometric constructions preserving fibrations
Linearity and Dependent Types
Logical Relations and Parametricity: A Reynolds Programme for Category Theory and Programming Languages
M-Sets, continued
Transitition Systems Over Games
Characterizing po-monoids $S$ by completeness and injectivity of $S$-posets
When is the Kleene--Kreisel hierarchy full?
Title to be confirmed
Distributed abstract machines
A Tribute to John Reynolds II
Axiomatization using locality and free choice
Theoretical computer science seminar Concurrent Games with SymmetryJoint Theory Seminar / Lab Lunch
Abstract machines for game semantics, revisited
Geometry of Synthesis V : Pipelines
Functional Semantics of Parsing Actions, and Left Recursion Elimination as Continuation Passing
Operational semantics for signal handling
Theoretical computer science seminar Concurrent Computational Interpretation of Dummett's Axiom and Prelinearity
Theoretical computer science seminar A Voyage to the Deep-Heap
Theoretical computer science seminar Forcing, effects and continuity
Theoretical computer science seminar Modes of Bar Recursion
Theoretical computer science seminar Geometric constructions for (op)fibrations
Abstract machine semantics of regular expression matching
Linear dependent types: Complexity of PCF terms evaluationJoint Lab-Lunch and Theory Seminar
Theoretical computer science seminar Linear dependent types: Complexity of PCF term evaluation.Joint Theory Seminar and Lab Lunch
Title to be confirmedJoint Lab Lunch and Theory seminar
Theoretical computer science seminar A Saturation Method for Collapsible Pushdown SystemsJoint Theory Seminar and Lab Lunch
Call-by-push-value tutorial [part 4]
When is a Container a Comonad?
The valuation locale monad (continued)
A monad of valuation locales I : Introduction and motivation
Title to be confirmed
Clipping: A semantics-directed syntactic approximation
Selection functions, bar recursion and backward induction
If you have a question about this list, please contact: . If you have a question about a specific talk, click on that talk to find its organiser. |
Other listsCold Atoms Cond. Mat. seminar Theoretical Physics Journal Club and Group MeetingOther talksUltrafast, all-optical, and highly efficient imaging of molecular chirality Geometry of alternating projections in metric spaces with bounded curvature TBC Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems Modelling uncertainty in image analysis. Extending the Lax type operator for finite W-algebras |
Martin Escardo (School of Computer Science).
Thursday 06 February 2020, 12:00-13:00