nprofile1qyt8wumn8ghj7un9d3shjtnyd968gmewwp6kytcqyzf5l64n2xk9azdrt6c96nwshexx45v4sduj7cyakmw005afuu05jm4rrqe (nprofile…rrqe) Here's a thought for definitionally irrelevant propositions which have good support for unification: use a phase distinction!
Specifically, there is a phase distinction for refinement types whose open modality erases the refinement. If the typing judgment is "open-modal" with respect to this, then during conversion checking anything that is purely closed-modal can be treated as a singleton.
Then, you can have a universe of propositions SProp for which El P is always closed-modal and so definitional proof-irrelevance for El P doesn't mess with unification at all.
The problem, of course, is that (following up from a recent toot) a function
(1/-) : { x : R | x != 0 } -> R
must in fact be defined on all of R in the base type theory... So this doesn't do everything that one might wish for from strict propositions, but perhaps this is still an improvement.
I think the trick would be to figure out the right interaction between SProp and Prop; I will think about this a bit but perhaps you already have some ideas.