This package does two jobs:
-
It offers a general typeclass
Mapping
for types which represent functionsk -> v
(for fixedk
, but arbitrary orderedv
).There are some fairly straightforward examples which build up mappings where
k
isEither
, or a pair, orMaybe
, orBool
. -
Three less trivial implementations are provided:
-
Decision diagrams, with nodes which may themselves be an arbitrary
Mapping
(there is some code for viewing these in theexamples
directory); -
Piecewise constant maps on an ordered domain
k
;
-
The aim is to use decision diagrams with nodes that are piecewise constant maps to store monomials for Grobner basis algorithms.