mappings

Types which represent functions k -> v

BSD-3-Clause licensed by James Cranch

Maintained by [email protected]

This version can be pinned in stack with:mappings-0.3.0.0@sha256:c9e09f321bd4339e87ea2d0a5c723293992629eac5eab2c73cd53d2ff67b4fa7,2768

Depends on 7 packages(full list with versions):

Used by 1 package in nightly-2023-12-28(full list with versions):

Mappings

This package does two jobs:

It offers a general typeclass Mapping for types which represent functions k -> v (for fixed k, but arbitrary ordered v).

There are some fairly straightforward examples which build up mappings where k is Either, or a pair, or Maybe, or Bool.
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 the examples directory);
- Piecewise constant maps on an ordered domain k;
- Maps equipped with a default value.

The aim is to use decision diagrams with nodes that are piecewise constant maps to store monomials for Grobner basis algorithms.

Initial version