graph-rewriting-0.8.0: Monadic graph rewriting of hypergraphs with ports and multiedges
Safe HaskellSafe-Inferred
LanguageHaskell2010

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

Methods

principalPort :: n -> Port Source #

data Pair a Source #

Instead of (,) to save parentheses

Constructors

a :-: a 

Instances

Instances details
Functor Pair Source # 
Instance details

Defined in GraphRewriting.Pattern.InteractionNet

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 #