A language without recursion. It can only be implemented through folding (catamorphism) and unfolding (anamorphism). You can't define recursive type either. You have to use mu type.
I don't know what benefit such language would have. Though, it would be a good exercise to implement common function as algebra/co-algebra.
