Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
In the page dependent sum type, the presented “term introduction rule” seems not really dependent, since the typing derivation of the second element is not aware of the first. I would expect which corresponds to what is presented in the text on positive and negative versions.
I guess they meant
which I think is basically the right idea. But that’s not the usual rule either, since it doesn’t allow you to construct pairs in the empty context, unless you have a primitive substitution rule.
So the usual rule uses an arbitrary term of :
This is the same as what you wrote, but with different notation.
But what they meant looks wrong to me, since it does not allow to introduce any pair which first element is not a variable, for instance to prove .
Right, that’s why you’d need a substitution rule:
So combining this with the variables-only pairing rule (, , , , ) we get:
This is sufficiently general, since need not be free in . (And there’s actually no reason for to be free in when you just immediately substitute, since both and are provided together. What you really want is for to be free in , of course.)
I think we should give the usual rule, as in #2. Anyone who wants to fix it, please do!
Now I’m not sure anymore. The argument I gave justifies:
But having to prove generically, rather than just sounds harder, so maybe the rule is still too weak? Oh right, I guess it must be: what if is and is ?
Yeah OK, it looks like requiring a variable was a red herring; the problem was that the premise isn’t depending on a specific term, like GuiGeek originally said.
So the diagram next to the bad intro rule seems misleading: that arrow doesn’t have to be a context projection.
Yes, looks good. Thanks for catching this, GuiGeek, and for fixing it, Matt!
1 to 9 of 9