I have a language that is an experimental pure lazy functional programming language with a type system whose types are unions, not necessarily disjoint, of allo

I have a language that is an experimental pure lazy functional programming language with a type system whose types are unions, not necessarily disjoint, of allowable value constructors. The syntax is S-expressions, so it kind of looks like Lisp but runs like a Haskell/Smalltalk mash-up. Someday I'll write it up, but I'm presently working at a company that claims ownership of everything I ever think about, so it's kind of on hold for now.