Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] one rule of dependent matching / implementing dependent types

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] one rule of dependent matching / implementing dependent types


Chronological Thread 
  • From: t x <txrev319 AT gmail.com>
  • To: Adam Chlipala <adamc AT csail.mit.edu>
  • Cc: coq-club <coq-club AT inria.fr>
  • Subject: Re: [Coq-Club] one rule of dependent matching / implementing dependent types
  • Date: Wed, 16 Oct 2013 13:15:43 -0700



Now, assuming it's (c), where can I read up on the mathematical foundations of this? [I've looked through chapters in Coq d'Art, but it's not clear if it's defined in the book.]

If by "mathematical foundations," you mean e.g. how to prove logical soundness at the meta level, then you'll need research papers and PhD dissertations and so forth.  If you just mean how to understand the behavior of the Coq type checker, then the CPDT section whose title you've cited should be exhaustive.

I think I understand the one rule of dependent type matching now -- however, I'd really like to implement it to be sure. Are you aware of any tutorials that does "dependent type checking + inductive types" ? (no need for co-inductive types). I feel like working through an actual implementation would truly verify my understanding.



Archive powered by MHonArc 2.6.18.

Top of Page