Conversation

Now playing with some declarative typing rules for Martin-Löf type theory in Makam! Finally starting to get my head around why they are defined the way they are, I think? Not sure if I want to use explicit substitutions yet, hence the commented out declarations… 🤔
Image
1
1
I'm _thinking_ that these general rules mean that you don't have to write as many duplicated rules for things like booleans. For example if we write an elimination rule with the eliminator on the left, we get the one on the right for free, thanks to the symmetry rules:
Image
1