Skip to Content.
Sympa Menu

coq-club - [Coq-Club]Set comprehensions in Coq?

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

[Coq-Club]Set comprehensions in Coq?


chronological Thread 
  • From: "Peter Hawkins" <hawkinsp AT cs.stanford.edu>
  • To: coq-club AT pauillac.inria.fr
  • Subject: [Coq-Club]Set comprehensions in Coq?
  • Date: Sat, 3 Mar 2007 16:48:15 -0800
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=beta; h=received:message-id:date:from:sender:to:subject:mime-version:content-type:content-transfer-encoding:content-disposition:x-google-sender-auth; b=hoEp4RJ/vpbdWxdLanTarSaFMy0Ah/m3vKoUZcgMBvLBgbwaw3+bXrEjyDO62rJSMe6BPZwp9uQ6jv8+laLC+28j38vDq9cGWn6EBs6/FZbUl6BsujX8nptiLAmU8DQkAhviB2HZXlUvxFU9U6Zihei60kxilrdfaIFi8Ec/R9k=
  • List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>

Hi...

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?

Thanks,
Peter





Archive powered by MhonArc 2.6.16.

Top of Page