Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Annotation for Dependent Pattern Matching

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Annotation for Dependent Pattern Matching


Chronological Thread 
  • From: Arnaud Spiwack <aspiwack AT lix.polytechnique.fr>
  • To: Coq Club <coq-club AT inria.fr>
  • Subject: Re: [Coq-Club] Annotation for Dependent Pattern Matching
  • Date: Mon, 3 Nov 2014 10:56:09 +0100


I don't know about consensus, but I _often_ use the proof mechanism for
defining functions involving dependent types or contradictions.  Only in a
very few cases has the extraction suffered enough to force me to rewrite the
proof term manually.


For the records, writing programs by tactics was one the original motivations which led me to rewrite the tactic engine to allow for dependent subgoals (aka "true refine").




Archive powered by MHonArc 2.6.18.

Top of Page