The lax slice bicategory is like the slice category, but rather than a commuting triangle you get a 2-cell.
This is my first time using Agda in earnest so I am not very adept at using the module system, so some code review would help here for sure. I'm not really sure if I got the naming conventions right. I based most of the naming on the slice 1-category.
Some caveats
I still have two spots of yellow in Emacs when I type check on Line 310. I'm not sure how to debug this.
Type checking at least while it was incomplete became very slow. When I was working on the unitors I had to comment out the associator proofs to speed things up. Not sure what the best practice is for mitigating this. Should I break it up into multiple files? Maybe move the SliceHom module into a different file.
The proofs sometimes had several lines in a row of associativity, is there a simpler way to do this? A reflective free category solver maybe?
One proof (inverse of the right unitor) is a copy-paste-rename of the proof for the inverse of the left unitor. This should probably be a lemma instead.
The lax slice bicategory is like the slice category, but rather than a commuting triangle you get a 2-cell.
This is my first time using Agda in earnest so I am not very adept at using the module system, so some code review would help here for sure. I'm not really sure if I got the naming conventions right. I based most of the naming on the slice 1-category.
Some caveats