Module `Reductionops.Stack`Source

Sourcetype app_node

Sourceval pr_app_node : (EConstr.t -> Pp.t) -> app_node -> Pp.t

Sourcetype case_stk

val mkCaseStk : 
  (Constr.case_info
   * EConstr.EInstance.t
   * EConstr.t array
   * EConstr.case_return
   * EConstr.t Constr.pcase_invert
   * EConstr.case_branch array) ->
  case_stk

Sourcetype member =

| App of app_node
| Case of case_stk
| Proj of Names.Projection.t * EConstr.ERelevance.t
| Fix of EConstr.fixpoint * t
| Primitive of CPrimitives.t * Names.Constant.t * EConstr.EInstance.t * t * CPrimitives.args_red

Sourceand t = member list

Sourceval pr : (EConstr.t -> Pp.t) -> t -> Pp.t

Sourceval empty : t

Sourceval is_empty : t -> bool

Sourceval compare_shape : t -> t -> bool

Sourceexception IncompatibleFold2

Source

val fold2 : 
  ('a -> EConstr.constr -> EConstr.constr -> 'a) ->
  'a ->
  t ->
  t ->
  'a

fold2 f x sk1 sk2 folds f on any pair of term in (sk1,sk2).

returns
the result and the lifts to apply on the terms

raises IncompatibleFold2
when sk1 and sk2 have incompatible shapes

Sourceval append_app : EConstr.t array -> t -> t

append_app args sk pushes array of arguments args on sk

Sourceval append_app_list : EConstr.t list -> t -> t

append_app_list args sk pushes list of arguments args on sk

Sourceval strip_app : t -> t * t

if strip_app sk = (sk1,sk2), then sk = sk1 @ sk2 with sk1 purely applicative and sk2 does not start with an argument

Sourceval strip_n_app : int -> t -> (t * EConstr.t * t) option

returns
(the nth first elements, the (n+1)th element, the remaining stack) if there enough of those

Sourceval decomp_rev : t -> (EConstr.t * t) option

decomp sk extracts the first argument of reversed stack sk is there is some

Sourceval not_purely_applicative : t -> bool

not_purely_applicative sk

Sourceval list_of_app_stack : t -> EConstr.constr list option

list_of_app_stack sk either returns Some sk turned into a list of arguments if sk is purely applicative and None otherwise

Sourceval args_size : t -> int

args_size sk returns the number of arguments available at the head of sk

Sourceval zip : Evd.evar_map -> (EConstr.constr * t) -> EConstr.constr

zip sigma t sk

Source

val expand_case : 
  Environ.env ->
  Evd.evar_map ->
  case_stk ->
  Constr.case_info
  * EConstr.EInstance.t
  * EConstr.constr array
  * ((EConstr.rel_context * EConstr.constr) * EConstr.ERelevance.t)
  * (EConstr.rel_context * EConstr.constr) array

Install

Dune Dependency

Authors

Maintainers

Sources

doc/rocq-runtime.pretyping/Reductionops/Stack/index.html

Module `Reductionops.Stack`Source

package rocq-runtime

Install

Dune Dependency

Authors

Maintainers

Sources

doc/rocq-runtime.pretyping/Reductionops/Stack/index.html

Module Reductionops.StackSource

Module `Reductionops.Stack`Source