package grenier

You can search for identifiers within the package.

in-package search v0.2.0

package grenier

grenier.balmap
- Balmap
  - Map
    
    Make
    
    O
  - Set
    
    Make
    
    O
grenier.baltree
- Bt1
- Bt2
- Mbt
  - MEASURE
  - Make
    
    M
grenier.binder_introducer
- Binder_introducer
grenier.binpacking
- Maxrects
grenier.dbseq
- Dbseq
grenier.doubledouble
- Doubledouble
  - Infix
grenier.fastdom
- Fastdom
grenier.hll
- Hll
- Hll_consts
grenier.jmphash
- Jmphash
grenier.orderme
grenier.physh
- Physh
  - Map
  - Set
grenier.state_elimination
- State_elimination
  - Convert
    
    NFA
    
    Finals
    
    Initials
    
    States
    
    Transitions
    
    Regex
  - NFA
    
    Finals
    
    Initials
    
    States
    
    Transitions
  - Regex
grenier.strong
- Strong
  - Finite
    
    Array
    
    Of_array
    
    A
    
    T
    
    Elt
    
    Set
    
    Gensym
  - Natural
    
    Nth
    
    N
    
    T
  - Order
grenier.trope
- Trope
grenier.valmari
- Partition
- Valmari
  - DFA
  - INPUT
  - Minimize
    
    In
    
    Label

Legend:
Library
Module
Module type
Parameter
Class
Class type

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

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;

}

val explicit_sharing : 'a graph -> ('a, 'b) binding_structure -> 'a -> 'a