3 ms·

A couple of suggestions: Immutable Data Structures. And perhaps something that captures the kind of type inference Haskell/Elm/etc. can do. Not sure if they're

by zellyn 8y ago

A couple of suggestions: Immutable Data Structures. And perhaps something that captures the kind of type inference Haskell/Elm/etc. can do. Not sure if they're big enough to compete with something like B-trees :-)

tuukkah 8y ago
Yes, the Hindley-Milner type system: https://en.m.wikipedia.org/wiki/Hindley–Milner_type_system https://en.m.wikipedia.org/wiki/Hindley–Milner_type_system
- fouc 8y ago
  It would be nice if the LISP section was fleshed out a bit more with references to all the innovations in that.