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
  • MonoLocalBinds
  • TypeFamilies
  • TypeSynonymInstances
  • ConstrainedClassMethods
  • MultiParamTypeClasses
  • KindSignatures
  • TypeOperators
  • ExplicitNamespaces

Math.Model.Turing.FourWays

Contents

Description

Four ways turing machine

Documentation

data Tracks a Source #

Constructors

Track [Tape a] (Tape a) [Tape a] 

Instances

Functor Tracks Source # 

Methods

fmap :: (a -> b) -> Tracks a -> Tracks b #

(<$) :: a -> Tracks b -> Tracks a #

Applicative Tracks Source # 

Methods

pure :: a -> Tracks a #

(<*>) :: Tracks (a -> b) -> Tracks a -> Tracks b #

liftA2 :: (a -> b -> c) -> Tracks a -> Tracks b -> Tracks c #

(*>) :: Tracks a -> Tracks b -> Tracks b #

(<*) :: Tracks a -> Tracks b -> Tracks a #

Tapeable Tracks Symbol Source # 
TuringM Tracks Symbol FW Source # 
Eq a => Eq (Tracks a) Source # 

Methods

(==) :: Tracks a -> Tracks a -> Bool #

(/=) :: Tracks a -> Tracks a -> Bool #

Show a => Show (Tracks a) Source # 

Methods

showsPrec :: Int -> Tracks a -> ShowS #

show :: Tracks a -> String #

showList :: [Tracks a] -> ShowS #

(Eq s, Monoid s) => Monoid (Tracks s) Source # 

Methods

mempty :: Tracks s #

mappend :: Tracks s -> Tracks s -> Tracks s #

mconcat :: [Tracks s] -> Tracks s #

Orphan instances