barubary

@devilish666 C++ (non-stupid):

#include <stdio.h>
int main() {
puts("Hello, world!");
}

Prost! 🍻

C) It's an obvious joke.

s/diplomated/graduate/
s/branche/industry (sector)/

Isn't that how B worked?

Similarly, Perl lets you say

my $ret = do {    if (...) {        ...    } else {        ...    }};

To be fair, the C example could be detangled a lot by introducing a typedef:

typedef int Callback_t(int, int);Callback_t *(*fp)(Callback_t *, int);

Both of those declarations look weird to me. In Haskell it would be:

a :: Stringbob :: (String, Int, Double) -> [String]bob (a, b, c) = ...

... except that makes bob a function taking a tuple and it's much more idiomatic to curry it instead:

bob :: String -> Int -> Double -> [String]bob a b c = ...-- syntactic sugar for:-- bob = \a -> \b -> \c -> ...

The [T] syntax also has a prefix form [] T, so [String] could also be written [] String.

OCaml makes the opposite choice. In OCaml, a list of strings would be written string list, and a set of lists of strings would be string list set, a list of lists of integers int list list, etc.

Because let x: y is syntactically unambiguous, but you need to know that y names a type in order to correctly parse y x. (Or at least that's the case in C where a(b) may be a variable declaration or a function call depending on what typedefs are in scope.)

include Hebrew in their language, because I guess they were feeling kabbalistic

... or because the developers were Israeli: https://en.wikipedia.org/wiki/Zend/_(company)#History

I am 100% confident that your claim is factually wrong.

I agree with your core point, but no software is intuitive.