I guess it depends on your definition of "allowed" vs "required". I believe that in commercial aerospace applications a device change (e.g. change of manufacturing process or process parameters, let alone different masks) would require the entire assembly to be recertified. That's why Boeing procures all spares for the product lifetime up front.
At some point, I'd assume that beggars can't be choosers. If the new chip works and does not introduce issues while still allowing the plane to continue to fly, I'm guessing they'll take the plane still flying.
If you are expecting someone to learn a completely new notational language before you can communicate a basic algorithm, you have gone wrong somewhere.
You could also similarly write down merge sort in pure lambda calculus, which is interesting as an exercise, but not especially useful as working code, or as a way to explain how merge sort works.
Likely because whilst it didn't work out commercially, the ideas smalltalk, prolog and other more esoteric languages (forth, apl) focus on are themselves very interesting.
I thought IBM were still focused on APL in the 70s…