pdexter

Haskell doesn't require top level type definitions.

How were the diagrams made?

charles schwab did that up to about 4 or 5 years ago

Random question, but how did they get the source code highlighting in that doc?

We're software developers after all.

I feel sad knowing that what I've trained for and my passion aren't helpful at all to fixing this crisis.

That sounds more like an implementation detail, in most cases. By this metric Haskell wouldn't be a functional language.

Is this automated?

Sounds like datalog could fit this bill

Interesting. Can you give an example of generic algorithms plus custom types, in practice? Off the top of my head I thought that any dynamic language or static language with good genetics would have this property, but maybe there's something that Julia does differently.

Yeah I think rust has better defaults here.

C-- is one of the stages of its compilation to a binary IIRC. I wouldn't say it "can transpile to C--", as if C-- is an optional target which the user then does something else with.