Update README

README.md

@@ -4,26 +4,42 @@ This repository contains accompanying code for my (upcoming) Bachelor's thesis.
 
 Weak timeline :
 
+Upto November 2023:
+
 - [x] Combinatory Algebras
   - [x] Applicative Structures
   - [x] Feferman structure on an AS
   - [x] Combinatorial completeness
   - [ ] Computation rule for $\lambda*$
   - Combinators
     - [x] Identity, booleans, if-then-else, pairs, projections, B combinator, some Curry numerals
-    - [ ] Computation rule for pairs 
+    - [x] Computation rule for pairs 
     - [ ] Fixpoint combinators and primitive recursion combinator
 - [x] Category of Assemblies
   - [x] Define assemblies
   - [x] Define the category $\mathsf{Asm}$
   - [x] Cartesian closure and similar structure
     - [x] Binary products
     - [x] Binary coproducts
-      - [ ] Universal property
+      - [x] Universal property
     - [x] Equalisers
     - [x] Exponentials
     - [x] Initial and terminal objects
+    - [x] Coequalisers (December 2023)
+
+December 2023:
+
 - [ ] $\mathsf{Asm}$ is regular
+    - [x] Kernel pairs of morphisms exist
+    - [x] Kernel pairs have coequalisers
+    - [ ] Regular epics stable under pullback
+- [ ] Exact completion
+    - [x] Internal equivalence relations of a category
+    - [ ] Functional relations
+
+# Writing
+
+There are some notes relating to the project on my [abstract non-sense](https://github.com/rahulc29/abstract-nonsense) repository.
 
 # Build Instructions