jon.recoil.org

Module Flambda2_bound_identifiers.Bound_static

The left-hand sides of Let-expressions that bind statically-allocated constants and pieces of code. Used via Bound_pattern in the term language.

module Pattern : sig ... end
type t

All recursive cycles between the names bound by the provided pattern(s) must go through at least one code ID. (So for example the declaration of just a block that points to itself is forbidden.)

val binds_symbols : Flambda2_bound_identifiers.Bound_static.t -> bool
include Flambda2_nominal.Contains_names.S with type t := Flambda2_bound_identifiers.Bound_static.t

Compute the free names of a term. Such computation covers all kinds of bindable names (variables, continuations, ...)