package zelus

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Parameters
Signature

package zelus

zelus
- Basics
- Defaultsolver
- Dump
- Illinois
- Lift
- Node
  - Ode23Solver
  - Ode45Solver
- Node_base
  - Make
    
    SSolver
    
    ZSolver
  - Ode23Solver
  - Ode45Solver
- Odexx
  - BUTCHER_TABLEAU
  - GenericODE
    
    Butcher
  - Ode23
  - Ode45
- Run
- Solvers
- Zls
- Zlsolve
  - Make
    
    _
  - ZELUS_SOLVER
- Zlsrun
  - Make
    
    _
- Ztypes
zelus.zlcompilerlibs
- Activate
- Add_copy_for_last
- Aform
- Automata
  - TableOfTypes
- Causal
  - K
  - M
  - S
- Causality
- Compiler
- Complete
- Control
- Copy
- Cost
- Cse
- Defcaus
- Definit
- Deftypes
- Dependences
- Deps_tools
- Disc
- Encore
- Fixstep
- Global
- Graph
  - E
  - S
- Horizon
- Init
  - M
  - S
- Initial
- Initialization
- Inline
- Inout
- Interface
- Letin
- Lident
- Lmm
- Markfunctions
- Match2condition
- Modules
  - E
- Oaux
- Obc
- Ocamlprinter
- Oprinter
- Patternsig
  - C
    
    SSet
  - LANG
- Pcaus
  - M
  - S
- Period
- Pinit
- Plmm
- Pp_tools
- Pre
- Present
- Printer
- Proba
- Ptypes
- Reduce
- Remove_last_in_patterns
- Reset
- Schedule
- Scoping
  - Error
  - Rename
  - S
- Shared
- Simulator
- Static
- Total
  - Automaton
- Translate
- Typerrors
- Typing
- Unsafe
- Vars
- Write
- Zaux
- Zconfig
- Zdeadcode
- Zdepend
  - StringSet
- Zelus
- Zident
  - Env
  - M
  - S
- Zlexer
- Zlocation
- Zlus2lmm
- Zmatching
  - PATTERN_CHECKER
    
    S
    
    SSet
  - SIG
- Zmisc
  - Env
  - S
  - State
  - name_assoc_table
  - name_generator
- Zopt
- Zparser
  - Incremental
  - MenhirInterpreter
- Zparsetree
- Ztypes

Legend:
Library
Module
Module type
Parameter
Class
Class type

Parameters

module S : SIG

Signature

module SSet : sig ... end

val uniq : SSet.elt list -> SSet.elt list

val is_complete : SSet.elt list -> bool

val not_in : SSet.elt list -> S.tag

val head_constrs : 'a pattern -> ('a * int) list

Extract constructors from pattern.

val matS : S.tag -> int -> S.tag pattern list list -> S.tag pattern list list

Implementation of S(c,p) as described in the paper's first part.

val matD : 'a pattern list list -> 'a pattern list list

Implementation of D(p) as described in the paper's first part.

val algU : SSet.elt pattern list list -> S.tag pattern list -> bool

U(p,q) from the paper. Most important function, called by higher level ones. Tests the usefulness of q relatively to p.

type 'a trivec = {

p : 'a patt_vec;
q : 'a patt_vec;
r : 'a patt_vec;

}

Type used for efficient testing of usefulness and redundancy of pattern-matching cases.

and 'a trimat = 'a trivec list

val trimatS : S.tag -> int -> S.tag trivec list -> S.tag trivec list

Second de finition of S(c,p) for tri-matrices.

val shift1 : 'a trivec -> 'a trivec

shift1 l shifts an element from l.p to l.q.

val shift2 : 'a trivec -> 'a trivec

shift2 l shifts an element from l.p to l.r.

S.tag pattern list option is used for results of usefulness testing for Or(r1,r2) patterns. Some means that r1 and r2 are both useful, Some r1 (resp. Some r2) means that r1 (resp. r2) is useless, and None means that both are.

The following functions implement useful shortcuts.

val simple_union : 'a list option -> 'a list option -> 'a list option

val union : 'a -> 'a -> 'a list option -> 'a list option -> 'a list option

val algU' : 
  SSet.elt trivec list ->
  SSet.elt trivec ->
  S.tag pattern list option

Efficient usefulness check with special Or pattern management.

val algI : SSet.elt pattern list list -> int -> SSet.elt pattern list option

Completely construct a non-matched pattern. If none is returned, this matrix is exhaustive.

type result = {

not_matched : S.pattern_ast option;
redundant_patterns : S.pattern_ast list;

}

val check : S.pattern_ast list -> result