Lemon
Functional language with inductive and coinductive types. Based on simply-typed lambda calculus augmented with sums, products, and mu and nu constructors for least (inductive) and greatest (coinductive) solutions to recursive type equations.