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: Adam Chlipala <adamc AT csail.mit.edu>
  • To: t x <txrev319 AT gmail.com>
  • 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 08:55:40 -0400

On 10/16/2013 04:08 AM, t x wrote:
Thus, my question:

is "the one rule of dependent type matching"

a) a derivation from dependent theory alone?
b) a derivation from inductive types alone?
c) a derivation that only arises from dependent type theory + inductive types?

I believe it's (c), since "a" alone does not provide inductive types / multiple constructors -- thus nothing to match on; and "b" alone ends up being STLC.

You're right.

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.



Archive powered by MHonArc 2.6.18.

Top of Page