Nathanael Arkor
| Name: | Nathanael Arkor |
| Affiliation: | University of Cambridge |
| E-mail: | (only provided to users who are logged into talks.cam) |
| Last login: | 27 Oct 2021, 1:57 p.m. |
Public lists managed by Nathanael Arkor
Talks given by Nathanael Arkor
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.
- The formal theory of theories
- Higher-order algebraic theories and relative monads
- Categorical models of dependent type theory II
- Categorical models of dependent type theory
- Karoubi envelopes, semifunctors, and the extensional lambda calculus
- Lawvere theories and finitary monads
- Horizontal & vertical categorification: from monoids to bicategories
- Internal categories, generalised multicategories and operads
Talks organised by Nathanael Arkor
This list is based on what was entered into the 'organiser' field in a talk. It may not mean that Nathanael Arkor actually organised the talk, they may have been responsible only for entering the talk into the talks.cam system.
- The formal theory of theories
- A modular approach to formalising combinatorial structures
- Proof Synthesis with Free Extensions in Intensional Type Theory
- Quotient inductive types and QW types: part II
- Quotient inductive types and QW types
- Markov categories: towards a syntax for probability
- Semantics of monad transformers
- Higher-order algebraic theories and relative monads
- Semantics of monad transformers
- Categorical models of dependent type theory II
- Categorical models of dependent type theory
- Karoubi envelopes, semifunctors, and the extensional lambda calculus
- Indexed containers and initial algebras for polynomial endofunctors
- Modalities and HoTT
- Distributive Iaws 2: Monadic Boogaloo
- Distributive laws
- Presheaves seen as freely added colimits: an algorithmic approach
- Presheaves and free cocompletion (part 2)
- Presheaves and free cocompletion
- Goodwillie Calculus
- Ends and coends (AKA "Cowedges: Endgame")
- A Galois connection for operations and relations
- Lawvere theories and finitary monads
- An introduction to Martin-Lรถf Type Theory
- Horizontal & vertical categorification: from monoids to bicategories
- Applicative functors
- Programming with monads and graded monads
- Call-by-push-value
- Internal categories, generalised multicategories and operads
- Linear Logic and Quantum Programming
- Monadic modalities
- Dataflow languages and the semantics of context-dependent programming
- Moggi's Monads
- Introduction to string diagrams
- Agda: a practical tutorial
- Introduction to game semantics for programming languages
- Dependent type theory and the univalence axiom
![[Talks.cam]](/static/images/talkslogosmall.gif)
