Sort.Top
Sorts with erased type indices.
This module enables construction of complex data structures on sorts, like maps, sets, etc, e.g.,
let sorts = Set.empty (module Value.Sort.Top)
Since such structures are required to be monomorphic, the sort type index should be removed using the forget
function, before a sort could be stored in it.
Note, that the type index is only removed from the meta language (OCaml) type, but is preserved in the value term, so it could be reconstructed (refined) later.
type t = unit sort
include Core_kernel.Bin_prot.Binable.S with type t := t
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Write.writer
val bin_read_t : t Bin_prot.Read.reader
val __bin_read_t__ : (int -> t) Bin_prot.Read.reader
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
include Base.Comparable.S with type t := t
val comparator : (t, comparator_witness) Base__.Comparator.comparator