But, if you insist:
> Ada does not have parametric polymorphism.
Yes, it does. [1][2] It's supported through the use of generic units.
> Ada does not have ... algebraic data types
Ada does have tagged records, and other variant types, and has had for quite some time. [0] They aren't quite Sum Types, but are incredibly close.
> Ada does not have... Objective-C interoperability
GNAT does. It's part of the GNU Compiler Collection, and as such, can be linked against other languages supported by the toolchain. GCC also supports Objective-C.
[0] http://archive.adaic.com/standards/83rat/html/ratl-04-07.htm...
[1] https://rosettacode.org/wiki/Parametric_polymorphism#Ada
[2] https://en.wikibooks.org/wiki/Ada_Programming/Generics#Param...
Yay! :-)
One thing that's probably almost unknown these days is that Objective-<X> was always supposed to be something you can easily add to any <X>, and in fact there were quite a few of these, including Objective-Assembler.
Ada 2012 probably even has more generic data containers on their standard library than Swift.
ADTs can be done via tagged records.
That's interesting, I did not know that.
From a quick glance it appears they do not have bounded polymorphism ("protocol-constrained generic parameters"), associated types, or existential types ("values of protocol type"). So for example if you have a generic Set data type you would have to pass in an equality and hash function to each operation instead of saying that the element type is Hashable, etc.
The explicit instantiation looks quaint, but it reminds me of ML functors for some reason:
procedure Instance_Swap is new Swap (Float);You can use abstract classes and interfaces for that.
They wanted something safe for embedded, and the original specification in '83 included generics, so you could handle data structures in a nice, safe, performant manner.