|LANGREITER.COM plain, simple|
Anwar Ghuloum: C for Throughput Computing (a.k.a. Ct)
It's certainly interesting to compare the Intel team's incrementalist vision ("work with [...] prevailing tools", "adoptable incrementally", don't "force the programmer to fundamentally change the algorithmic and data-container idioms") with the radical approach exemplified by Kx's K (re-write everything for every major version* and [usually] enjoy simplification and code mass reduction in the process [albeit often there wasn't much code mass to begin with]).
Future-Proof Data Parallel Algorithms and Software on Intel Multi-Core Architecture — Recommended reading.
Ct seems to trace its intellectual roots primarily to one of my favourite widely-unknown languages, NESL, and a variant of Lisp I heard of for the first time today: Paralation Lisp (paralation standing for "parallel relation"), developed by Gary Sabot while at Thinking Machines; if you have a look at the references section of the above-mentioned paper, you'll find APL well-represented as well.
* Admittedly, those come in at about ¾ per decade.
GET YOUR MOVE ON
ALMOST ALL ABOUT YOU
So log in, fella — or finally get your langreiter.com account. You always wanted one.
Nearby in the temporal dimension:
... and 67 of the anonymous kind.
Click on for a moderate dose of lcom-talk. This will probably not work in Lynx and other browser exotica.
RECENT EDITS (MORE)
Uncut Games bei Gameware
Offenlegung gem. §25 MedienG:
Christian Langreiter, Langkampfen