ACT 2019

Applied Category Theory Conference

15-19 July 2019
Oxford, United Kingdom

The Applied Category Theory Conference and Adjoint School will take place at the Department of Computer Science of the University of Oxford between Monday 15 and Friday 19 July, 2019, and Monday 22 and Friday 26 July, 2019, respectively

Applied category theory is a topic of interest for a growing community of researchers, interested in studying systems of all sorts using category-theoretic tools. These systems are found in the natural sciences and social sciences, as well as in computer science, linguistics, and engineering. The background and experience of our members is as varied as the systems being studied. The goal of the ACT2019 Conference is to bring the majority of researchers in the field together and provide a platform for exposing the progress in the area. Both original research papers as well as extended abstracts of work submitted/accepted/published elsewhere will be considered. The goal of the ACT2019 School is to help grow this community by pairing ambitious young researchers together with established researchers in order to work on questions, problems, and conjectures in applied category theory.

For information on previouly held events see the ACT website,

The Adjoint Summer School will follow on 22- 26 July 2019.

Important dates

  • Applications for the Summer School: Wednesday 30 January 2019
  • Submission of contributed papers: Friday 3 May 2019
  • Acceptance/rejection notification: Friday 7 June 2019

All deadline times are Anywhere on Earth.


A list of accepted papers

  • Samson Abramsky, Rui Soares Barbosa, Martti Karvonen and Shane Mansfield. A comonadic view of simulation and quantum resources
  • John Baez and Christian Williams. Enriched Lawvere Theories for Operational Semantics
  • Nicolas Behr. Tracelets and Tracelet Analysis Of Compositional Rewriting Systems
  • Erwan Beurier, Dominique Pastor and David Spivak. Memoryless systems generate the class of all discrete systems
  • Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski and Fabio Zanasi. Graphical Resource Algebra, from Linear to Affine
  • Spencer Breiner, Blake Pollard and Eswaran Subrahmanian. NIST ACT Workshop Summary
  • Spencer Breiner, Olivier Marie-Rose, Blake Pollard and Eswaran Subrahmanian. Operadic diagnosis in hierarchical systems
  • Titouan Carette, Emmanuel Jeandel, Simon Perdrix and Renaud Vilmart. Completeness of Graphical Languages for Mixed States Quantum Mechanics
  • Bryce Clarke. Internal Lenses as Functors and Cofunctors
  • Bob Coecke. The Mathematics of Text Structure
  • Bob Coecke and Quanlong Wang. ZX-Rules for 2-qubit Clifford+T Quantum Circuits, and beyond
  • Joseph Collins and Ross Duncan. Hopf-Frobenius Algebras and a new Drinfeld Double
  • Antonin Delpeuch. A complete language for faceted dataflow programs
  • Antonin Delpeuch. Autonomization of monoidal categories
  • Alejandro Díaz-Caro and Octavio Malherbe. A categorical construction for the computational definition of vector spaces
  • Zinovy Diskin. Evolving bidirectional transformations, compositional supervised learning, and parameterized delta lenses
  • Giovanni de Felice, Konstantinos Meichanetzidis and Alexis Toumi. Montague Semantics for Lambek Pregroups
  • Brendan Fong and David Spivak. Graphical Regular Logic
  • Brendan Fong and Michael Johnson. Functorial backpropagation and symmetric lenses
  • Tobias Fritz, Paolo Perrone and Sharwin Rezagholi. The support is a morphism of monads
  • Jonathan Gallagher, Geoff Cruttwell and Ben MacAdam. Towards formalizing and extending differential programming using tangent categories
  • Richard Garner. Hypernormalisation, linear exponential monads and the Giry tricocycloid
  • Bruno Gavranovic. Learning Functors using Gradient Descent
  • Fabrizio Genovese, Alex Gryzlov, Jelle Herold, Marco Perone, Erik Post and André Videla. idris-ct: A library to do category theory in Idris
  • Neil Ghani, Clemens Kupke, Alasdair Lambert and Fredrik Nordvall Forsberg. Compositional Game Theory with Mixed Strategies: Probabilistic Open Games
  • Stefano Gogioso. Fantastic Quantum Theories and Where to Find Them
  • Micah Halter, Christine Herlihy and James Fairbanks. A Compositional Framework for Scientific Model Augmentation
  • Philip Johnson-Freyd, Jon Aytac and Geoffrey C. Hulette. Topos Semantics for a Higher-order Temporal Logic of Actions
  • Martha Lewis. Modelling hyponymy for DisCoCat
  • Bert Lindenhovius, Michael Mislove and Vladimir Zamdzhiev. Categorical Semantics for Dual Intuitionistic/Linear Recursive Types
  • Hector Miller-Bakewell. Conjecture Intuition and Verification for Diagrammatic Languages
  • John Nolan, Blake Pollard, Spencer Breiner, Dhananjay Anand and Eswaran Subrahmanian. Compositional Models for Power Systems
  • Dominique Pastor, Erwan Beurier, Andrée Ehresmann and Roger Waldeck. Interfacing biology, category theory and mathematical statistics
  • Romain Péchoux, Simon Perdrix, Mathys Rennela and Vladimir Zamdzhiev. Inductive Datatypes for Quantum Programming
  • Nicola Pinzani, Stefano Gogioso and Bob Coecke. Categorical Semantics for Time Travel
  • Maria Sarazola and Brendan Fong. A recipe for black box functors
  • David Spivak and Brendan Fong. Abelian calculi present abelian categories
  • Walter Tholen. Approximate composition
  • Stelios Tsampas, Andreas Nuyts, Dominique Devriese and Frank Piessens. A summary on categorical contextual reasoning
  • John van de Wetering. An effect-theoretic reconstruction of quantum theory
  • Ryan Wisnesky and David I. Spivak. Fast Left Kan Extensions Using the Chase - Extended Abstract
  • Vladimir Zamdzhiev. Reflecting Algebraically Compact Functors
  • Colin Zwanziger. Natural Model Semantics for Comonadic and Adjoint Modal Type Theory
  • Maaike Zwart and Dan Marsden. No-Go Theorems for Distributive Laws

  • Prospective speakers were invited to submit one (or more) of the following:

  • Original contributions of high quality work consisting of a 5-12 page extended abstract that provides sufficient evidence of results of genuine interest and enough detail to allow the program committee to assess the merits of the work. Submissions of works in progress are encouraged but must be more substantial than a research proposal.

  • Extended abstracts describing high quality work submitted/published elsewhere will also be considered, provided the work is recent and relevant to the conference. These consist of a maximum 3 page description and should include a link to a separate published paper or preprint.

  • The conference proceedings will be published in a dedicated Proceedings issue of the new Compositionality journal:

    Only "original contributions" are eligible to be published in the proceedings.

    There will be best paper award(s) and selected contributions will be awarded extended keynote slots.


    A list of Papers.

    The programme consists of the following components:

  • presentation of accepted contributed papers

  • keynote talks that are selected from the contributed papers

  • an award session for the best contributed paper(s)

  • tutorial talks

  • a business showcase

  • Poster Session / Social activity
  • Applying for the Adjoint School

      Who should apply?

      Anyone from anywhere who is interested in applying category-theoretic methods to problems outside of pure mathematics. This is emphatically not restricted to math students, but one should be comfortable working with mathematics. Knowledge of basic category-theoretic language -the definition of monoidal category for example- is encouraged.
      We will consider advanced undergraduates, PhD students, and post-docs. We ask that you commit to the full program as laid out below.

      Instructions for how to apply can be found below (above the research topic descriptions).


      To apply, please send the following by Wednesday 30 January 2019:

    • Your CV

      A document with:

    • An explanation of any relevant background you have in category theory or any of the specific projects areas
    • The date you completed or expect to complete your Ph.D and a one-sentence summary of its subject matter.
    • Order of project preference
    • To what extent can you commit to coming to Oxford (availability of funding is uncertain at this time)
    • A brief statement (~300 words) on why you are interested in the ACT2019 School.

      Some prompts:

      how can this school contribute to your research goals?

      how can this school help in your career?

    Also have sent on your behalf to a brief letter of recommendation confirming any of the following:

    • your background
    • ACT2019 School’s relevance to your research/career
    • your research experience


    For more information, contact Daniel Cicala or Jules Hedges

    Adjoint School

    All of the participants will be divided up into groups corresponding to the projects. A group will consist of several students, a senior researcher, and a TA. Between January and June, we will have a reading course devoted to building the background necessary to meaningfully participate in the projects. Specifically, two weeks are devoted to each paper from the reading list. During this two week period, everybody will read the paper and contribute to discussion in a private online chat forum. There will be a TA serving as a domain expert and moderating this discussion. In the middle of the two week period, the group corresponding to the paper will give a presentation via video conference. At the end of the two week period, this group will compose a blog entry on this background reading that will be posted to the n-category cafe.

    After all of the papers have been presented, there will be a two-week visit to Oxford University from 15-26 July 2019. The second week is solely for participants of the ACT2019 School. Groups will work together on research projects, led by the senior researchers.

    The first week of this visit is the ACT2019 Conference, where the wider applied category theory community will arrive to share new ideas and results. It is not part of the school, but there is a great deal of overlap and participation is very much encouraged. The school should prepare students to be able to follow the conference presentations to a reasonable degree.

    Research mentors and their topics

    Below is a list of the senior researchers, each of whom describes a research project that their team will pursue, as well as the background reading that will be studied between now and July 2019.

    Miriam Backens

    University of Oxford

    Simplifying quantum circuits using the ZX-calculus

    Simplifying quantum circuits using the ZX-calculus

    Description: The ZX-calculus is a graphical calculus based on the category-theoretical formulation of quantum mechanics. A complete set of graphical rewrite rules is known for the ZX-calculus, but not for quantum circuits over any universal gate set. In this project, we aim to develop new strategies for using the ZX-calculus to simplify quantum circuits.

    Background reading:
  • Matthes Amy, Jianxin Chen, Neil Ross. A finite presentation of CNOT-Dihedral. Available here.
  • Miriam Backens. The ZX-calculus is complete for stabiliser quantum mechanics. Available here.

  • Tobias Fritz

    Perimeter Institute for Theoretical Physics

    Partial evaluations, the bar construction, and second-order stochastic dominance

    Partial evaluations, the bar construction, and second-order stochastic dominance

    Description: We all know that 2+2+1+1 evaluates to 6. A less familiar notion is that it can *partially evaluate* to 5+1. In this project, we aim to study the compositional structure of partial evaluation in terms of monads and the bar construction and see what this has to do with financial risk via second-order stochastic dominance.

    Background reading:
  • Tobias Fritz, Paolo Perrone. Monads, partial evaluations, and rewriting. Available here.
  • Maria Manuel Clementino, Dirk Hofmann, George Janelidze. The monads of classical algebra are seldom weakly cartesian. Available here.
  • Todd Trimble. On the bar construction. Available here.

  • Pieter Hofstra

    University of Ottawa

    Complexity classes, computation, and Turing categories

    Complexity classes, computation, and Turing categories

    Description: Turing categories form a categorical setting for studying computability without bias towards any particular model of computation. It is not currently clear, however, that Turing categories are useful to study practical aspects of computation such as complexity. This project revolves around the systematic study of step-based computation in the form of stack-machines, the resulting Turing categories, and complexity classes. This will involve a study of the interplay between traced monoidal structure and computation. We will explore the idea of stack machines qua programming languages, investigate the expressive power, and tie this to complexity theory. We will also consider questions such as the following: can we characterize Turing categories arising from stack machines? Is there an initial such category? How does this structure relate to other categorical structures associated with computability?

    Background reading:
  • J.R.B. Cockett, P.J.W. Hofstra. Introduction to Turing categories. APAL, Vol 156, pp 183-209, 2008. Available here.
  • J.R.B. Cockett, P.J.W. Hofstra, P. Hrubes. Total maps of Turing categories. ENTCS (Proc. of MFPS XXX), pp 129-146, 2014. Available here.
  • A. Joyal, R. Street, D. Verity. Traced monoidal categories. Mat. Proc. Cam. Phil. Soc. 3, pp. 447-468, 1996. Available here.

  • Bartosz Milewski


    Traversal optics and profunctors

    Traversal optics and profunctors

    Description: In functional programming, optics are ways to zoom into a specific part of a given data type and mutate it. Optics come in many flavors such as lenses and prisms and there is a well-studied categorical viewpoint, known as profunctor optics. Of all the optic types, only the traversal has resisted a derivation from first principles into a profunctor description. This project aims to do just this.

    Background reading:
  • Bartosz Milewski. Profunctor optics, categorical View. Available here.
  • Craig Pastro, Ross Street. Doubles for monoidal categories. Available here.

  • Mehrnoosh Sadrzadeh

    Queen Mary University London

    Formal and experimental methods to reason about dialogue and discourse using categorical models of vector spaces

    Formal and experimental methods to reason about dialogue and discourse using categorical models of vector spaces

    Description: Distributional semantics argues that meanings of words can be represented by the frequency of their co-occurrences in context. A model extending distributional semantics from words to sentences has a categorical interpretation via Lambek's syntactic calculus or pregroups. In this project, we intend to further extend this model to reason about dialogue and discourse utterances where people interrupt each other, there are references that need to be resolved, disfluencies, pauses, and corrections. Additionally, we would like to design experiments and run toy models to verify predictions of the developed models.

    Background reading:
  • Gerhard Jager. A multi-modal analysis of anaphora and ellipsis. Available here.
  • Matthew Purver, Ronnie Cann, Ruth Kempson. Grammars as parsers: Meeting the dialogue challenge. Available here.

  • David Spivak


    Toward a mathematical foundation for autopoiesis

    Toward a mathematical foundation for autopoiesis

    Description: An autopoietic organization-anything from a living animal to a political party to a football team-is a system that is responsible for adapting and changing itself, so as to persist as events unfold. We want to develop mathematical abstractions that are suitable to found a scientific study of autopoietic organizations. To do this, we'll begin by using behavioral mereology and graphical logic to frame a discussion of autopoeisis, most of all what it is and how it can be best conceived. We do not expect to complete this ambitious objective; we hope only to make progress toward it.

    Background reading:
  • Fong, Myers, Spivak. Behavioral mereology. Available here.
  • Fong, Spivak. Graphical regular logic. Available here.
  • Luhmann. Organization and Decision, CUP. (preface)

  • Registration

    Please register here, before 9th July 2019.


    Local information

    Oxford is the home of the oldest university in the English speaking world, and boasts many tourist attractions. It is easily reached from London's international Heathrow airport via the so-called airline bus service. For more information see these travel directions.

    Oxford has a wide range of places to stay, including college accommodation, private rooms and flats, or short term properties to share, and many bed and breakfasts (B&Bs) and guest houses. Particularly well located B&Bs are Cotswolds, Rewley House, Linton Lodge, Parklands and Galaxie Hotel. Please contact Destiny Chen should you need further information. Demand for accommodation in Oxford is high, so the rule of thumb is to book a place as soon as possible. In terms of areas, Central/North Oxford and Jericho are the closest to the workshop venue, then along Botley Road, Abingdon Road, Cowley Road (the multicultural downtown of Oxford), Iffley Road, and Wolvercote.

    The workshop will be held in Lecture Theatre B of the Department of Computer Science.

    Oxford hosts many tourist attractions and events. For example, you could complete your Oxford experience by seeing a Shakespeare play outdoors.


    ACT 2019 is sponsored by:


    kindly sponsored a speaker's childcare throughout the conference.