University of Nottingham, School of Computer Science, Office A06
I am a PhD student of
Functional Programming Laboratory
(School of Computer Science, University of Nottingham).
My main interests are Homotopy Type Theory and related subjects.
Feel free to contact me:
ngk at cs.nott.ac.uk
Some of my work (in reversed chronological order)
Any comments are highly appreciated.
On the Hierarchy of Univalent Universes: U(n) is not n-Truncated
With Christian Sattler.
We show that, assuming a hierarchy U(0), U(1), U(2), ... of univalent universes, the universe U(n) is not n-truncated (without using HITs). Further, if we restrict U(n) to n-types, it is a "strict" n+1-type. We also define a notion of n-connectedness that does not make use of HITs and show how to construct the n-connected version of a type.
Generalizations of Hedberg’s Theorem [pdf preprint][formalization (html)][HoTT blog post]
With Martin Escardo, Thierry Coquand and Thorsten Altenkirch. TLCA 2013.
Hedberg's Theorem states that a type with decidable equality has unique identity proofs. This statement is strengthened in several ways. The blog post only contains a small part of the contents, while the Agda file includes additional thoughts. The final publication is available at
Generalizations of Hedberg's Theorem [slides]
My talk at TLCA in Eidhoven, June 2013.
I have given a similar talk with the same title at the FP Away Day in Buxton, June 2013 (the original slides are on the event homepage).
Universe n is not an n-Type
Talk at the Univalent Foundations Program at the IAS in Princeton, April 2013. No slides available, but there are some notes to the talk on the UF-wiki.
Homotopy Type Theory and Hedberg's Theorem [slides]
Talk for my visit in Birmingham, November 2012. Contains generalizations of the theorem, based on joint work with T. Altenkirch, T. Coquand, M. Escardo. Abstract.
On Hedberg's theorem: Proving and Painting [slides]
My talk for the FP Away
Day 2012 in Hathersage. An attempt to provide some more intuition for HoTT, together with Hedberg's theorem as an application.
Equality in the Dependently Typed Lambda Calculus: An Introduction to
Homotopy Type Theory [slides]
Talk at Computing 2011,
Homotopy Type Theory [slides]
Talk for the FP Away
Day 2011 in Buxton - just a presentation of very basic ideas and intuition.
A Lambda Term Representation Inspired by Linear Ordered Logic [slides]
My talk at the workshop LFMTP in Nijmegen, August 2011.
Other Drafts, Notes, Miscellaneous Contents
Everything that is marked as "draft" is fairly incomplete. The converse is not necessarily true.
Some Families of Categories with Propositional Hom-Sets
A list defining complete partial orders, Heyting algebras and so on in terms of categories, to make up for my memory.
Setoids are not an LCCC
With Thorsten Altenkirch. A short proof of the well-known fact that neither the category of small groupoids nor its full subcategory of setoids is locally cartesian closed.
Notes on Yoneda Groupoids, the Construction of their Higher Quotients, and the Root of Equality (draft)
My Yoneda Groupoids are special weak omega groupoids that have a simple and short formalization.
First Year Report, extended version
The shorter version of my report is an abridged version of the extended one. Mainly those contents that are not central to HoTT are left out.
A direct proof of Hedberg's theorem in Coq, see also my post on the HoTT blog
Hedberg's theorem states that decidability of equality implies
UIP. Reading through the original proof, I noticed that this can be done
more directly, using that "decidable equality" looks literally
similar to "contractible". There is also a slight improvement,
namely "local decidability implies local UIP".
On String Rewriting Systems (draft)
Unfinished draft, joint work with Christian Sattler. We define a translation for non-confluent String Rewriting Systems systems,
enabling us to normalize derivation sequences to some extent.
Homotopy Type Theory - An overview
My introduction to HoTT (also the main part of my first year report).
A Lambda Term Representation Inspired by Linear
Together with Andreas Abel.
Current teaching assistance: Introduction to Formal Reasoning
You can find the Coq files we have discussed in the tutorials below.
Last update: November 2013