graph-rewriting-0.7.10: Monadic graph rewriting of hypergraphs with ports and multiedges

Safe HaskellNone
LanguageHaskell98

GraphRewriting.Pattern.InteractionNet

Description

Offers an activePair pattern for convenient implementation of interaction nets.

Synopsis

Documentation

class INet n where Source #

Index that identifies the principal port within the list of ports

Minimal complete definition

principalPort

Methods

principalPort :: n -> Port Source #

data Pair a Source #

Instead of (,) to save parentheses

Constructors

a :-: a 

Instances

Functor Pair Source # 

Methods

fmap :: (a -> b) -> Pair a -> Pair b #

(<$) :: a -> Pair b -> Pair a #

pair :: Pair a -> (a, a) Source #

activePair :: (View [Port] n, View v n, INet v) => Pattern n (Pair v) Source #