clinger

He's a self promoter, a clinger on, a man who lacks any substance, fits right in within the cryptocurrency space.

My inner-bitter clinger is going to go weep to Jesus now.

Exactly what to use instead is a bit of a tough nut to crack; you could extract musl’s floatscan code, or implement the Clinger algorithm yourself.

Edit: specifically for C, it would be hard to do it properly unless I had access to an implementation of Clinger and Steele & White.

That having been said, maybe you could do Clinger in the same afternoon; I’d be worried about edge cases, but simply put, I haven’t tried.

In all the fast yet maintainable MT systems I've built or worked on, the key idea (which Will Clinger stated clearly to me over lunch last fall) is to separate the mutable unshared data from the immutable shared data.

SO I guess my argument is that there is a fixed cost to reliable software to the business - it should either pay for highly reliable software, or it should pay the saved cash to the code clinger for each time the server goes down.

I stayed that long, not because I'm a "clinger," but because I was damn good at my job, and they valued me.

Statements like that are more or less like saying "Battletoads players will happily smash into barriers on bikes/surfboards/planes/clinger-winger", or "internal combustion engines will happily pass unburned fuel".

One of the earliest "tree shaker" might be the "selective linker" of MacScheme (an early Scheme implementation for the Apple Macintosh), which was developed in 1985 by William Clinger.

He doesn't even mention Clinger's explicit renaming macros which solve the problem without using a DSL (an approach which he derides).

A formal definition of proper tail recursion can be found in Clinger's paper [5].

This set off a *bit trend, including Gambit and also Will Clinger's Twobit.