test.hs

#!/usr/bin/env stack
{- stack --resolver lts-9.1
  script
  --compile
  --package recursion-schemes
-}

{-# LANGUAGE DeriveFunctor #-}
{-# LANGUAGE TypeSynonymInstances #-}

import Data.Functor.Foldable

newtype Object a = Object {getObject :: a} deriving (Show, Eq, Functor)
data Label l a = Label { label :: l, inner :: a } deriving (Show, Eq, Functor)
data FooF l a = FooF { nested :: (Label l) (Object a) }

type LabelFunctor l = Fix (FooF l)

instance Functor LabelFunctor where
  fmap = undefined

main = print ()