Dominic Mulligan

Name:	Dominic Mulligan
Affiliation:	University of Cambridge
E-mail:	(only provided to users who are logged into talks.cam)
Last login:	8 Jan 2020, 1:32 p.m.

Public lists managed by Dominic Mulligan

Talks given by Dominic Mulligan

Obviously this only lists talks that are listed through talks.cam. Furthermore, this facility only works if the speaker's e-mail was specified in a talk. Most talks have not done this.

Talks organised by Dominic Mulligan

This list is based on what was entered into the 'organiser' field in a talk. It may not mean that Dominic Mulligan actually organised the talk, they may have been responsible only for entering the talk into the talks.cam system.

• On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control
• Designing Verifiable Cache Coherence Protocols
• Event Correlation with Algebraic Effects
• A promising semantics for relaxed-memory concurrency
• Semantics of Full Ground References
• Applications of Finite Model Theory in Graph Isomorphism Testing and Propositional Proof Complexity
• Interleaved scope for games and automata
• Title to be confirmed
• Syntax and Handlers for Operations with Scopes
• Disjoint Semirings for Fractional Permissions
• Concurrent Kleene Algebras and Pomset Languages
• What does the Future of Programming Look Like?
• Higher Categorical Structures, Type-Theoretically
• Monads and Lenses
• Diagrammatic Operational Semantics for Digital Circuits
• Verified Characteristic Formulae for CakeML
• A monad for full ground reference cells
• Genus, Numerics and Architectural Level Optimisation
• One-Dimensional Higher Inductive Types
• Polymorphism, subtyping and type inference in MLsub
• A categorical perspective on type refinement systems
• Cantor meets Scott: Domain-Theoretic Foundations for Probabilistic Network Programming
• A compositional account of Herbrand's theorem via concurrent games
• Fencing off Go: Liveness and Safety for Channel-based Programming
• Context Equivalences and Metrics in Probabilistic Lambda-Calculi
• An Algebraic Combinatorial Approach to the Abstract Syntax of Opetopic Structures
• On Proofs of Equality as Paths
• Analysing Goedel’s T by means of ordinal assignment and collapsing
• Making Reactive Programs Function
• A new verified compiler backend for CakeML
• Classical Linear Logic considered as a programming language
• Learning regular languages over infinite alphabets
• A Verified CompCert Front-End for a Memory Model supporting Pointer Arithmetic and Uninitialised Data
• Practical Statically-checked Deterministic Parallelism
• Automatically comparing memory consistency models
• Programming and Proving with Concurrent Resources
• Optimising star-convex functions
• Automated Reasoning and AI for Large Formal Mathematics
• Certified automated theorem proving for types
• The C standard formalized in Coq, what's next?
• A rational reconstruction of homogeneous meta-programming
• Giry and the Machine
• Logical dependence via functional dependence
• Generating Gradual Typing Systems with the Gradualizer