turingMachine-0.1.2.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
  • TypeOperators
  • ExplicitNamespaces

Data.Delta

Contents

Description

Map implementation, represent a partial function

Synopsis

Delta

Deterministic

Constructor

type (:->:) a p1 p2 = Map (State a, p1) (State a, p2) Source

Functions

nextD :: (Ord p1, Ord a) => (:->:) a p1 p2 -> (State a, p1) -> State a Source

Not deterministic

Constructor

type (:>-:) a p1 p2 = Map (State a, p1) ([State a], p2) Source

Transductor

Constructor

type (:*>:) a p o = Map (State a, p) o Source