package colibri2

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Package contains no libraries

This functor provides the partitioning algorithm constructing a WTO.

Parameters

module Node : sig ... end

type pref = Node.t -> Node.t -> int

partial order of preference for the choice of the head of a loop

val partition : 
  ?pref:pref ->
  inits:Node.t list ->
  (Node.t -> Node.t Base.Sequence.t) ->
  Node.t partition

Implements Bourdoncle "Efficient chaotic iteration strategies with widenings" algorithm to compute a WTO.

val equal_component : Node.t component -> Node.t component -> bool

val equal_partition : Node.t partition -> Node.t partition -> bool