coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club]Set comprehensions in Coq?

From: Adam Chlipala <adamc AT cs.berkeley.edu>
To: Peter Hawkins <hawkinsp AT cs.stanford.edu>
Cc: coq-club AT pauillac.inria.fr
Subject: Re: [Coq-Club]Set comprehensions in Coq?
Date: Sat, 03 Mar 2007 17:30:30 -0800
List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>

Peter Hawkins wrote:

Is there a way to express a set comprehension in Coq's type theory?
That is, if I have a predicate P: A->Prop, is it possible to talk
about the set of all x:A satisfying P?

It sounds like the 'sig' type fits the bill:
http://coq.inria.fr/V8.1/stdlib/Coq.Init.Specif.html

[Coq-Club]Set comprehensions in Coq?, Peter Hawkins
- Re: [Coq-Club]Set comprehensions in Coq?, Adam Chlipala
  - Re: [Coq-Club]Set comprehensions in Coq?, Peter Hawkins
    - Re: [Coq-Club]Set comprehensions in Coq?, Adam Chlipala
      - Re: [Coq-Club]Set comprehensions in Coq?, Peter Hawkins
        
        Re: [Coq-Club]Set comprehensions in Coq?, Adam Chlipala
        
        Re: [Coq-Club]Set comprehensions in Coq?, Benjamin Werner