coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: roconnor AT theorem.ca
- To: Coq Club <coq-club AT pauillac.inria.fr>
- Subject: Re: [Coq-Club]Using a Prop to bound recursion
- Date: Wed, 6 Dec 2006 02:46:23 -0500 (EST)
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
On Tue, 5 Dec 2006, Adam Chlipala wrote:
My intuition is that this is impossible. Since you aren't allowed to eliminate values of types in Prop to construct values of types in Set,
Sometimes you can. See <http://cocorico.cs.ru.nl/coqwiki/ExistsFromPropToSet>
for
Variable P : nat -> Prop.
Hypothesis P_dec : forall x, {P x} + {~ P x}.
Theorem prop_to_set : (exists x, P x) -> {x : nat | P x}.
And this can be used to solve the originial problem, assuming that P_dec can be satisfied.
--
Russell O'Connor <http://r6.ca/>
``All talk about `theft,''' the general counsel of the American Graphophone
Company wrote, ``is the merest claptrap, for there exists no property in
ideas musical, literary or artistic, except as defined by statute.''
- [Coq-Club]Using a Prop to bound recursion, Tom Harke
- Re: [Coq-Club]Using a Prop to bound recursion,
Adam Chlipala
- Re: [Coq-Club]Using a Prop to bound recursion, Christine Paulin
- Re: [Coq-Club]Using a Prop to bound recursion, roconnor
- <Possible follow-ups>
- Re: [Coq-Club]Using a Prop to bound recursion, Yves Bertot
- Re: [Coq-Club]Using a Prop to bound recursion,
Adam Chlipala
Archive powered by MhonArc 2.6.16.