package grenier
A collection of various algorithms in OCaml
Install
dune-project
Dependency
Authors
Maintainers
Sources
grenier-0.16.tbz
sha256=8fd22abf9f4589c206008654fa9eebb1cf4a58737ebb34138c6709520f36b75f
sha512=f60315eccfecaec9cb4c3bd020ef6f94d05ed6b13038109b904ead6e4e5662f4ed95415855b3c763293b762b696f1962045393fd592742d54cf5607d0ef2961a
doc/grenier.binder_introducer/Binder_introducer/index.html
Module Binder_introducerSource
Source
type 'a graph = 'a Fastdom.graph = {memoize : 'b. ('a -> 'b) -> 'a -> 'b;(*Memoize a function on nodes
*)successors : 'b. ('b -> 'a -> 'b) -> 'b -> 'a -> 'b;(*Fold over successors of a node
*)
}Representation of a graph with nodes of type 'a
Rewrite a (possibly cyclic) directed graph by introducing let-binders at dominating nodes
Source
type ('term, 'var) binding_structure = {map_subterms : ('term -> 'term) -> 'term -> 'term;name_term : 'term -> 'var;var_term : 'var -> 'term;introduce_let : recursive:bool -> ('var * 'term) list -> 'term -> 'term;
}