Polynom-0.1: A commutative algebra package Contents Index

Data.Lattice

Description

The Data.Lattice module defines the class of lattices, i.e. types with meet (/\) and join (\/) operations satisfying the properties of boolean lattices.

Synopsis

class Lattice a where lempty :: Maybe a lfull :: Maybe a (/\) :: a -> a -> a (\/) :: a -> a -> a meet :: [a] -> Maybe a join :: [a] -> Maybe a

Documentation

class Lattice a where

The Lattice class defines boolean-like lattice structures with /\ and \/ (meet and join) operations. Minimal and maximal elements are specified as Maybes. Methods lempty :: Maybe a lfull :: Maybe a (/\) :: a -> a -> a (\/) :: a -> a -> a meet :: [a] -> Maybe a join :: [a] -> Maybe a Instances Lattice Bool Ring a => Lattice (Ideal a)

Produced by Haddock version 2.3.0