Entrypoint of TypeMachine. Create a new data type using a TM computation

Define the Is class for the given type and generate the To function

 > data User = User { id :: Int, name :: String }
 > defineIs ''User

 class IsUser a where
      getId :: a -> Int
      getName :: a -> String

      setId :: Int -> a -> a
      setName :: String -> a -> a

      toUser :: (IsUser a) => a -> User
      toUser a = User (getId a) (getName a)

 instance IsUser User where
      ...

Returns the declaration of the instance of Is for a given type

 > deriveIs ''Animal ''Dog

   instance IsAnimal Dog where
      ...

Apply a `TM a` value to a TM computation that expects an a

Example:

 omit ["id"] <:> toType ''User

Allows passing a name to a TM function that takes a Type

 f <::> ''User == f <:> toType ''User

Data structure to easily manipulate Template Haskell's DataD

The TM (*TypeMachine*) monad can:

• Emit warning messages (e.g. when omitting that does not exist)
• Take advantage of the Q monad's features