verigraph-1.1.1: Software specification and verification tool based on graph rewriting.

Safe HaskellSafe
LanguageHaskell2010

SndOrder.Morphism

Synopsis

Documentation

data RuleMorphism a b Source #

A morphism between two first order rules.

The following diagram illustrates such a morphism, omiting the NACs.

          l1      r1
      L1◀─────K1─────▶R1
      │       │       │
 mapL │   mapK│   mapR│
      ▼       ▼       ▼
      L2◀─────K2─────▶R2
          l2      r2

domain = (l1,r1)

codomain = (l2,r2)

mappingLeft = mapL

mappingInterface = mapK

mappingRight = mapR

TODO: Make polymorphic on the type of morphism?