Formal proof of coherence for elaboration-based type class resolution via a two-step strategy using logical relations to preserve contextual equivalence.
We do this by showing that e0 − →∗ e ′ 0
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Coherence of Type Class Resolution
Formal proof of coherence for elaboration-based type class resolution via a two-step strategy using logical relations to preserve contextual equivalence.