Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

There is a paper on The Implicit Calculus as a generalization of type classes. Coq's canonical structures are also a generalization of type classes. The paper does not mention canonical structures however. The approaches seem quite similar. What are the commonalities and differences of these two approaches to generalize type classes?

share|cite|improve this question
I have informed the authors, who are not on cstheory. They will respond. – Vijay D Jan 9 '13 at 19:29
Thanks! That is great. – Jules Jan 11 '13 at 10:29

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.