Skip to Content.
Sympa Menu

ssreflect - Computational finite sets over an eqType

Subject: Ssreflect Users Discussion List

List archive

Computational finite sets over an eqType


Chronological Thread 
  • From: Chantal KELLER <>
  • To: ssreflect <>
  • Subject: Computational finite sets over an eqType
  • Date: Wed, 24 Jun 2009 15:41:55 +0200

Hello everybody,

I am looking for a library of finite sets that would be such that:
- the type of the elements of the sets is an eqType
- it is computational : for instance, I want [is_empty (remove t
(remove u (union empty (add t (singleton u)))))] to reduce to true
- it has a few usual lemmas (typically, like in the FSetInterface
library).

Many thanks,
Chantal.



Archive powered by MHonArc 2.6.18.

Top of Page