Signature_disambiguation.Makemodule Lf_disambiguation :
Lf_disambiguation.LF_DISAMBIGUATION
with type state = Disambiguation_state.statemodule Clf_disambiguation :
Clf_disambiguation.CLF_DISAMBIGUATION
with type state = Disambiguation_state.statemodule Meta_disambiguation :
Meta_disambiguation.META_DISAMBIGUATION
with type state = Disambiguation_state.statemodule Comp_disambiguation :
Comp_disambiguation.COMP_DISAMBIGUATION
with type state = Disambiguation_state.stateinclude Support.Imperative_state.IMPERATIVE_STATE
with type state = Disambiguation_state.statetype state = Disambiguation_state.stateval traverse_list :
state ->
(state -> 'a -> 'b) ->
'a Support.List.t ->
'b Support.List.ttraverse_list state f [x1; x2; ...; xn] is [y1; y2; ...; yn] where yi = f state xi, and y1, y2, ..., yn are computed in order, meaning that y1 is computed first, then y2, etc.
val traverse_list1 :
state ->
(state -> 'a -> 'b) ->
'a Support.List1.t ->
'b Support.List1.tval traverse_list2 :
state ->
(state -> 'a -> 'b) ->
'a Support.List2.t ->
'b Support.List2.tval iter_list :
state ->
(state -> 'a -> Stdlib.Unit.t) ->
'a Support.List.t ->
Stdlib.Unit.titer_list state f [x1; x2; ...; xn] is f state x1; f state x2; ...; f state xn.
val iter_list1 :
state ->
(state -> 'a -> Stdlib.Unit.t) ->
'a Support.List1.t ->
Stdlib.Unit.tval iter_list2 :
state ->
(state -> 'a -> Stdlib.Unit.t) ->
'a Support.List2.t ->
Stdlib.Unit.tval traverse_reverse_list :
state ->
(state -> 'a -> 'b) ->
'a Support.List.t ->
'b Support.List.ttraverse_reverse_list state f [x1; x2; ...; xn] is [y1; y2; ...; yn] where yi = f state xi, and y1, y2, ..., yn are computed in reverse order, meaning that yn is computed first, then y(n-1), etc.
val traverse_reverse_list1 :
state ->
(state -> 'a -> 'b) ->
'a Support.List1.t ->
'b Support.List1.tval traverse_reverse_list2 :
state ->
(state -> 'a -> 'b) ->
'a Support.List2.t ->
'b Support.List2.tval iter_rev_list :
state ->
(state -> 'a -> Stdlib.Unit.t) ->
'a Support.List.t ->
Stdlib.Unit.titer_rev_list state f [x1; x2; ...; xn] is f state xn; f state x(n-1); ...; f state x1.
val iter_rev_list1 :
state ->
(state -> 'a -> Stdlib.Unit.t) ->
'a Support.List1.t ->
Stdlib.Unit.tval iter_rev_list2 :
state ->
(state -> 'a -> Stdlib.Unit.t) ->
'a Support.List2.t ->
Stdlib.Unit.tval traverse_option :
state ->
(state -> 'a -> 'b) ->
'a Support.Option.t ->
'b Support.Option.tval iter_option :
state ->
(state -> 'a -> Stdlib.Unit.t) ->
'a Support.Option.t ->
Stdlib.Unit.tval seq_list : state -> (state -> 'a) Support.List.t -> 'a Support.List.tval seq_list1 : state -> (state -> 'a) Support.List1.t -> 'a Support.List1.tval iter_seq :
state ->
(state -> Stdlib.Unit.t) Support.List.t ->
Stdlib.Unit.tval disambiguate_pragma :
state ->
Synprs.signature_pragma ->
Synext.signature_pragmaval disambiguate_global_pragma :
state ->
Synprs.signature_global_pragma ->
Synext.signature_global_pragmaval disambiguate_totality_declaration :
state ->
Synprs.signature_totality_declaration ->
Synext.signature_totality_declarationval disambiguate_numeric_totality_order :
state ->
Support.Int.t Synprs.signature_totality_order ->
Support.Int.t Synext.signature_totality_orderval disambiguate_named_totality_order :
state ->
Beluga_syntax.Synext.Identifier.t Synprs.signature_totality_order ->
Beluga_syntax.Synext.Identifier.t Synext.signature_totality_orderval disambiguate_declaration :
state ->
Synprs.signature_declaration ->
Synext.signature_declarationval disambiguate_signature_file :
state ->
Synprs.signature_file ->
Synext.signature_fileval disambiguate_signature : state -> Synprs.signature -> Synext.signature