coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: roconnor AT theorem.ca
- To: Andrei Popescu <uuomul AT yahoo.com>
- Cc: coq-club AT pauillac.inria.fr
- Subject: Re: [Coq-Club] how to define (very) dependent numeric sums
- Date: Tue, 6 May 2008 13:35:15 -0400 (EDT)
- List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>
On Wed, 30 Apr 2008, Andrei Popescu wrote:
I am trying to define a sum operator that takes a number n, a predicate P
: Less n -> Prop,
and a function f : {i : Less n | P i} -> nat, and returns the sum of all
numbers f i such that
i : Less n and P i holds.
I would recomment using a predicate P : Less n -> bool, which gives you the class of decidable predicates.
--
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] how to define (very) dependent numeric sums, Andrei Popescu
- Re: [Coq-Club] how to define (very) dependent numeric sums, roconnor
- Re: [Coq-Club] how to define (very) dependent numeric sums, Carlos . SIMPSON
- <Possible follow-ups>
- Re: [Coq-Club] how to define (very) dependent numeric sums,
popescu2
- Re: [Coq-Club] how to define (very) dependent numeric sums,
Yves Bertot
- Re: [Coq-Club] how to define (very) dependent numeric sums, Matthieu Sozeau
- Re: [Coq-Club] how to define (very) dependent numeric sums,
Yves Bertot
- Re: [Coq-Club] how to define (very) dependent numeric sums, popescu2
- Re: [Coq-Club] how to define (very) dependent numeric sums, roconnor
Archive powered by MhonArc 2.6.16.