Re: [Haskell-cafe] FP design

I typically start with a list of the types I want, then the minimal list of type signatures. Ideally, it should be possible to write an arbitrarily large set of programs in the given application domain by composing this initial list of functions (so the data type can be specified abstractly, if desired).

And if we translate that paragraph into, say, Erlang, what will we get? It seems that we will get a lot of tests instead of types. Or a lot of (pre/post)predicates about values.