All Types

arrow.free.Cofree  
arrow.free.CofreeEval  
arrow.free.CofreeKindedJ  
arrow.free.CofreeOf  
arrow.free.CofreePartialOf  
arrow.free.Coyoneda  
arrow.free.CoyonedaKindedJ  
arrow.free.CoyonedaOf  
arrow.free.CoyonedaPartialOf  
arrow.free.ForCofree  
arrow.free.ForCoyoneda  
arrow.free.ForFree  
arrow.free.ForFreeApplicative  
arrow.free.ForYoneda  
arrow.free.Free  
arrow.free.FreeApplicative See https//github.com/edmundnoble/cats/blob/6454b4f8b7c5cefd15d8198fa7d52e46e2f45fea/docs/src/main/tut/datatypes/freeapplicative.md
arrow.free.FreeApplicativeOf  
arrow.free.FreeApplicativePartialOf  
arrow.free.FreeOf  
arrow.free.FreePartialOf  
arrow.free.FreeSyntax  
arrow.Kind (extensions in package arrow.free)  
arrow.typeclasses.MonadFx (extensions in package arrow.free)  
arrow.free.StackSafeMonadContinuation  
arrow.free.StackSafeSyntax  
arrow.free.Trampoline  
arrow.free.TrampolineF Trampoline is often used to emulate tail recursion. The idea is to have some step code that can be trampolined itself to emulate recursion. The difference with standard recursion would be that there is no need to rewind the whole stack when we reach the end of the stack, since the first value returned that is not a trampoline would be directly returned as the overall result value for the whole function chain. That means Trampoline emulates what tail recursion does.
arrow.free.TrampolineFunctions  
arrow.free.Yoneda  
arrow.free.YonedaKindedJ  
arrow.free.YonedaOf  
arrow.free.YonedaPartialOf