package rocq-runtime

  1. Overview
  2. Docs
The Rocq Prover -- Core Binaries and Tools

Install 

dune-project
 Dependency

rocq-prover.org Readme Edit opam file Versions (6)

Authors

  1. T
    The Rocq development team, INRIA, CNRS, and contributors

Maintainers

  1. T
    The Rocq development team <rocq+rocq-development@discoursemail.com>

Sources

rocq-9.3.0.tar.gz
sha256=3f0fc283e8644394aa9c7a6e3995b6d9ebbe1e6dda712bf431f9c372dcef95ad

doc/rocq-runtime.kernel/Rtree/Automaton/index.html

Module Rtree.AutomatonSource

Sourcetype 'a rtree = 'a t
Sourcetype state
Sourcetype 'a t
Sourceval make : 'a rtree -> 'a t

Compile a regular tree into an automaton, not necessarily minimal

Sourceval initial : 'a t -> state

Get the initial state of the automaton

Sourceval data : 'a t -> state -> 'a

Get the data associated to a given state in the automaton

Sourceval transitions : 'a t -> state -> state array array

Get the transitions of the automaton from a given state

Sourceval move : 'a t -> state -> 'a t

Move the automaton into the given state

Sourceval compact : ('a -> 'a -> int) -> 'a t -> 'a t

Given a comparison function on the data, produce a minimal automaton

Sourceval inter : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t

Intersection of two automata given an intersection on data. Does not produce a minimal automaton on general.

Sourceval equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

Equality of minimal automata, i.e. only valid after compaction

Sourceval map : ('a -> 'b) -> 'a t -> 'b t

Map the data of each node