Flambda2_bound_identifiers.Bound_parameterval create :
Flambda2_identifiers.Variable.t ->
Flambda2_kinds.Flambda_kind.With_subkind.t ->
Flambda2_identifiers.Flambda_debug_uid.t ->
tCreate a kinded parameter.
val var : t -> Flambda2_identifiers.Variable.tThe underlying variable.
val var_and_uid :
t ->
Flambda2_identifiers.Variable.t * Flambda2_identifiers.Flambda_debug_uid.tval name : t -> Flambda2_identifiers.Name.tval simple : t -> Flambda2_identifiers.Int_ids.Simple.tAs for var, but returns a Simple.t describing the variable.
val kind : t -> Flambda2_kinds.Flambda_kind.With_subkind.tThe kind of the given parameter.
val with_kind : t -> Flambda2_kinds.Flambda_kind.With_subkind.t -> tReplace the kind of the given parameter.
include Flambda2_algorithms.Container_types.S with type t := tmodule T : Flambda2_algorithms.Container_types_intf.Thing with type t = tinclude Flambda2_algorithms.Container_types_intf.Thing with type t := T.tinclude Hashtbl.HashedType with type t := T.tval hash : T.t -> intA hashing function on keys. It must be such that if two keys are equal according to equal, then they have identical hash values as computed by hash. Examples: suitable (equal, hash) pairs for arbitrary key types include
(=), hash) for comparing objects by structure (provided objects do not contain floats)(fun x y -> compare x y = 0), hash) for comparing objects by structure and handling Stdlib.nan correctly(==), hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).include Map.OrderedType with type t := T.tA total ordering function over the keys. This is a two-argument function f such that f e1 e2 is zero if the keys e1 and e2 are equal, f e1 e2 is strictly negative if e1 is smaller than e2, and f e1 e2 is strictly positive if e1 is greater than e2. Example: a suitable ordering function is the generic structural comparison function Stdlib.compare.
val print : Format.formatter -> T.t -> unitmodule Set : Flambda2_algorithms.Container_types_intf.Set with type elt = tinclude Flambda2_nominal.Contains_names.S with type t := tval free_names : t -> Flambda2_nominal.Name_occurrences.tCompute the free names of a term. Such computation covers all kinds of bindable names (variables, continuations, ...)
val apply_renaming : t -> Flambda2_nominal.Renaming.t -> tApply a renaming throughout a term.
include Flambda2_nominal.Contains_ids.S with type t := tval ids_for_export : t -> Flambda2_nominal.Ids_for_export.tGather all table identifiers to export them.