Module `Flambda2_terms.Exn_continuation`

Exception continuations for function calls, etc.

We allow exception handlers that have not only the exception bucket argument but also a sequence of "extra arguments".

type t

include Flambda2_algorithms.Container_types.S with type t := t

module T : Flambda2_algorithms.Container_types_intf.Thing with type t = t

include Flambda2_algorithms.Container_types_intf.Thing with type t := T.t

include Hashtbl.HashedType with type t := T.t

val equal : T.t -> T.t -> bool

The equality predicate used to compare keys.

val hash : T.t -> int

A 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.t

val compare : T.t -> T.t -> int

A 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.

module Set : Flambda2_algorithms.Container_types_intf.Set with type elt = t

module Map : 
  Flambda2_algorithms.Container_types_intf.Map
    with type key = t
     and module Set = Set

include Expr_std.S with type t := t

val print : Format.formatter -> t -> unit

include Flambda2_nominal.Contains_names.S with type t := t

val free_names : t -> Flambda2_nominal.Name_occurrences.t

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

val apply_renaming : t -> Flambda2_nominal.Renaming.t -> t

Apply a renaming throughout a term.

include Flambda2_nominal.Contains_ids.S with type t := t

val ids_for_export : t -> Flambda2_nominal.Ids_for_export.t

Gather all table identifiers to export them.

val create : 
  exn_handler:Flambda2_identifiers.Continuation.t ->
  extra_args:
    (Flambda2_term_basics.Simple.t * Flambda2_kinds.Flambda_kind.With_subkind.t)
      list ->
  t

Create an exception continuation.

val exn_handler : t -> Flambda2_identifiers.Continuation.t

The exception handler itself.

val extra_args : 
  t ->
  (Flambda2_term_basics.Simple.t * Flambda2_kinds.Flambda_kind.With_subkind.t)
    list

Any extra arguments together with their kinds.

val arity : t -> [> `Unarized ] Flambda2_kinds.Flambda_arity.t

The arity of the given exception continuation, taking into account both the exception bucket argument and any extra_args.

val with_exn_handler : t -> Flambda2_identifiers.Continuation.t -> t

val without_extra_args : t -> t

Module Flambda2_terms.Exn_continuation

Module `Flambda2_terms.Exn_continuation`