Data.Comp.Automata

Stateful Term Homomorphisms

type QHom f q g

below

above

pureHom

Bottom-Up State Propagation

upTrans

runUpHom

runUpHomSt

Top-Down State Propagation

downTrans

runDownHom

Bidirectional State Propagation

runQHom

Deterministic Bottom-Up Tree Transducers

type UpTrans f q g

type UpTrans' f q g

mkUpTrans

runUpTrans

compUpTrans

compUpTransHom

compHomUpTrans

compUpTransSig

compSigUpTrans

compAlgUpTrans

Deterministic Bottom-Up Tree State Transformations

Monolithic State

type UpState f q

tagUpState

runUpState

prodUpState

Modular State

type DUpState f p q

dUpState

upState

runDUpState

prodDUpState

(|*|)

Deterministic Top-Down Tree Transducers

type DownTrans f q g

type DownTrans' f q g

mkDownTrans

runDownTrans

compDownTrans

compDownTransSig

compSigDownTrans

compDownTransHom

compHomDownTrans

Deterministic Top-Down Tree State Transformations

Monolithic State

type DownState f q

tagDownState

prodDownState

Modular State

type DDownState f p q

dDownState

downState

prodDDownState

(>*<)

Bidirectional Tree State Transformations

runDState

Operators for Finite Mappings

(&)

(|->)

empty

Product State Spaces

Annotations

propAnnQ

propAnnUp

propAnnDown

pathAnn