My personal favorite acronym like that definitely goes to AROS (Amiga Research Operating System) that if I remember correctly had to - for legal reasons - change the name. Rather than come up with a completely new name, went with AROS Research Operating System.
Edit: name change was apparently to avoid any trademark issues with the Amiga name.
40Acorn/ARM apparently did much the same thing.
4i refuse to call it advanced risc Machine, it's always Acorn Risc Machine
4
GTK = GNU's Not Unix Image Manipulation Program Tool Kit
35I wrote a rule engine for processing data called ORE - ORE Rule Engine I wanted to call it Odoyle Rules Engine. It had a QueryTracker, that had a RulesAppliedQueue aka a QT with a RAQ. This is what happens when you have 4 friends from college working in a 4 pack office.
7
my favorite fact about Wine is that they could've named it Pine, Dine, Fine, Line, etc
25It’s a cheeky play on “WINdows Emulator” as well as “WINE’s Is Not an Emulator”, but I think for both legal (trademark) and logistical (it really isn’t an emulator) reasons, you’ll never officially see that bit sanctioned
24Pine was already taken by an email reader. One of the early ascii email readers was called elm, for ELectronic Mail. Pine was made after elm and it stands for Pine Is Not Elm.
7I'm starting to get the impression that most software older than me is defined more by what it isn't than by what it is.
4
My favorite software acronym is PINCE, the reverse engineering tool that's similar to Cheat Engine in Winblols, that stands for PINCE Is Not Cheat Engine.
17Well looks like I finally found a cheat engine equivalent for Linux
7Sadly not, Cheat Engine has a whole lot more features. PINCE is still very good though
3Game Conqueror also works, but is missing a lot of features too from what I can tell. Don't know how it holds up against PINCE.
I've had success getting CE to run with Proton though, specifically by using SteamTinkerLaunch to run it as additional custom command with the game. There are other ways too, like protontricks. In my experience, it has been mostly stable, with the occasional freeze, but generally usable for pointer scanning and such.
3
You can wine about it all day - it still isn't an emulator.
12Some day when x86 is a thing no one has anymore, they're going to put x86 emulation in wine and then it'll actually be an emulator.
3Well then, I guess our ideology doesn't translate into the same meaning.
2
GNU Hurd.
It's time [to] explain the meaning of "Hurd". "Hurd" stands for "Hird of Unix-Replacing Daemons". And, then, "Hird" stands for "Hurd of Interfaces Representing Depth". We have here, to my knowledge, the first software to be named by a pair of mutually recursive acronyms.
– Thomas (then Michael) Bushnell
10And then they slapped the GNU's not UNIX infront for good measure
4LoL I guess acronyms that repeat on itself are a common thing in Linux
1
A Criminal Regiment Of Nasty Young Men
9HURD moment
8True is not cause it not emulating CPU/GPU of a different device, is more like a translator of sorts as it translates windows modules like directx and stuff in a way that Linux can interpret them and use them!
8Yaml ain't markup language
8It kind of is though.
8Not really. It is just translating the Windows system API calls into Linux system API calls. It's not emulating Windows, it's an entirely different implementation that doesn't necessarily match that of Microsoft's implementation. It had it own workarounds to make buggy code work.
You wouldn't call a Java Virtual Machine an emulator of another JVM either, they're just different implementations of the same specification.
23Thing is, I do kind of think of a JVM as an emulator for a processor that doesn't exist.
WINE kind of blurs the line of a traditional emulator by having the executable run natively on the target machine's CPU, but everything it does in regards to dealing with the host OS, the display, disk access, etc, is emulated as far as I'm aware.
A theoretical PS4 or Xbox One emulator running on x86 hardware could be just as much of an emulator as WINE is.
10I'd call a JVM an emulator. To the end user they're the same.
5
WINaE! It bugs me that it isn't "Wine Is Not Emulation"
7WINE Is No Emulator
10"This is no emulator, boy. No emulator."
1
Of course not! It's a drink!
7wine = iterate (++" Is Not an Emulator") "WINE"5Internal errors - invalid parameters received5Sorry, I should've specified, it's in Haskell. Idk where you tried running it.
4
I've never worked with Haskell, but I've been meaning to expand my programming repertoire (particularly since I don't get to do much coding at work, let alone learn new languages) and this makes for a nice opportunity, so I wanna try to parse this / guess at the syntax.
I assume
iterate function argapplies somefunctiontoargrepeatedly, presumably until some exit condition is met? Or does it simply create an infinite, lazily evaluated sequence?( )would be an inline function definition then, in this case returning the result of applying++suffixto its argument (which other languages might phrase something likearg += suffix), thereby appending " Is Not an Emulator" to the function argument, which is initially "WINE".So as a result, the code would produce an infinite recurring "WINE Is Not an Emulator Is Not an Emulator..." string. If evaluated eagerly, it would result in an OOM error (with tail recursion) or a stack overflow (without). If evaluated lazily, it would produce a lazy string, evaluated only as far as it is queried (by some equivalent of a
headfunction reading the first X characters from it).How far off am I? What pieces am I missing?
4You're pretty much right on the money. In Haskell, a
Stringis a type synonym for[Char], so we can use the list concatenation function++to join strings.++is an infix function i.e.[1,2,3] ++ [3,4,5] = [1,2,3,3,4,5](which will be equivalent to doing(++) [1,2,3] [3,4,5]by virtue of how infix functions work in Haskell). When we do(++ "a"), we create a partially applied function. Now, we can supply another string to it and it will add"a"at the end of it.iterate f xproduces a lazily evaluated sequence[x, f x, f f x, ...]. So, to get the nth entry, we can dowine !! nwhere we use another infix function!!. With partial application, we can modify the definition ofwineto create a function that takes anIntn and spits out the nth entry of it by doingwine = (!!) $ iterate (++" Is Not an Emulator") "WINE"We needed to wrap the
!!inside parentheses because it's an infix function.$just changes the order of application. (IIRC, it's the least significant function.) You can think that we're wrapping whatever's on the right of the$by parentheses. Now we can dowine 2instead ofwine !! 2to get"WINE Is Not an Emulator Is Not an Emulator".I'm by no means a Haskell expert. (I'm not even a professional programmer lol.) So, if someone would like to add some more details, they're more than welcome.
Edit: A much more readable version might be
wine 0 = "WINE" wine n = wine (n-1) ++ " Is Not an Emulator"2
I've always thought of this
1When it bears repeating, let's make it recursive.
1PHP Hypertext Protocol
1
