turingMachine-1.0.0.0: An implementation of Turing Machine and Automaton

Copyright(c) Jorge Santiago Alvarez Cuadros 2016
LicenseGPL-3
Maintainersanjorgek@ciencias.unam.mx
Stabilityexperimental
Portabilityportable
Safe HaskellSafe
LanguageHaskell2010
Extensions
  • TypeSynonymInstances
  • FlexibleInstances

Data.Numerable

Description

Cardinal definitions

Synopsis

Documentation

data Essence Source #

All sets can be one and only one:

  • a empty set
  • a set with, at least, one element

Constructors

Empty 
Occupied 

data Discrete Source #

Simple cardinality definition, we work here with numerable sets.

All numerable set have one and only one:

  1. A finite size
  2. A infinite size

Constructors

Fin Integer 
Numerable 

Instances

Bounded Discrete Source #

Bound limits for numerable cardinality

Eq Discrete Source # 
Ord Discrete Source #

Order for numerable cardinality

Show Discrete Source #