val intersect  : #a:eqtype -> set a -> set a -> Tot (set a)
let intersect #a s1 s2 = F.on_dom a (fun x -> s1 x && s2 x)
val intersect  : #a:eqtype -> set a -> set a -> Tot (set a)
let intersect #a s1 s2 =
F.on_dom a (fun x -> s1 x && s2 x)
FStar.Set.fst.checked
prims.fst.checked FStar.Pervasives.fsti.checked FStar.FunctionalExtensionality.fsti.checked FStar.Classical.fsti.checked
FStar.Set.fst
Prims.eqtype FStar.Set.set FStar.FunctionalExtensionality.on_dom Prims.bool Prims.op_AmpAmp
(*
   Copyright 2008-2014 Nikhil Swamy, Aseem Rastogi,
                       Microsoft Research, University of Maryland

   Licensed under the Apache License, Version 2.0 (the "License");
   you may not use this file except in compliance with the License.
   You may obtain a copy of the License at

       http://www.apache.org/licenses/LICENSE-2.0

   Unless required by applicable law or agreed to in writing, software
   distributed under the License is distributed on an "AS IS" BASIS,
   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
   See the License for the specific language governing permissions and
   limitations under the License.
*)
module FStar.Set
(** Computational sets (on eqtypes): membership is a boolean function *)
#set-options "--initial_fuel 0 --max_fuel 0 --initial_ifuel 0 --max_ifuel 0"
open FStar.FunctionalExtensionality
module F = FStar.FunctionalExtensionality

let set (a:eqtype) = F.restricted_t a (fun _ -> bool)

let equal (#a:eqtype) (s1:set a) (s2:set a) = F.feq s1 s2

(* destructors *)

let mem #a x s = s x

(* constructors *)
let empty #a = F.on_dom a (fun x -> false)
let singleton #a x = F.on_dom a (fun y -> y = x)
val intersect  : #a:eqtype -> set a -> set a -> Tot (set a)
s1: FStar.Set.set a -> s2: FStar.Set.set a -> FStar.Set.set a