{"exhaustive":{"nbHits":false,"typo":false},"exhaustiveNbHits":false,"exhaustiveTypo":false,"hits":[{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"LeCompteSftware"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"&quot;Yes they crashed into a wall and all died, whereas you steered around it, but you must acknowledge that they crashed twice as quickly as you didn't crash. If you were driving their car, you would have just slowed them down.&quot;<p>People should have read to the end of &quot;Building a <em>C</em> <em>compiler</em> with a team of <em>parallel</em> <em>Claudes</em>&quot;[1]:<p><pre><code>  The resulting <em>compiler</em> has nearly reached the limits of Opus [4.6]\u2019s abilities. I tried (hard!) to fix several of the above limitations but wasn\u2019t fully successful. New features and bugfixes frequently broke existing functionality.\n</code></pre>\n&quot;tried (hard!)&quot; is very ominous. I wonder how Mythos would fare. Presumably it would get further, maybe much further. But I strongly doubt the &quot;frequently broke existing functionality&quot; problem was solved. Eventually humans have to understand the most difficult parts of the code. Good luck with that!<p>[1] <a href=\"https://www.anthropic.com/engineering/building-c-compiler\" rel=\"nofollow\">https://www.anthropic.com/engineering/building-<em>c</em>-<em>compiler</em></a>"},"story_title":{"matchLevel":"none","matchedWords":[],"value":"I\u2019m spending months coding the old way"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://miguelconner.substack.com/p/im-coding-by-hand"}},"_tags":["comment","author_LeCompteSftware","story_47807583"],"author":"LeCompteSftware","comment_text":"&quot;Yes they crashed into a wall and all died, whereas you steered around it, but you must acknowledge that they crashed twice as quickly as you didn&#x27;t crash. If you were driving their car, you would have just slowed them down.&quot;<p>People should have read to the end of &quot;Building a C compiler with a team of parallel Claudes&quot;[1]:<p><pre><code>  The resulting compiler has nearly reached the limits of Opus [4.6]\u2019s abilities. I tried (hard!) to fix several of the above limitations but wasn\u2019t fully successful. New features and bugfixes frequently broke existing functionality.\n</code></pre>\n&quot;tried (hard!)&quot; is very ominous. I wonder how Mythos would fare. Presumably it would get further, maybe much further. But I strongly doubt the &quot;frequently broke existing functionality&quot; problem was solved. Eventually humans have to understand the most difficult parts of the code. Good luck with that!<p>[1] <a href=\"https:&#x2F;&#x2F;www.anthropic.com&#x2F;engineering&#x2F;building-c-compiler\" rel=\"nofollow\">https:&#x2F;&#x2F;www.anthropic.com&#x2F;engineering&#x2F;building-c-compiler</a>","created_at":"2026-04-18T14:39:27Z","created_at_i":1776523167,"objectID":"47816271","parent_id":47813625,"story_id":47807583,"story_title":"I\u2019m spending months coding the old way","story_url":"https://miguelconner.substack.com/p/im-coding-by-hand","updated_at":"2026-04-19T22:51:27Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"underdeserver"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"&gt; when agents started to compile the Linux kernel, they got stuck. [...] Every agent would hit the same bug, fix that bug, and then overwrite each other's changes.<p>&gt; [...] The fix was to use GCC as an online known-good <em>compiler</em> oracle to compare against. I wrote a new test harness that randomly compiled most of the kernel using GCC, and only the remaining files with <em>Claude's</em> <em>C</em> <em>Compiler</em>. If the kernel worked, then the problem wasn\u2019t in <em>Claude\u2019s</em> subset of the files. If it broke, then it could further refine by re-compiling some of these files with GCC. This let each agent work in <em>parallel</em><p>This is a remarkably creative solution! Nicely done."},"story_title":{"fullyHighlighted":false,"matchLevel":"partial","matchedWords":["c","compiler"],"value":"We tasked Opus 4.6 using agent teams to build a <em>C</em> <em>Compiler</em>"},"story_url":{"fullyHighlighted":false,"matchLevel":"partial","matchedWords":["c","compiler"],"value":"https://www.anthropic.com/engineering/building-<em>c</em>-<em>compiler</em>"}},"_tags":["comment","author_underdeserver","story_46903616"],"author":"underdeserver","comment_text":"&gt; when agents started to compile the Linux kernel, they got stuck. [...] Every agent would hit the same bug, fix that bug, and then overwrite each other&#x27;s changes.<p>&gt; [...] The fix was to use GCC as an online known-good compiler oracle to compare against. I wrote a new test harness that randomly compiled most of the kernel using GCC, and only the remaining files with Claude&#x27;s C Compiler. If the kernel worked, then the problem wasn\u2019t in Claude\u2019s subset of the files. If it broke, then it could further refine by re-compiling some of these files with GCC. This let each agent work in parallel<p>This is a remarkably creative solution! Nicely done.","created_at":"2026-02-05T22:03:51Z","created_at_i":1770329031,"objectID":"46906028","parent_id":46903616,"story_id":46903616,"story_title":"We tasked Opus 4.6 using agent teams to build a C Compiler","story_url":"https://www.anthropic.com/engineering/building-c-compiler","updated_at":"2026-03-05T23:30:43Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"cataflam"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"&gt; Nicholas Carlini, a researcher at Anthropic, orchestrated 16 <em>parallel</em> <em>Claude</em> agents to write a production <em>C</em> <em>compiler</em> in Rust.<p>To write a proof-of-concept <em>C</em> <em>compiler</em>, not a production-grade one...<p>Hard to take the article seriously after this"},"story_title":{"matchLevel":"none","matchedWords":[],"value":"If AI writes your code, why use Python?"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://medium.com/@NMitchem/if-ai-writes-your-code-why-use-python-bf8c4ba1a055"}},"_tags":["comment","author_cataflam","story_48100433"],"author":"cataflam","children":[48108459,48108573],"comment_text":"&gt; Nicholas Carlini, a researcher at Anthropic, orchestrated 16 parallel Claude agents to write a production C compiler in Rust.<p>To write a proof-of-concept C compiler, not a production-grade one...<p>Hard to take the article seriously after this","created_at":"2026-05-12T13:55:51Z","created_at_i":1778594151,"objectID":"48108375","parent_id":48100433,"story_id":48100433,"story_title":"If AI writes your code, why use Python?","story_url":"https://medium.com/@NMitchem/if-ai-writes-your-code-why-use-python-bf8c4ba1a055","updated_at":"2026-05-12T16:50:49Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"claudeCfail"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"I wouldn't overthink TFA. I mean, look at one of the examples of progress they gave:<p>&gt; Nicholas Carlini, a researcher at Anthropic, orchestrated 16 <em>parallel</em> <em>Claude</em> agents to write a production <em>C</em> <em>compiler</em> in Rust. 100,000 lines. It boots Linux 6.9 on x86, ARM, and RISC-V. It compiles QEMU, FFmpeg, SQLite, PostgreSQL, and Redis. It runs Doom. Total cost: just under $20,000 across nearly 2,000 <em>Claude</em> Code sessions.<p>Anyone who spends even 10% of an unhealthy tome on Hackernews should be able to confidentially say: It didn't boot, it didn't compile, and it did not run a Hello World, much less doom. It was a 20 thousand dollar fiasco and a joke.<p><a href=\"https://news.ycombinator.com/item?id=46941603\">https://news.ycombinator.com/item?id=46941603</a><p>Of course you want code you can read. You live in the real world, and have a real world use case. One where you haven't yet learned to review Rust code. TFA does not live there."},"story_title":{"matchLevel":"none","matchedWords":[],"value":"If AI writes your code, why use Python?"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://medium.com/@NMitchem/if-ai-writes-your-code-why-use-python-bf8c4ba1a055"}},"_tags":["comment","author_claudeCfail","story_48100433"],"author":"claudeCfail","comment_text":"I wouldn&#x27;t overthink TFA. I mean, look at one of the examples of progress they gave:<p>&gt; Nicholas Carlini, a researcher at Anthropic, orchestrated 16 parallel Claude agents to write a production C compiler in Rust. 100,000 lines. It boots Linux 6.9 on x86, ARM, and RISC-V. It compiles QEMU, FFmpeg, SQLite, PostgreSQL, and Redis. It runs Doom. Total cost: just under $20,000 across nearly 2,000 Claude Code sessions.<p>Anyone who spends even 10% of an unhealthy tome on Hackernews should be able to confidentially say: It didn&#x27;t boot, it didn&#x27;t compile, and it did not run a Hello World, much less doom. It was a 20 thousand dollar fiasco and a joke.<p><a href=\"https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=46941603\">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=46941603</a><p>Of course you want code you can read. You live in the real world, and have a real world use case. One where you haven&#x27;t yet learned to review Rust code. TFA does not live there.","created_at":"2026-05-12T07:53:06Z","created_at_i":1778572386,"objectID":"48105443","parent_id":48105166,"story_id":48100433,"story_title":"If AI writes your code, why use Python?","story_url":"https://medium.com/@NMitchem/if-ai-writes-your-code-why-use-python-bf8c4ba1a055","updated_at":"2026-05-12T08:10:00Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"deng"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"&gt; Nicholas Carlini, a researcher at Anthropic, orchestrated 16 <em>parallel</em> <em>Claude</em> agents to write a production <em>C</em> <em>compiler</em> in Rust.<p>No he didn't. The <em>compiler</em> is bascially useless as it produces vastly inferior code than gcc/clang."},"story_title":{"matchLevel":"none","matchedWords":[],"value":"If AI writes your code, why use Python?"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://medium.com/@NMitchem/if-ai-writes-your-code-why-use-python-bf8c4ba1a055"}},"_tags":["comment","author_deng","story_48100433"],"author":"deng","comment_text":"&gt; Nicholas Carlini, a researcher at Anthropic, orchestrated 16 parallel Claude agents to write a production C compiler in Rust.<p>No he didn&#x27;t. The compiler is bascially useless as it produces vastly inferior code than gcc&#x2F;clang.","created_at":"2026-05-12T05:41:40Z","created_at_i":1778564500,"objectID":"48104623","parent_id":48100433,"story_id":48100433,"story_title":"If AI writes your code, why use Python?","story_url":"https://medium.com/@NMitchem/if-ai-writes-your-code-why-use-python-bf8c4ba1a055","updated_at":"2026-05-12T10:57:46Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"vbcherepanov"},"title":{"fullyHighlighted":false,"matchLevel":"partial","matchedWords":["parallel","claudes"],"value":"What 16 <em>Parallel</em> <em>Claude</em> Agents Built Around Themselves"},"url":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"https://medium.com/@vbcherepanov/what-16-<em>parallel</em>-<em>claude</em>-agents-built-around-themselves-deconstructing-anthropics-<em>c</em>-<em>compiler</em>-f2fa6335b1ca"}},"_tags":["story","author_vbcherepanov","story_48075986"],"author":"vbcherepanov","children":[48075987],"created_at":"2026-05-09T15:58:11Z","created_at_i":1778342291,"num_comments":1,"objectID":"48075986","points":3,"story_id":48075986,"title":"What 16 Parallel Claude Agents Built Around Themselves","updated_at":"2026-05-09T16:33:07Z","url":"https://medium.com/@vbcherepanov/what-16-parallel-claude-agents-built-around-themselves-deconstructing-anthropics-c-compiler-f2fa6335b1ca"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"MrMetric"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"Now, when you say no libraries, exactly how far does that go? I unfortunately, a couple years ago, suffered through insisting I wanted to use <em>C</em>++ without the standard libraries, not even crt0, and finding documentation on how anything works was a huge pain in the ass.<p>Actually, what sold me on bothering with LLMs was asking one, last year, how to call a kernel syscall with GCC's inline assembly syntax, and seeing the answer be exactly what I needed... <i>after</i> I had already cobbled everything together myself! (I do not consider random mailing list archives to be adequate documentation!)<p>I didn't mean to say you should have an AI inspect your code, though. (I've personally found value in that technique, because current frontier models can recognize problems way better than their lackluster ability to avoid writing those same problems repeatedly into their own disgusting code. I can still just write the code myself, with another eye on it.)<p>I just really like fuzzing and really like differential analysis. For example, one of the images in my test suite decodes to one set of pixels with FFmpeg, libpng, stb_image, among others, and decodes to a different set of pixels with libspng, lodepng, Java's ImageIO, and other others (as far as I can tell, the reason is ambiguous 2nd-ed spec wording that isn't obviously ambiguous when you read it). You can quite easily fuzz one implementation against another, running them in <em>parallel</em> against the same inputs, and make a mismatch crash the test runner so the fuzzer flags an error.<p>Incidentally, asking <em>Claude</em> Fable 5 to do that usually triggers a cybersecurity block for me. Another point in favor of knowing things by hand...<p>Not that I'm saying you should drop everything and do this. I just like talking about it. Learning-experience projects get easily spoiled by trying too hard, which I did learn the hard way. Then again, I hella enjoyed practicing becoming aware of code coverage when I wrote a few prototype <em>compilers</em>. Researching online when I was making my first one is how I learned about Jonathan Blow and Casey Muratori, by the way. I don't follow Handmade Hero, but I do wholeheartedly approve of its existence.<p><pre><code>  I also loved tutorials in the 90s like &quot;build your own OS&quot;, &quot;build your own bootloader&quot;, &quot;build your own <em>C</em> <em>compiler</em>&quot;, etc; build your own printf(), your own malloc, etc. Learned a lot this way!\n</code></pre>\nYou must be older than me! I was <i>born</i> in the 90s, and the usual reaction I expect to saying I built my own memory allocator is incredulity because &quot;why make something that already exists?&quot; or &quot;ew, you should've used Rust&quot;.<p>I haven't run across that Carmack quote before, but I've told plenty of people the same thing in my own words. I think one of the most important parts of it that I've learned is this: You can't get something right without screwing it up first. I don't mean that making mistakes is a goal to target. I mean that you <i>can't</i> learn without the errors along the way. If you're always right the first time, that's just luck, and you haven't <i>learned</i> yet.<p>And I must say, I miss the days when &quot;grok&quot; was a weird word some programmers use, not an AI brand.<p>Anyway, I'd be quite curious to see your project if you ever put it up in public. I wouldn't worry about polishing it, really. In high school, I still didn't know people normally write rough drafts of stories and draw sketches long before making the finished piece. Never saw any of that, so I thought my inability to &quot;oneshot&quot; these things with the results of a high-skill artist meant inherent lack of talent. If all you ever see is finished refined products, how can you possibly know better?"},"story_title":{"matchLevel":"none","matchedWords":[],"value":"Ask HN: What are you working on? (November 2026)"}},"_tags":["comment","author_MrMetric","story_50417407"],"author":"MrMetric","children":[50426436],"comment_text":"Now, when you say no libraries, exactly how far does that go? I unfortunately, a couple years ago, suffered through insisting I wanted to use C++ without the standard libraries, not even crt0, and finding documentation on how anything works was a huge pain in the ass.<p>Actually, what sold me on bothering with LLMs was asking one, last year, how to call a kernel syscall with GCC&#x27;s inline assembly syntax, and seeing the answer be exactly what I needed... <i>after</i> I had already cobbled everything together myself! (I do not consider random mailing list archives to be adequate documentation!)<p>I didn&#x27;t mean to say you should have an AI inspect your code, though. (I&#x27;ve personally found value in that technique, because current frontier models can recognize problems way better than their lackluster ability to avoid writing those same problems repeatedly into their own disgusting code. I can still just write the code myself, with another eye on it.)<p>I just really like fuzzing and really like differential analysis. For example, one of the images in my test suite decodes to one set of pixels with FFmpeg, libpng, stb_image, among others, and decodes to a different set of pixels with libspng, lodepng, Java&#x27;s ImageIO, and other others (as far as I can tell, the reason is ambiguous 2nd-ed spec wording that isn&#x27;t obviously ambiguous when you read it). You can quite easily fuzz one implementation against another, running them in parallel against the same inputs, and make a mismatch crash the test runner so the fuzzer flags an error.<p>Incidentally, asking Claude Fable 5 to do that usually triggers a cybersecurity block for me. Another point in favor of knowing things by hand...<p>Not that I&#x27;m saying you should drop everything and do this. I just like talking about it. Learning-experience projects get easily spoiled by trying too hard, which I did learn the hard way. Then again, I hella enjoyed practicing becoming aware of code coverage when I wrote a few prototype compilers. Researching online when I was making my first one is how I learned about Jonathan Blow and Casey Muratori, by the way. I don&#x27;t follow Handmade Hero, but I do wholeheartedly approve of its existence.<p><pre><code>  I also loved tutorials in the 90s like &quot;build your own OS&quot;, &quot;build your own bootloader&quot;, &quot;build your own C compiler&quot;, etc; build your own printf(), your own malloc, etc. Learned a lot this way!\n</code></pre>\nYou must be older than me! I was <i>born</i> in the 90s, and the usual reaction I expect to saying I built my own memory allocator is incredulity because &quot;why make something that already exists?&quot; or &quot;ew, you should&#x27;ve used Rust&quot;.<p>I haven&#x27;t run across that Carmack quote before, but I&#x27;ve told plenty of people the same thing in my own words. I think one of the most important parts of it that I&#x27;ve learned is this: You can&#x27;t get something right without screwing it up first. I don&#x27;t mean that making mistakes is a goal to target. I mean that you <i>can&#x27;t</i> learn without the errors along the way. If you&#x27;re always right the first time, that&#x27;s just luck, and you haven&#x27;t <i>learned</i> yet.<p>And I must say, I miss the days when &quot;grok&quot; was a weird word some programmers use, not an AI brand.<p>Anyway, I&#x27;d be quite curious to see your project if you ever put it up in public. I wouldn&#x27;t worry about polishing it, really. In high school, I still didn&#x27;t know people normally write rough drafts of stories and draw sketches long before making the finished piece. Never saw any of that, so I thought my inability to &quot;oneshot&quot; these things with the results of a high-skill artist meant inherent lack of talent. If all you ever see is finished refined products, how can you possibly know better?","created_at":"2026-11-09T14:17:52Z","created_at_i":1794233872,"objectID":"50425994","parent_id":50425317,"story_id":50417407,"story_title":"Ask HN: What are you working on? (November 2026)","updated_at":"2026-11-09T14:51:52Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"spacedcowboy"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"I'm writing a language called xc and its <em>compiler</em>, xcc for the last 6 months or so (full disclosure: with a lot of help from <em>Claude</em>). I've finally got version 1 (actually v1.0.1) out, for Linux (x86-64 and arm64, including the Pi 5), macOS and Windows.<p>The idea: you write an ordinary loop, the <em>compiler</em> works out whether it can run in <em>parallel</em>, and it emits both a multi-core CPU version and GPU kernels (MSL, PTX, SPIR-V or WGSL, all generated by xcc itself without needing an SDK installed).<p>At run time the program measures each block on that machine and keeps the faster placement.<p>Examples:<p>- On an M3 Max a Mandelbrot block takes 13.7 ms on all 16 cores and 1.3 ms on the GPU<p>- On a Ryzen 9955HX's 2-CU integrated Radeon the GPU loses to the 32 CPU threads, so it stays on the CPU.<p>The <em>compiler</em> also reads plain old <em>C</em> via clang's front end and does the same thing to <em>C</em> loops, with no pragmas. Comparing xcc to OpenMP for both gcc and clang (with the helping hand of &quot;#pragma omp <em>parallel</em> for&quot; gives (times in ms):<p><pre><code>                 xcc    gcc+omp  clang+omp\n  mandel_deep    371    2170     2231\n  mandelbrot     2.45   12.2     12.8\n  md5            9.39   16.1     13.4\n  md5_mask       8.17   12.1     13.4\n  nbody          0.45   1.29     9.92\n  perlin         5.87   4.38     7.05\n  saxpy          2.26   2.18     2.32\n</code></pre>\nGeometric mean: xcc is 2.1x faster than GCC+OpenMP and 3.0x faster than clang+OpenMP.<p>All the builds are checked to make sure they give the same result - no point having a benchmark that doesn't produce the same result! xcc has a notable win for nbody, because its vectorisation is better (across bodies) but perlin has been a bit of a bugbear throughout the leading-up-to-v1 timespan.<p>Platform-specific binary tarballs, the sources, OpenMP versions and method are on the site (linked from github), and there are Phoronix Test Suite profiles if you'd like to run them yourself.<p>It's only just made v1 so there's a few rough edges: <em>C</em>++ through clang is in-progress (but not official yet), and the Pi 5's GPU is slow. Not sure if that's the Pi or the code yet...<p>There's more to the language but I don't want this to be an essay! The real, honest-to-$deity cool thing is the <i>automatic</i> parallelising of standard <em>C</em>/xc loops and being able to run that code on the GPU with <i>no boilerplate</i> - &quot;ARC for Algorithms&quot; (what Objective-<em>C</em>'s ARC did for memory management), it &quot;just works&quot;.<p>Very keen to get feedback and fix any gaps. I think it's generally useful right now, but it is &quot;v1&quot; - Bug reports welcome as GitHub issues..."},"story_title":{"matchLevel":"none","matchedWords":[],"value":"Xc: Compile the same source for GPUs and CPUs"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://github.com/ThrudTheBarbarian/xc"}},"_tags":["comment","author_spacedcowboy","story_50487155"],"author":"spacedcowboy","comment_text":"I&#x27;m writing a language called xc and its compiler, xcc for the last 6 months or so (full disclosure: with a lot of help from Claude). I&#x27;ve finally got version 1 (actually v1.0.1) out, for Linux (x86-64 and arm64, including the Pi 5), macOS and Windows.<p>The idea: you write an ordinary loop, the compiler works out whether it can run in parallel, and it emits both a multi-core CPU version and GPU kernels (MSL, PTX, SPIR-V or WGSL, all generated by xcc itself without needing an SDK installed).<p>At run time the program measures each block on that machine and keeps the faster placement.<p>Examples:<p>- On an M3 Max a Mandelbrot block takes 13.7 ms on all 16 cores and 1.3 ms on the GPU<p>- On a Ryzen 9955HX&#x27;s 2-CU integrated Radeon the GPU loses to the 32 CPU threads, so it stays on the CPU.<p>The compiler also reads plain old C via clang&#x27;s front end and does the same thing to C loops, with no pragmas. Comparing xcc to OpenMP for both gcc and clang (with the helping hand of &quot;#pragma omp parallel for&quot; gives (times in ms):<p><pre><code>                 xcc    gcc+omp  clang+omp\n  mandel_deep    371    2170     2231\n  mandelbrot     2.45   12.2     12.8\n  md5            9.39   16.1     13.4\n  md5_mask       8.17   12.1     13.4\n  nbody          0.45   1.29     9.92\n  perlin         5.87   4.38     7.05\n  saxpy          2.26   2.18     2.32\n</code></pre>\nGeometric mean: xcc is 2.1x faster than GCC+OpenMP and 3.0x faster than clang+OpenMP.<p>All the builds are checked to make sure they give the same result - no point having a benchmark that doesn&#x27;t produce the same result! xcc has a notable win for nbody, because its vectorisation is better (across bodies) but perlin has been a bit of a bugbear throughout the leading-up-to-v1 timespan.<p>Platform-specific binary tarballs, the sources, OpenMP versions and method are on the site (linked from github), and there are Phoronix Test Suite profiles if you&#x27;d like to run them yourself.<p>It&#x27;s only just made v1 so there&#x27;s a few rough edges: C++ through clang is in-progress (but not official yet), and the Pi 5&#x27;s GPU is slow. Not sure if that&#x27;s the Pi or the code yet...<p>There&#x27;s more to the language but I don&#x27;t want this to be an essay! The real, honest-to-$deity cool thing is the <i>automatic</i> parallelising of standard C&#x2F;xc loops and being able to run that code on the GPU with <i>no boilerplate</i> - &quot;ARC for Algorithms&quot; (what Objective-C&#x27;s ARC did for memory management), it &quot;just works&quot;.<p>Very keen to get feedback and fix any gaps. I think it&#x27;s generally useful right now, but it is &quot;v1&quot; - Bug reports welcome as GitHub issues...","created_at":"2026-11-13T17:53:42Z","created_at_i":1794592422,"objectID":"50487156","parent_id":50487155,"story_id":50487155,"story_title":"Xc: Compile the same source for GPUs and CPUs","story_url":"https://github.com/ThrudTheBarbarian/xc","updated_at":"2026-11-13T19:12:36Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"spacedcowboy"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"No it doesn't<p>But if I have to intervene at every fricking point along the way from frozen patty to cooked burger, if I have to tell the worker not to drop the patty on the floor and continue cooking it, which dials to turn on which machines, how long to leave the thing cooking at this stage, if I have to have the holistic knowledge (if not the details of the PID loop for the heating element), then it's a lot more than &quot;calling for a burger&quot;.<p>&quot;I&quot; wrote a <em>compiler</em> with help from <em>Claude</em> - it's not the first <em>compiler</em> I've written, probably won't be the last, but it's a damn sight easier to tell the machine to implement LICM or to specify the requirements of the SSA invariants rather than actually do it myself.<p>Here\u2019s the full and complete source of a GPU-powered Mandelbrot program:<p><pre><code>     #use &quot;Stdio.xc&quot;\n     #use &quot;Par.xc&quot;\n     #import &quot;../src/include/bench_time.xc&quot;\n\n     #define W 2048\n     #define SIZE (W * W)\n\n     i32 main(void)\n     {\n     // Eight runs: the first carries one-off costs (a GPU builds its kernel\n     // then), so the figure is the best run; the first is printed too. Auto\n     // decides after its fourth (two on each device), and uses the rest.\n     u32 total = 0;\n     i64 best = 0;\n     i64 first = 0;\n     for (u32 rep in 0..8)\n        {\n        total = 0;\n        i64 t0 = bench_now_us();\n        par mandel :reduce(+ total)\n            {\n            for (u32 i in 0..SIZE)\n                {\n                float cx = (float)(i % W) * (3.0f / 2048.0f) - 2.0f;\n                float cy = (float)(i / W) * (3.0f / 2048.0f) - 1.5f;\n                float x = 0.0f;\n                float y = 0.0f;\n                u32 k = 0;\n                while (k &lt; 256 &amp;&amp; x * x + y * y &lt; 4.0f)\n                    {\n                    float xt = x * x - y * y + cx;\n                    y = 2.0f * x * y + cy;\n                    x = xt;\n                    k = k + 1;\n                    }\n                total = total + k;\n                }\n            }\n        i64 t1 = bench_now_us();\n        if (rep == 0)\n            first = t1 - t0;\n        if (rep == 0 || t1 - t0 &lt; best)\n            best = t1 - t0;\n        }\n     printf(&quot;%u %lld %lld\\n&quot;, (total + 500000) / 1000000, best, first);\n     return 0;\n     }\n</code></pre>\nJust one line in that source code is what turns it from a bog-standard <em>C</em>-like program into a GPU kernel, automatically tracked, scheduled, and all data hazards transparently managed.<p>On my M4 max, that one line of code takes it from 481ms to 1.6ms. All \u2018par\u2019 does is say \u201cthis next block of code, call it \u201cmandel\u201d, is data-<em>parallel</em>, and for the \u2018total\u2019 variable all execution units should combine their output to that variable using +<p>No huge GPU boilerplate, no stream management for data transport from cpu to gpu and back, no memory barriers, no hassle. Just \u201chey, do this on the gpu\u201d.<p>GPU blocks are bound at runtime using the best design for the hardware on the machine, obtained by measuring it (if it hasn\u2019t been measured before). If it has, the cache is read. The user can always override, which is why \u2018par\u2019 blocks can be named.<p>One of the nice things about that is that if you find the bit you want to accelerate is too small to be useful, say the data-transport outweighs the computational speedup, (a) the runtime computer will figure that out and (b) you can hoist more code into the GPU if that's an option, to give it more work to do. The language is the same for both CPU and GPU so it's transparent...<p>The other thing is that the <em>compiler</em> will produce MSL, PTX for nvidia, SPIR-V and WGSL versions of the 'par' block, and since it's bound at runtime, you get support for pretty much everything.<p>What I'm looking at right now is multi-GPU systems. Consider a GPU to be a 'worker thread', and for each thread overlay the time spent uploading work units, the time spent computing, and the time spent downloading work results to the host. Now on Windows you only get 1 asynchronous copy engine for &quot;consumer&quot; GPUs like RTX {3|4|5}0x0 so there are limits, but MSL lets you have more I think and I haven't looked at AMD GPUs yet.<p>The thing that most people latch onto is the speed upgrade (419ms -&gt; 1.6ms) but the real story here is the simplicity - using any dedicated language (CUDA, MSL, ...) you write a load of boilerplate and you have to worry about data hazards etc. I think of this as similar to when Apple introduced ARC (Automatic Reference Counting) - prior to that, engineers were constantly having to manage their memory manually, and there cough were a lot of errors. ARC changed the game, and I think xc is &quot;ARC for GPUs&quot;."},"story_title":{"matchLevel":"none","matchedWords":[],"value":"AI is a tool and using it well takes skill"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://yyhh.org/blog/2026/10/ai-is-a-tool/"}},"_tags":["comment","author_spacedcowboy","story_50063427"],"author":"spacedcowboy","comment_text":"No it doesn&#x27;t<p>But if I have to intervene at every fricking point along the way from frozen patty to cooked burger, if I have to tell the worker not to drop the patty on the floor and continue cooking it, which dials to turn on which machines, how long to leave the thing cooking at this stage, if I have to have the holistic knowledge (if not the details of the PID loop for the heating element), then it&#x27;s a lot more than &quot;calling for a burger&quot;.<p>&quot;I&quot; wrote a compiler with help from Claude - it&#x27;s not the first compiler I&#x27;ve written, probably won&#x27;t be the last, but it&#x27;s a damn sight easier to tell the machine to implement LICM or to specify the requirements of the SSA invariants rather than actually do it myself.<p>Here\u2019s the full and complete source of a GPU-powered Mandelbrot program:<p><pre><code>     #use &quot;Stdio.xc&quot;\n     #use &quot;Par.xc&quot;\n     #import &quot;..&#x2F;src&#x2F;include&#x2F;bench_time.xc&quot;\n\n     #define W 2048\n     #define SIZE (W * W)\n\n     i32 main(void)\n     {\n     &#x2F;&#x2F; Eight runs: the first carries one-off costs (a GPU builds its kernel\n     &#x2F;&#x2F; then), so the figure is the best run; the first is printed too. Auto\n     &#x2F;&#x2F; decides after its fourth (two on each device), and uses the rest.\n     u32 total = 0;\n     i64 best = 0;\n     i64 first = 0;\n     for (u32 rep in 0..8)\n        {\n        total = 0;\n        i64 t0 = bench_now_us();\n        par mandel :reduce(+ total)\n            {\n            for (u32 i in 0..SIZE)\n                {\n                float cx = (float)(i % W) * (3.0f &#x2F; 2048.0f) - 2.0f;\n                float cy = (float)(i &#x2F; W) * (3.0f &#x2F; 2048.0f) - 1.5f;\n                float x = 0.0f;\n                float y = 0.0f;\n                u32 k = 0;\n                while (k &lt; 256 &amp;&amp; x * x + y * y &lt; 4.0f)\n                    {\n                    float xt = x * x - y * y + cx;\n                    y = 2.0f * x * y + cy;\n                    x = xt;\n                    k = k + 1;\n                    }\n                total = total + k;\n                }\n            }\n        i64 t1 = bench_now_us();\n        if (rep == 0)\n            first = t1 - t0;\n        if (rep == 0 || t1 - t0 &lt; best)\n            best = t1 - t0;\n        }\n     printf(&quot;%u %lld %lld\\n&quot;, (total + 500000) &#x2F; 1000000, best, first);\n     return 0;\n     }\n</code></pre>\nJust one line in that source code is what turns it from a bog-standard C-like program into a GPU kernel, automatically tracked, scheduled, and all data hazards transparently managed.<p>On my M4 max, that one line of code takes it from 481ms to 1.6ms. All \u2018par\u2019 does is say \u201cthis next block of code, call it \u201cmandel\u201d, is data-parallel, and for the \u2018total\u2019 variable all execution units should combine their output to that variable using +<p>No huge GPU boilerplate, no stream management for data transport from cpu to gpu and back, no memory barriers, no hassle. Just \u201chey, do this on the gpu\u201d.<p>GPU blocks are bound at runtime using the best design for the hardware on the machine, obtained by measuring it (if it hasn\u2019t been measured before). If it has, the cache is read. The user can always override, which is why \u2018par\u2019 blocks can be named.<p>One of the nice things about that is that if you find the bit you want to accelerate is too small to be useful, say the data-transport outweighs the computational speedup, (a) the runtime computer will figure that out and (b) you can hoist more code into the GPU if that&#x27;s an option, to give it more work to do. The language is the same for both CPU and GPU so it&#x27;s transparent...<p>The other thing is that the compiler will produce MSL, PTX for nvidia, SPIR-V and WGSL versions of the &#x27;par&#x27; block, and since it&#x27;s bound at runtime, you get support for pretty much everything.<p>What I&#x27;m looking at right now is multi-GPU systems. Consider a GPU to be a &#x27;worker thread&#x27;, and for each thread overlay the time spent uploading work units, the time spent computing, and the time spent downloading work results to the host. Now on Windows you only get 1 asynchronous copy engine for &quot;consumer&quot; GPUs like RTX {3|4|5}0x0 so there are limits, but MSL lets you have more I think and I haven&#x27;t looked at AMD GPUs yet.<p>The thing that most people latch onto is the speed upgrade (419ms -&gt; 1.6ms) but the real story here is the simplicity - using any dedicated language (CUDA, MSL, ...) you write a load of boilerplate and you have to worry about data hazards etc. I think of this as similar to when Apple introduced ARC (Automatic Reference Counting) - prior to that, engineers were constantly having to manage their memory manually, and there cough were a lot of errors. ARC changed the game, and I think xc is &quot;ARC for GPUs&quot;.","created_at":"2026-10-13T08:31:15Z","created_at_i":1791880275,"objectID":"50068489","parent_id":50065150,"story_id":50063427,"story_title":"AI is a tool and using it well takes skill","story_url":"https://yyhh.org/blog/2026/10/ai-is-a-tool/","updated_at":"2026-10-14T09:34:28Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"EGreg"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"<i>&quot;Every request spawns a fresh process. Deploying a new version is replacing one file. That means no server restart and no downtime. New requests simply pick up the new binary.&quot;</i><p>I think that's why FastCGI exists. It is the equivalent of PHP's &quot;Swoole&quot; or &quot;FrankenPHP&quot; or &quot;amphp&quot; or Laravel's &quot;octane&quot;, etc. Each process is long-lived and tries to clean up its state as much as possible between requests. Forking a new process can take around 8ms (<a href=\"https://news.ycombinator.com/item?id=19005586\">https://news.ycombinator.com/item?id=19005586</a>)<p>When I was building <a href=\"https://github.com/Qbix/webserver\" rel=\"nofollow\">https://github.com/Qbix/webserver</a> in PHP, I was faced with forking a new process per request. I implemented fork-per-request at first, similar to PHP-FPM and then implemented the &quot;FastCGI&quot; approach of long-lived processes that clean up after each request. (Modern PHP has introspection so the engine can know what to clean up, before calling the php files to handle things.) However, some things are not really possible to completely reset in PHP, and you have to be careful with database connection pools, etc. Typically those are left open even by preforking processes like php-fpm.<p>Anyway, I ended up flipping it: use the &quot;FastCGI&quot; approach as a default, and if the original PHP code doesn't work (rare), then for that app, you can choose the regular CGI approach of forking a process per request. That way you get maximum speed by default, and manually opt into safety (this is an exception to my usual priorities).<p>PHP is actually quite fast. But I was also interested in transpiling it to <em>C</em>. So I built the transpiler at: <a href=\"https://ulanguage.org/playground\" rel=\"nofollow\">https://ulanguage.org/playground</a> ... used <em>Claude</em> to transform about 1000 PHP functions to their native equivalents, but if you use any of the others, it would hook into the Zend runtime and link with it. (There are some nuances with zvals and objects, and resources in previous PHP versions, but I managed to overcome them.) By the way, it also works with Node and Python FFI the same way.<p>You can basically now take PHP, Python or Javascript/Typescript code, and speed up the CPU-bound parts about 10-50x. A lot of that is because of string and JSON handling. Many web apps use strings and JSON a lot. So underneath, I had the <em>compiler</em> use &quot;ropes&quot; for the strings, and avoid concatenation. It also parallelizes the JSON encode and decode into code that can run on multiple cores at once, i.e. large JSON payloads are encoded and decoded in <em>parallel</em>. Those are just huge speedups.<p>Anyway... all of this is mostly focused on speed optimization, so you can solve the literally C100K problem (forget C10K) today, on a regular box. If you don't need speed or FastCGI, your approach is fast enough for the vast majority of applications.<p><i>PS: By the way, if you fork after your program already loaded the framework and initialized the configuration, then you can run a lot more workers, literally 10x-100x more of them, because Linux and Mac will share all the loaded memory between processes, and do Copy-On-Write only on dirty pages. And when your request is done, and the process exits, that custom memory is efficiently cleaned up by the OS. It is this feature that allowed me to finally get the best of both worlds... run all existing PHP code, that makes blocking I/O requests all over the place to the database, filesystem, network etc. while at the same time being able to handle 100,000 requests in flight at the same time! Swoole and FrankenPHP can't do that.</i>"},"story_title":{"fullyHighlighted":false,"matchLevel":"partial","matchedWords":["c"],"value":"A Modern Web App in <em>C</em>"},"story_url":{"fullyHighlighted":false,"matchLevel":"partial","matchedWords":["c"],"value":"https://prophitt.me/writing/a-modern-web-app-in-<em>c</em>"}},"_tags":["comment","author_EGreg","story_50058528"],"author":"EGreg","children":[50059469,50060652,50061164],"comment_text":"<i>&quot;Every request spawns a fresh process. Deploying a new version is replacing one file. That means no server restart and no downtime. New requests simply pick up the new binary.&quot;</i><p>I think that&#x27;s why FastCGI exists. It is the equivalent of PHP&#x27;s &quot;Swoole&quot; or &quot;FrankenPHP&quot; or &quot;amphp&quot; or Laravel&#x27;s &quot;octane&quot;, etc. Each process is long-lived and tries to clean up its state as much as possible between requests. Forking a new process can take around 8ms (<a href=\"https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=19005586\">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=19005586</a>)<p>When I was building <a href=\"https:&#x2F;&#x2F;github.com&#x2F;Qbix&#x2F;webserver\" rel=\"nofollow\">https:&#x2F;&#x2F;github.com&#x2F;Qbix&#x2F;webserver</a> in PHP, I was faced with forking a new process per request. I implemented fork-per-request at first, similar to PHP-FPM and then implemented the &quot;FastCGI&quot; approach of long-lived processes that clean up after each request. (Modern PHP has introspection so the engine can know what to clean up, before calling the php files to handle things.) However, some things are not really possible to completely reset in PHP, and you have to be careful with database connection pools, etc. Typically those are left open even by preforking processes like php-fpm.<p>Anyway, I ended up flipping it: use the &quot;FastCGI&quot; approach as a default, and if the original PHP code doesn&#x27;t work (rare), then for that app, you can choose the regular CGI approach of forking a process per request. That way you get maximum speed by default, and manually opt into safety (this is an exception to my usual priorities).<p>PHP is actually quite fast. But I was also interested in transpiling it to C. So I built the transpiler at: <a href=\"https:&#x2F;&#x2F;ulanguage.org&#x2F;playground\" rel=\"nofollow\">https:&#x2F;&#x2F;ulanguage.org&#x2F;playground</a> ... used Claude to transform about 1000 PHP functions to their native equivalents, but if you use any of the others, it would hook into the Zend runtime and link with it. (There are some nuances with zvals and objects, and resources in previous PHP versions, but I managed to overcome them.) By the way, it also works with Node and Python FFI the same way.<p>You can basically now take PHP, Python or Javascript&#x2F;Typescript code, and speed up the CPU-bound parts about 10-50x. A lot of that is because of string and JSON handling. Many web apps use strings and JSON a lot. So underneath, I had the compiler use &quot;ropes&quot; for the strings, and avoid concatenation. It also parallelizes the JSON encode and decode into code that can run on multiple cores at once, i.e. large JSON payloads are encoded and decoded in parallel. Those are just huge speedups.<p>Anyway... all of this is mostly focused on speed optimization, so you can solve the literally C100K problem (forget C10K) today, on a regular box. If you don&#x27;t need speed or FastCGI, your approach is fast enough for the vast majority of applications.<p><i>PS: By the way, if you fork after your program already loaded the framework and initialized the configuration, then you can run a lot more workers, literally 10x-100x more of them, because Linux and Mac will share all the loaded memory between processes, and do Copy-On-Write only on dirty pages. And when your request is done, and the process exits, that custom memory is efficiently cleaned up by the OS. It is this feature that allowed me to finally get the best of both worlds... run all existing PHP code, that makes blocking I&#x2F;O requests all over the place to the database, filesystem, network etc. while at the same time being able to handle 100,000 requests in flight at the same time! Swoole and FrankenPHP can&#x27;t do that.</i>","created_at":"2026-10-12T16:52:19Z","created_at_i":1791823939,"objectID":"50059179","parent_id":50058528,"story_id":50058528,"story_title":"A Modern Web App in C","story_url":"https://prophitt.me/writing/a-modern-web-app-in-c","updated_at":"2026-10-13T08:36:39Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"spacedcowboy"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"Yes, it\u2019s very similar to that, except the ic has no imagination, vision, or drive.<p>I wrote my first <em>compiler</em> about 35 years ago, and my first OS around the same time, well before LLMs were on the scene. I know exactly just how much work is involved with doing it well, which is why I\u2019d never normally take on a project like this now I\u2019m retired.<p>But we do not live in normal times. The language \u201cI\u201d have created (and it\u2019s not as though I just said to <em>Claude</em> \u201chey, write me a <em>compiler</em>\u201d) is (even if I say so myself) pretty cool. Here\u2019s the full source of a Mandelbrot program:<p><pre><code>     #import &quot;Stdio.xc&quot;\n     #import &quot;Par.xc&quot;\n     #import &quot;../src/include/bench_time.xc&quot;\n\n     #define W 2048\n     #define SIZE (W * W)\n\n     i32 main(void)\n     {\n     // Eight runs: the first carries one-off costs (a GPU builds its kernel\n     // then), so the figure is the best run; the first is printed too. Auto\n     // decides after its fourth (two on each device), and uses the rest.\n     u32 total = 0;\n     i64 best = 0;\n     i64 first = 0;\n     for (u32 rep in 0..8)\n        {\n        total = 0;\n        i64 t0 = bench_now_us();\n        par mandel :reduce(+ total)\n            {\n            for (u32 i in 0..SIZE)\n                {\n                float cx = (float)(i % W) * (3.0f / 2048.0f) - 2.0f;\n                float cy = (float)(i / W) * (3.0f / 2048.0f) - 1.5f;\n                float x = 0.0f;\n                float y = 0.0f;\n                u32 k = 0;\n                while (k &lt; 256 &amp;&amp; x * x + y * y &lt; 4.0f)\n                    {\n                    float xt = x * x - y * y + cx;\n                    y = 2.0f * x * y + cy;\n                    x = xt;\n                    k = k + 1;\n                    }\n                total = total + k;\n                }\n            }\n        i64 t1 = bench_now_us();\n        if (rep == 0)\n            first = t1 - t0;\n        if (rep == 0 || t1 - t0 &lt; best)\n            best = t1 - t0;\n        }\n     Stdio.printf(&quot;%u %lld %lld\\n&quot;, (total + 500000) / 1000000, best, first);\n     return 0;\n     }\n</code></pre>\nJust one line in that source code is what turns it from a bog-standard <em>C</em>-like program into a GPU kernel, automatically tracked, scheduled, and all data hazards transparently managed.<p>On my M4 max, that one line of code takes it from 481ms to 1.6ms. All \u2018par\u2019 does is say \u201cthis next block of code, call it \u201cmandel\u201d, is data-<em>parallel</em>, and for the \u2018total\u2019 variable all execution units should combine their output to that variable using +<p>No huge GPU boilerplate, no stream management for data transport from cpu to gpu and back, no memory barriers, no hassle. Just \u201chey, do this on the gpu\u201d.<p>GPU blocks are bound at runtime using the best design for the hardware on the machine, obtained by measuring it if it hasn\u2019t been measured before. If it has, the cache is read. The user can always override, which is why \u2018par\u2019 blocks can be named.<p>Next up is an overlapping scheduler, which keeps 3 work units in play {pending, being-processed, being-transferred-once-done} for a processing device (right now, just a local gpu), which is also the multi-gpu story, and even the networked-machines story."},"story_title":{"matchLevel":"none","matchedWords":[],"value":"Using AI for just 10 minutes erodes your ability to persist at hard things"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://vcresearch.berkeley.edu/news/using-ai-just-10-minutes-erodes-your-ability-persist-hard-things"}},"_tags":["comment","author_spacedcowboy","story_50041765"],"author":"spacedcowboy","children":[50048858,50050458],"comment_text":"Yes, it\u2019s very similar to that, except the ic has no imagination, vision, or drive.<p>I wrote my first compiler about 35 years ago, and my first OS around the same time, well before LLMs were on the scene. I know exactly just how much work is involved with doing it well, which is why I\u2019d never normally take on a project like this now I\u2019m retired.<p>But we do not live in normal times. The language \u201cI\u201d have created (and it\u2019s not as though I just said to Claude \u201chey, write me a compiler\u201d) is (even if I say so myself) pretty cool. Here\u2019s the full source of a Mandelbrot program:<p><pre><code>     #import &quot;Stdio.xc&quot;\n     #import &quot;Par.xc&quot;\n     #import &quot;..&#x2F;src&#x2F;include&#x2F;bench_time.xc&quot;\n\n     #define W 2048\n     #define SIZE (W * W)\n\n     i32 main(void)\n     {\n     &#x2F;&#x2F; Eight runs: the first carries one-off costs (a GPU builds its kernel\n     &#x2F;&#x2F; then), so the figure is the best run; the first is printed too. Auto\n     &#x2F;&#x2F; decides after its fourth (two on each device), and uses the rest.\n     u32 total = 0;\n     i64 best = 0;\n     i64 first = 0;\n     for (u32 rep in 0..8)\n        {\n        total = 0;\n        i64 t0 = bench_now_us();\n        par mandel :reduce(+ total)\n            {\n            for (u32 i in 0..SIZE)\n                {\n                float cx = (float)(i % W) * (3.0f &#x2F; 2048.0f) - 2.0f;\n                float cy = (float)(i &#x2F; W) * (3.0f &#x2F; 2048.0f) - 1.5f;\n                float x = 0.0f;\n                float y = 0.0f;\n                u32 k = 0;\n                while (k &lt; 256 &amp;&amp; x * x + y * y &lt; 4.0f)\n                    {\n                    float xt = x * x - y * y + cx;\n                    y = 2.0f * x * y + cy;\n                    x = xt;\n                    k = k + 1;\n                    }\n                total = total + k;\n                }\n            }\n        i64 t1 = bench_now_us();\n        if (rep == 0)\n            first = t1 - t0;\n        if (rep == 0 || t1 - t0 &lt; best)\n            best = t1 - t0;\n        }\n     Stdio.printf(&quot;%u %lld %lld\\n&quot;, (total + 500000) &#x2F; 1000000, best, first);\n     return 0;\n     }\n</code></pre>\nJust one line in that source code is what turns it from a bog-standard C-like program into a GPU kernel, automatically tracked, scheduled, and all data hazards transparently managed.<p>On my M4 max, that one line of code takes it from 481ms to 1.6ms. All \u2018par\u2019 does is say \u201cthis next block of code, call it \u201cmandel\u201d, is data-parallel, and for the \u2018total\u2019 variable all execution units should combine their output to that variable using +<p>No huge GPU boilerplate, no stream management for data transport from cpu to gpu and back, no memory barriers, no hassle. Just \u201chey, do this on the gpu\u201d.<p>GPU blocks are bound at runtime using the best design for the hardware on the machine, obtained by measuring it if it hasn\u2019t been measured before. If it has, the cache is read. The user can always override, which is why \u2018par\u2019 blocks can be named.<p>Next up is an overlapping scheduler, which keeps 3 work units in play {pending, being-processed, being-transferred-once-done} for a processing device (right now, just a local gpu), which is also the multi-gpu story, and even the networked-machines story.","created_at":"2026-10-11T20:45:46Z","created_at_i":1791751546,"objectID":"50047644","parent_id":50045246,"story_id":50041765,"story_title":"Using AI for just 10 minutes erodes your ability to persist at hard things","story_url":"https://vcresearch.berkeley.edu/news/using-ai-just-10-minutes-erodes-your-ability-persist-hard-things","updated_at":"2026-10-13T13:59:58Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"spacedcowboy"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"Not in my case.<p>- I (<a href=\"https://compile-xc.org\" rel=\"nofollow\">https://compile-xc.org</a>) built a <em>compiler</em> for a language I call \u2018xc\u2019, similar to Objective-<em>C</em> but designed to be cross-platform and have less square brackets :). It can run on any of {Windows, Mac, Linux, Zynq} and produce code for any of {Windows, Mac, Linux, Zynq, WASM, iOS, Android, m68k, 6502}. It needs no host-platform tools to compile code, so for example I have a signed binary on my iPhone, written and signed entirely on Linux. The <em>compiler</em> currently produces code that is between 2x and 0.5x the speed of clang, which is pretty good for a nascent <em>compiler</em>. It also compiles the same language for execution on a GPU, and makes it trivial to designate parts of your code as data-<em>parallel</em> (<a href=\"https://compile-xc.org/compiler/language/par/\" rel=\"nofollow\">https://compile-xc.org/<em>compiler</em>/language/par/</a>). One statement turns a code block into a GPU kernel<p>- I built (more accurately: am building) a (<a href=\"https://compile-xc.org/compiler/api/uxkit\" rel=\"nofollow\">https://compile-xc.org/<em>compiler</em>/api/uxkit</a>) cross-platform UI framework, so you can write code once, even Table-views, Outline-views, Collection-views, etc., etc and your application will bind to the platform\u2019s native toolkit through a common programming API. The next step here is an \u201cInterface Builder\u201d like application I call RoCkS (for historical reasons), which lets you design the UI for {desktop, tablet, phone} to bind to the same core code, dragging connections between that core code and the UI elements for the different environments<p>- I built (<a href=\"https://atari-xt.com/os\" rel=\"nofollow\">https://atari-xt.com/os</a>) XTOS for the Zynq - an OS that started with FreeRTOS and added loadable processes, dynamic linking, shared memory, paging, a boot environment that can be scripted like Linux, networking, a graphical UI based on GEM, with a hardware blitter, and HDMI output with Audio islands mixed in. The blitter owns the video memory and uses shared-memory pools to give each \u201cvirtual workstation\u201d (GEM-speak for \u201cview of the display\u201d) its own retained-mode and composited graphics memory. The whole OS boots from power-on to desktop in a couple of seconds, which is the reason for making it, rather than just using Linux, I wanted that \u201cinstant-on\u201d feeling. It runs on a Z-turn board from MyIR.<p>- I built an Atari (6502, ANTIC, POKEY, various other chips) (<a href=\"https://atari-xt.com/hardware/x/\" rel=\"nofollow\">https://atari-xt.com/hardware/x/</a>)emulator, which passes the (<a href=\"https://forums.atariage.com/topic/171296-acid800-an-atari-te\" rel=\"nofollow\">https://forums.atariage.com/topic/171296-acid800-an-atari-te</a>...) Acid 800 emulation torture test, and can run games such as Ballblazer, Elektraglide and (<a href=\"https://0x0000ff.co.uk/mov/xt/xtos-aug-11.mov\" rel=\"nofollow\">https://0x0000ff.co.uk/mov/xt/xtos-aug-11.mov</a>)Despatch Rider. It\u2019s integrated into XTOS, so the OS boots into the GEM-based Desktop.app (written in xc) and you can double-click an icon to launch a game. The plan is to extend that to the ST once I get past the current task, which is \u2026<p>- I built a Reddit-like website that I plan to launch in a couple of months, written entirely in xc, both the Linux-based server and the client WASM code; the server-side is just xc code, no Apache, no scripting language, just lean-and-mean xc code handling everything from the TLS handshake to the Postgres database back-end. The main difference between (<a href=\"https://blewit.net/\" rel=\"nofollow\">https://blewit.net/</a>)blewit.net and Reddit is that I don\u2019t collect any personal information, don\u2019t track your habits and sell your data, don\u2019t use adverts (tracking by another name) or any of the other dark patterns social media is infested with these days. Blewit is so named because I think they did. One of the other differentiators is that I plan to support the groups with specialist helpers. You can see a selection of them at (<a href=\"https://blewit.net/sandbox\" rel=\"nofollow\">https://blewit.net/sandbox</a>) the blewit sandbox - things like rendered music staves from ABC notation, 3d interactive molecules structure from SMILES notation, mathml with an editor to create it, etc, etc.<p>- One last purposely-separated \u201chelper\u201d from the others because of its scale, is the electronic circuit editor/simulator. I introduced it [url=<a href=\"https://www.eevblog.com/forum/projects/circuit-simulation-fo...\" rel=\"nofollow\">https://www.eevblog.com/forum/projects/circuit-simulation-fo...</a>]in the EEVBlog projects forum[/url], but no-one seemed to care [grin]. That\u2019s a shame because I think it\u2019s pretty cool, draw the circuit in the editor, you can create your own parts, even store them to a library, add digital logic to pins, import SPICE models, and simulate with ideal or oscilloscope-type probes. It understands transmission lines, tolerances, can run monte-carlo simulations, produce overlaid graphs for {R=1k, 4.7k, 10k} etc., I could go on. The full docs to it are in the (<a href=\"https://blewit.net/post/93083024324820992\" rel=\"nofollow\">https://blewit.net/post/93083024324820992</a>) Blewit editor-information pages<p>Overall, looking back at what using an LLM has helped me code over the last half-year or so, it is unbelievable what you can code with AI in 2026. I always used to say that I had too many ideas and not enough time to implement them, well that\u2019s still true, but to a significantly lesser extent\u2026<p>For all the above \u201cI\u201d is short for \u201cI, with the help of <em>Claude</em>\u201d"},"story_title":{"matchLevel":"none","matchedWords":[],"value":"Using AI for just 10 minutes erodes your ability to persist at hard things"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://vcresearch.berkeley.edu/news/using-ai-just-10-minutes-erodes-your-ability-persist-hard-things"}},"_tags":["comment","author_spacedcowboy","story_50041765"],"author":"spacedcowboy","children":[50043488,50045246,50049387,50051185,50056517],"comment_text":"Not in my case.<p>- I (<a href=\"https:&#x2F;&#x2F;compile-xc.org\" rel=\"nofollow\">https:&#x2F;&#x2F;compile-xc.org</a>) built a compiler for a language I call \u2018xc\u2019, similar to Objective-C but designed to be cross-platform and have less square brackets :). It can run on any of {Windows, Mac, Linux, Zynq} and produce code for any of {Windows, Mac, Linux, Zynq, WASM, iOS, Android, m68k, 6502}. It needs no host-platform tools to compile code, so for example I have a signed binary on my iPhone, written and signed entirely on Linux. The compiler currently produces code that is between 2x and 0.5x the speed of clang, which is pretty good for a nascent compiler. It also compiles the same language for execution on a GPU, and makes it trivial to designate parts of your code as data-parallel (<a href=\"https:&#x2F;&#x2F;compile-xc.org&#x2F;compiler&#x2F;language&#x2F;par&#x2F;\" rel=\"nofollow\">https:&#x2F;&#x2F;compile-xc.org&#x2F;compiler&#x2F;language&#x2F;par&#x2F;</a>). One statement turns a code block into a GPU kernel<p>- I built (more accurately: am building) a (<a href=\"https:&#x2F;&#x2F;compile-xc.org&#x2F;compiler&#x2F;api&#x2F;uxkit\" rel=\"nofollow\">https:&#x2F;&#x2F;compile-xc.org&#x2F;compiler&#x2F;api&#x2F;uxkit</a>) cross-platform UI framework, so you can write code once, even Table-views, Outline-views, Collection-views, etc., etc and your application will bind to the platform\u2019s native toolkit through a common programming API. The next step here is an \u201cInterface Builder\u201d like application I call RoCkS (for historical reasons), which lets you design the UI for {desktop, tablet, phone} to bind to the same core code, dragging connections between that core code and the UI elements for the different environments<p>- I built (<a href=\"https:&#x2F;&#x2F;atari-xt.com&#x2F;os\" rel=\"nofollow\">https:&#x2F;&#x2F;atari-xt.com&#x2F;os</a>) XTOS for the Zynq - an OS that started with FreeRTOS and added loadable processes, dynamic linking, shared memory, paging, a boot environment that can be scripted like Linux, networking, a graphical UI based on GEM, with a hardware blitter, and HDMI output with Audio islands mixed in. The blitter owns the video memory and uses shared-memory pools to give each \u201cvirtual workstation\u201d (GEM-speak for \u201cview of the display\u201d) its own retained-mode and composited graphics memory. The whole OS boots from power-on to desktop in a couple of seconds, which is the reason for making it, rather than just using Linux, I wanted that \u201cinstant-on\u201d feeling. It runs on a Z-turn board from MyIR.<p>- I built an Atari (6502, ANTIC, POKEY, various other chips) (<a href=\"https:&#x2F;&#x2F;atari-xt.com&#x2F;hardware&#x2F;x&#x2F;\" rel=\"nofollow\">https:&#x2F;&#x2F;atari-xt.com&#x2F;hardware&#x2F;x&#x2F;</a>)emulator, which passes the (<a href=\"https:&#x2F;&#x2F;forums.atariage.com&#x2F;topic&#x2F;171296-acid800-an-atari-te\" rel=\"nofollow\">https:&#x2F;&#x2F;forums.atariage.com&#x2F;topic&#x2F;171296-acid800-an-atari-te</a>...) Acid 800 emulation torture test, and can run games such as Ballblazer, Elektraglide and (<a href=\"https:&#x2F;&#x2F;0x0000ff.co.uk&#x2F;mov&#x2F;xt&#x2F;xtos-aug-11.mov\" rel=\"nofollow\">https:&#x2F;&#x2F;0x0000ff.co.uk&#x2F;mov&#x2F;xt&#x2F;xtos-aug-11.mov</a>)Despatch Rider. It\u2019s integrated into XTOS, so the OS boots into the GEM-based Desktop.app (written in xc) and you can double-click an icon to launch a game. The plan is to extend that to the ST once I get past the current task, which is \u2026<p>- I built a Reddit-like website that I plan to launch in a couple of months, written entirely in xc, both the Linux-based server and the client WASM code; the server-side is just xc code, no Apache, no scripting language, just lean-and-mean xc code handling everything from the TLS handshake to the Postgres database back-end. The main difference between (<a href=\"https:&#x2F;&#x2F;blewit.net&#x2F;\" rel=\"nofollow\">https:&#x2F;&#x2F;blewit.net&#x2F;</a>)blewit.net and Reddit is that I don\u2019t collect any personal information, don\u2019t track your habits and sell your data, don\u2019t use adverts (tracking by another name) or any of the other dark patterns social media is infested with these days. Blewit is so named because I think they did. One of the other differentiators is that I plan to support the groups with specialist helpers. You can see a selection of them at (<a href=\"https:&#x2F;&#x2F;blewit.net&#x2F;sandbox\" rel=\"nofollow\">https:&#x2F;&#x2F;blewit.net&#x2F;sandbox</a>) the blewit sandbox - things like rendered music staves from ABC notation, 3d interactive molecules structure from SMILES notation, mathml with an editor to create it, etc, etc.<p>- One last purposely-separated \u201chelper\u201d from the others because of its scale, is the electronic circuit editor&#x2F;simulator. I introduced it [url=<a href=\"https:&#x2F;&#x2F;www.eevblog.com&#x2F;forum&#x2F;projects&#x2F;circuit-simulation-fo...\" rel=\"nofollow\">https:&#x2F;&#x2F;www.eevblog.com&#x2F;forum&#x2F;projects&#x2F;circuit-simulation-fo...</a>]in the EEVBlog projects forum[&#x2F;url], but no-one seemed to care [grin]. That\u2019s a shame because I think it\u2019s pretty cool, draw the circuit in the editor, you can create your own parts, even store them to a library, add digital logic to pins, import SPICE models, and simulate with ideal or oscilloscope-type probes. It understands transmission lines, tolerances, can run monte-carlo simulations, produce overlaid graphs for {R=1k, 4.7k, 10k} etc., I could go on. The full docs to it are in the (<a href=\"https:&#x2F;&#x2F;blewit.net&#x2F;post&#x2F;93083024324820992\" rel=\"nofollow\">https:&#x2F;&#x2F;blewit.net&#x2F;post&#x2F;93083024324820992</a>) Blewit editor-information pages<p>Overall, looking back at what using an LLM has helped me code over the last half-year or so, it is unbelievable what you can code with AI in 2026. I always used to say that I had too many ideas and not enough time to implement them, well that\u2019s still true, but to a significantly lesser extent\u2026<p>For all the above \u201cI\u201d is short for \u201cI, with the help of Claude\u201d","created_at":"2026-10-11T11:31:21Z","created_at_i":1791718281,"objectID":"50042069","parent_id":50041951,"story_id":50041765,"story_title":"Using AI for just 10 minutes erodes your ability to persist at hard things","story_url":"https://vcresearch.berkeley.edu/news/using-ai-just-10-minutes-erodes-your-ability-persist-hard-things","updated_at":"2026-10-14T13:56:14Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"Syzygies"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"I started with SML in the 1980's, implementing a core math algorithm (Grobner bases) used in my K&amp;R <em>C</em> computer algebra system Macaulay. Then I got this idea there should be a related algorithm in a different problem domain (Hilbert bases) and I managed to convert my code in twenty minutes. It ran. This completely blew my mind, on par with switching from punched card Fortran to an APL terminal in the 1970's.<p>Everyone talks a good line about more powerful, expressive programming languages till they need to put in the work. Ten years effort to program like ten people the rest of your life? I'm 69 now, I can see how such an investment pays off.<p>I moved to OCaml. Studying their library source code is the best intro ever to functional programming, but I felt your &quot;all the way&quot; pull and switched to Haskell. (Monads make explicit what a <em>C</em> program is doing anyway. Explicit means the <em>compiler</em> can better help. What it comes down to is making programming feel like thinking about algebra. This is only an advantage if one is receptive to the experience.)<p>I'm about to commit to Lean 4 as &quot;going all the way&quot;. Early in AI pair programming, I tested a dozen languages including these with a challenging <em>parallel</em> test project, and concluded that AI couldn't handle Lean 4. It keeps trying to write proofs, despite Lean's excellence as a general purpose programming language, better than Haskell. That would be like asking for help with Ruby, and AI assuming you want to write a web server.<p>I now pay $200 a month for Anthropic Max access to <em>Claude</em> Code Opus 4 (regularly hitting limits) having committed to Swift (<em>C</em> meets Ruby, again not just for macOS apps, same category error) so I could have first class access to macOS graphics for my 3-manifold topology research. Alas, you can only build so high a building with stone, I need the abstraction leverage of best-in-category functional languages.<p>It turns out that Opus 4 can program in Lean 4, which I find more beautiful than any of the dozens of languages I've tried over a lifetime. Even Scheme with parentheses removal done right, and with far more powerful abstractions."},"story_title":{"matchLevel":"none","matchedWords":[],"value":"OCaml Programming: Correct and Efficient and Beautiful"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://cs3110.github.io/textbook/cover.html"}},"_tags":["comment","author_Syzygies","story_44696979"],"author":"Syzygies","children":[44698161],"comment_text":"I started with SML in the 1980&#x27;s, implementing a core math algorithm (Grobner bases) used in my K&amp;R C computer algebra system Macaulay. Then I got this idea there should be a related algorithm in a different problem domain (Hilbert bases) and I managed to convert my code in twenty minutes. It ran. This completely blew my mind, on par with switching from punched card Fortran to an APL terminal in the 1970&#x27;s.<p>Everyone talks a good line about more powerful, expressive programming languages till they need to put in the work. Ten years effort to program like ten people the rest of your life? I&#x27;m 69 now, I can see how such an investment pays off.<p>I moved to OCaml. Studying their library source code is the best intro ever to functional programming, but I felt your &quot;all the way&quot; pull and switched to Haskell. (Monads make explicit what a C program is doing anyway. Explicit means the compiler can better help. What it comes down to is making programming feel like thinking about algebra. This is only an advantage if one is receptive to the experience.)<p>I&#x27;m about to commit to Lean 4 as &quot;going all the way&quot;. Early in AI pair programming, I tested a dozen languages including these with a challenging parallel test project, and concluded that AI couldn&#x27;t handle Lean 4. It keeps trying to write proofs, despite Lean&#x27;s excellence as a general purpose programming language, better than Haskell. That would be like asking for help with Ruby, and AI assuming you want to write a web server.<p>I now pay $200 a month for Anthropic Max access to Claude Code Opus 4 (regularly hitting limits) having committed to Swift (C meets Ruby, again not just for macOS apps, same category error) so I could have first class access to macOS graphics for my 3-manifold topology research. Alas, you can only build so high a building with stone, I need the abstraction leverage of best-in-category functional languages.<p>It turns out that Opus 4 can program in Lean 4, which I find more beautiful than any of the dozens of languages I&#x27;ve tried over a lifetime. Even Scheme with parentheses removal done right, and with far more powerful abstractions.","created_at":"2025-07-26T23:26:42Z","created_at_i":1753572402,"objectID":"44697725","parent_id":44697474,"story_id":44696979,"story_title":"OCaml Programming: Correct and Efficient and Beautiful","story_url":"https://cs3110.github.io/textbook/cover.html","updated_at":"2025-07-27T14:24:13Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"Locke1689"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"It depends on what you mean by <em>parallel</em>.<p>Certainly the Roslyn <em>C</em># <em>compiler</em> is highly <em>parallel</em>. All files are parsed in <em>parallel</em>, then all <em>classes</em> are bound (semantically analyzed) in <em>parallel</em>, then the IL serialization phase is sequential."},"story_title":{"matchLevel":"none","matchedWords":[],"value":"Testing LLVM"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"http://blog.regehr.org/archives/1450"}},"_tags":["comment","author_Locke1689","story_13394437"],"author":"Locke1689","children":[13407966],"comment_text":"It depends on what you mean by parallel.<p>Certainly the Roslyn C# compiler is highly parallel. All files are parsed in parallel, then all classes are bound (semantically analyzed) in parallel, then the IL serialization phase is sequential.","created_at":"2017-01-14T07:32:28Z","created_at_i":1484379148,"objectID":"13397385","parent_id":13396184,"story_id":13394437,"story_title":"Testing LLVM","story_url":"http://blog.regehr.org/archives/1450","updated_at":"2024-09-20T00:18:47Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"pbr_rob"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"Class of '04, Computer Science<p>- Programming I in <em>C</em><p>- Programming II in <em>C</em>++<p>- Data Structures in <em>C</em>++<p>- Theory of PL rotated languages every semester and project had to be in a language you didn't know coming into the class. (<em>C</em>#, php, pl/sql)<p>- Software Engineering divided into groups, each group assigned a stack to implement (mine was LAMP)<p>- Databases pl/sql<p>- <em>Compilers</em> <em>C</em>/lex/yacc<p>- OS projects in <em>C</em> and assembly<p>- <em>Parallel</em> projects in <em>C</em>, python and mpi<p>- Python language class<p>- Scripting languages survey was always python and ruby, but rotated in something new or interesting each section.<p>- A COBOL section with old mainframe<p>- Assembly class was in MASM<p>No FP for undergrads. No one had to learn Java or <em>C</em>#, you were given the opportunity to be exposed to them through User Groups or electives, but directed <em>classes</em> in them were reserved for the Information Systems people over in the Business school.<p>--- edit: formatting"},"story_title":{"matchLevel":"none","matchedWords":[],"value":"Ask HN: What programming languages are used in CS courses these days?"}},"_tags":["comment","author_pbr_rob","story_7950439"],"author":"pbr_rob","comment_text":"Class of &#x27;04, Computer Science<p>- Programming I in C<p>- Programming II in C++<p>- Data Structures in C++<p>- Theory of PL rotated languages every semester and project had to be in a language you didn&#x27;t know coming into the class. (C#, php, pl&#x2F;sql)<p>- Software Engineering divided into groups, each group assigned a stack to implement (mine was LAMP)<p>- Databases pl&#x2F;sql<p>- Compilers C&#x2F;lex&#x2F;yacc<p>- OS projects in C and assembly<p>- Parallel projects in C, python and mpi<p>- Python language class<p>- Scripting languages survey was always python and ruby, but rotated in something new or interesting each section.<p>- A COBOL section with old mainframe<p>- Assembly class was in MASM<p>No FP for undergrads. No one had to learn Java or C#, you were given the opportunity to be exposed to them through User Groups or electives, but directed classes in them were reserved for the Information Systems people over in the Business school.<p>--- edit: formatting","created_at":"2014-06-26T17:28:43Z","created_at_i":1403803723,"objectID":"7950685","parent_id":7950439,"story_id":7950439,"story_title":"Ask HN: What programming languages are used in CS courses these days?","updated_at":"2024-09-19T20:56:49Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"tjoff"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"<i>Additionally there are not many <em>classes</em> with <em>C</em> at all these days.</i><p>Depends on what you are studying. While I never had any specific \"learn <em>C</em>\" courses it is by far the most used language in other courses (OS programming, <em>parallel</em> programming, <em>compiler</em> construction, network programming, micro-controllers, graphics and game programming, security courses etc.). No other language comes close (a lot of the time a <em>C</em>++ <em>compiler</em> is used but the <em>C</em> subset is what ultimately has been used)."},"story_title":{"fullyHighlighted":false,"matchLevel":"partial","matchedWords":["c"],"value":"Interesting <em>C</em> Interview Questions and Answers"},"story_url":{"fullyHighlighted":false,"matchLevel":"partial","matchedWords":["c"],"value":"http://www.thegeekstuff.com/2012/08/<em>c</em>-interview-questions/?utm_source=feedburner&utm_medium=feed&utm_campaign=Feed%3A+TheGeekStuff+%28The+Geek+Stuff%29"}},"_tags":["comment","author_tjoff","story_4445701"],"author":"tjoff","comment_text":"<i>Additionally there are not many classes with C at all these days.</i><p>Depends on what you are studying. While I never had any specific \"learn C\" courses it is by far the most used language in other courses (OS programming, parallel programming, compiler construction, network programming, micro-controllers, graphics and game programming, security courses etc.). No other language comes close (a lot of the time a C++ compiler is used but the C subset is what ultimately has been used).","created_at":"2012-08-28T21:52:22Z","created_at_i":1346190742,"objectID":"4446063","parent_id":4445950,"points":null,"story_id":4445701,"story_title":"Interesting C Interview Questions and Answers","story_url":"http://www.thegeekstuff.com/2012/08/c-interview-questions/?utm_source=feedburner&utm_medium=feed&utm_campaign=Feed%3A+TheGeekStuff+%28The+Geek+Stuff%29","updated_at":"2023-09-06T21:03:23Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"acuozzo"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"It's a shame &quot;<em>C</em> with <em>classes</em>&quot;, as <em>C</em>++ originally was, didn't stick around for <em>parallel</em> development.<p>I work with <em>C</em> daily and I'm well aware of its many shortcomings (e.g. its huge list of undefined behavior and its PDP11-centric view of modern architectures), but with some effort I believe it could function as a semi-portable second-level intermediate representation. Nim uses it as such, IIRC.<p>Compiling to <em>C</em> first would introduce some of its own issues, for sure, but I imagine doing so would alleviate the pressure the <em>C</em>++ standards committee puts on <em>compiler</em> vendors each time they expand the size of the kitchen sink."},"story_title":{"matchLevel":"none","matchedWords":[],"value":"Java 20 / JDK 20: General Availability"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://mail.openjdk.org/pipermail/jdk-dev/2023-March/007517.html"}},"_tags":["comment","author_acuozzo","story_35246710"],"author":"acuozzo","children":[35250790],"comment_text":"It&#x27;s a shame &quot;C with classes&quot;, as C++ originally was, didn&#x27;t stick around for parallel development.<p>I work with C daily and I&#x27;m well aware of its many shortcomings (e.g. its huge list of undefined behavior and its PDP11-centric view of modern architectures), but with some effort I believe it could function as a semi-portable second-level intermediate representation. Nim uses it as such, IIRC.<p>Compiling to C first would introduce some of its own issues, for sure, but I imagine doing so would alleviate the pressure the C++ standards committee puts on compiler vendors each time they expand the size of the kitchen sink.","created_at":"2023-03-21T17:32:56Z","created_at_i":1679419976,"objectID":"35249522","parent_id":35249065,"story_id":35246710,"story_title":"Java 20 / JDK 20: General Availability","story_url":"https://mail.openjdk.org/pipermail/jdk-dev/2023-March/007517.html","updated_at":"2024-09-20T13:38:22Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"fouric"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"I did something <i>kind of</i> like this for a college project. We were taking a course on FPGA soft-processors, and for our final project, we had to build A Thing.<p>My team chose to reimplement Space Invaders. The soft-core was supported by a <em>C</em> <em>compiler</em>, so we wrote the game in <em>C</em>, with carefully-chosen functions for graphics rendering containing #ifdefs that gated either direct memory accesses (for the FPGA VGA hardware) or SDL calls.<p>Our &quot;init()&quot; function would initialize the VGA hardware on the FPGA, and create an SDL window when compiled on a computer with an OS.<p>Using this, the hardware and software people were able to work together in <em>parallel</em>, and we won best project for our class, with a grand prize of &quot;we'll show your cool project to the next <em>classes</em>&quot;.<p>As I recall, we wrote most of the game using SDL backend, and only tested it on &quot;real&quot; hardware a few days before the final project. We found a single bug (during the integration) that took us on the order of half an hour to debug, and that was that."},"story_title":{"matchLevel":"none","matchedWords":[],"value":"Verilog Simulation with Verilator and SDL"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://projectf.io/posts/verilog-sim-verilator-sdl/"}},"_tags":["comment","author_fouric","story_28929994"],"author":"fouric","comment_text":"I did something <i>kind of</i> like this for a college project. We were taking a course on FPGA soft-processors, and for our final project, we had to build A Thing.<p>My team chose to reimplement Space Invaders. The soft-core was supported by a C compiler, so we wrote the game in C, with carefully-chosen functions for graphics rendering containing #ifdefs that gated either direct memory accesses (for the FPGA VGA hardware) or SDL calls.<p>Our &quot;init()&quot; function would initialize the VGA hardware on the FPGA, and create an SDL window when compiled on a computer with an OS.<p>Using this, the hardware and software people were able to work together in parallel, and we won best project for our class, with a grand prize of &quot;we&#x27;ll show your cool project to the next classes&quot;.<p>As I recall, we wrote most of the game using SDL backend, and only tested it on &quot;real&quot; hardware a few days before the final project. We found a single bug (during the integration) that took us on the order of half an hour to debug, and that was that.","created_at":"2021-10-20T17:45:23Z","created_at_i":1634751923,"objectID":"28933593","parent_id":28929994,"story_id":28929994,"story_title":"Verilog Simulation with Verilator and SDL","story_url":"https://projectf.io/posts/verilog-sim-verilator-sdl/","updated_at":"2024-09-20T09:38:48Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"CharlieDigital"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"I would just like to understand specific threats or issues with using <em>C</em># as a language.  I've used it for 20 years at this point without issue and the latest IEEE language survey shows that it remains one of the top languages[0]; I'm wondering if you have some insight into why .NET and <em>C</em># are a bad choice for engineering teams that I've somehow overlooked in my 20 years of working with it.<p>It sounds like your argument is &quot;because Microsoft&quot;.<p>If you are using VS Code, GitHub, or TypeScript -- well, <i>all those are also controlled by Microsoft, aren't they</i>? Microsoft is the biggest investor in OpenAI and in fact offers their own Azure labeled OpenAI -- are you going to give up on OpenAI because it's Microsoft controlled?  React is controlled by Facebook.  Go is controlled by Google.  So what?<p>Why use <em>C</em>#?<p><pre><code>    - It's a very small step from TypeScript to <em>C</em># if a team needs higher throughput on the backend[1][2]\n    - `System.Linq` provides a superset of JS Array methods and is easy to map from one to the other.\n    - It's performance is on par or superior to Go[3] and competitive with Rust[4] while being much easier to adopt because of the language similarity to JS and TS.\n    - It is an object-functional hybrid language owing to its influence from F#[5]; discriminated unions are on the roadmap and available today with packages like Dunet and OneOf, it has pattern matching like Rust, extension methods provide flexibility in modelling, named tuples in <em>C</em># 12 converge even more with TS, it supports destructuring record types and <em>classes</em>, it has immutable record types\n    - Minimal APIs are very familiar for teams using Express but need more performance.  I'd actually say that it's a bit simpler than Express on Node for common use cases since there's nothing to import when setting up minimal APIs since it's all first-party Microsoft.\n    - Platform support for source generators are a revelation; it removes a lot of boilerplate code while actually improving performance over reflection.\n    - Many of the things teams love about modern JS actually have influence from <em>C</em>#.  Lambda expressions in JavaScript, `async/await`, and more.  In fact, <em>C</em># and JS/TS have been converging (see the linked repo).\n    - It's relatively easy to write high throughput code in <em>C</em># with support for both concurrency (Tasks + Channels) and high level abstractions for parallelism (Task <em>Parallel</em> Library) as well as full access to threading.\n    - <em>C</em># allows easy access to underlying low-level primitives; you can program with high level abstractions for productivity but still have access to call `unsafe` code if needed.\n    - EF Core is possibly the best ORM on the market right now in terms of performance, ease of use, maturity, and database engine support.\n    - A benefit of a language and runtime backed by Microsoft and used in the enterprise is that security issues get addressed by a team of professional engineers; you don't see the same types of security issues that pop up in the Node/NPM ecosystem.\n    - This is a big boon particularly because of the broad standard libraries and first-party libraries for many use cases.  Rather than importing unknown dependencies for common use cases, you end up with a baseline of professionally maintained, OSS code.\n    - GitHub's State of the Octoverse report in 2020[6] showed that <em>C</em># had the least Dependabot alerts and has the least transitive dependencies (less prone to security issues via package managers).\n    - As a general purpose language, it can be used in many domains from desktop to devices to web to gaming (both Godot and Unity; RyujinX).\n    - It's also quite mature and stable while languages like Rust are still ironing out async and Go just released generics.  <em>C</em># has been there; done that.\n</code></pre>\nMy personal opinion is that <em>C</em># is the language that most teams want but don't know enough about it or have a bad taste from the .NET Framework days. While the runtime is more complex than Node, the language is very similar to TypeScript owing to its lineage from Anders Hejlsberg. <em>C</em># and .NET in its current form is a great language and platform to build on.<p>Besides, if a team is already using VS Code, GitHub, and TypeScript, <i>they're already in the Microsoft controlled ecosystem</i>.<p><pre><code>    [0] https://spectrum.ieee.org/the-top-programming-languages-2023\n    [1] https://github.com/CharlieDigital/playwright-scrape-api\n    [2] https://github.com/CharlieDigital/js-ts-csharp\n    [3] https://medium.com/servicetitan-engineering/go-vs-<em>c</em>-part-3-<em>compiler</em>-runtime-type-system-modules-and-everything-else-faa423dddb34\n    [4] https://www.techempower.com/benchmarks/#section=data-r21&amp;test=composite&amp;hw=cl\n    [5] https://itnext.io/getting-functional-with-<em>c</em>-6c74bf279616\n    [6] https://arxiv.org/ftp/arxiv/papers/2110/2110.10246.pdf</code></pre>"},"story_title":{"matchLevel":"none","matchedWords":[],"value":"Why isn\u2019t dotnet core popular among startups?"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"https://old.reddit.com/r/dotnet/login/"}},"_tags":["comment","author_CharlieDigital","story_37480478"],"author":"CharlieDigital","children":[37488574],"comment_text":"I would just like to understand specific threats or issues with using C# as a language.  I&#x27;ve used it for 20 years at this point without issue and the latest IEEE language survey shows that it remains one of the top languages[0]; I&#x27;m wondering if you have some insight into why .NET and C# are a bad choice for engineering teams that I&#x27;ve somehow overlooked in my 20 years of working with it.<p>It sounds like your argument is &quot;because Microsoft&quot;.<p>If you are using VS Code, GitHub, or TypeScript -- well, <i>all those are also controlled by Microsoft, aren&#x27;t they</i>? Microsoft is the biggest investor in OpenAI and in fact offers their own Azure labeled OpenAI -- are you going to give up on OpenAI because it&#x27;s Microsoft controlled?  React is controlled by Facebook.  Go is controlled by Google.  So what?<p>Why use C#?<p><pre><code>    - It&#x27;s a very small step from TypeScript to C# if a team needs higher throughput on the backend[1][2]\n    - `System.Linq` provides a superset of JS Array methods and is easy to map from one to the other.\n    - It&#x27;s performance is on par or superior to Go[3] and competitive with Rust[4] while being much easier to adopt because of the language similarity to JS and TS.\n    - It is an object-functional hybrid language owing to its influence from F#[5]; discriminated unions are on the roadmap and available today with packages like Dunet and OneOf, it has pattern matching like Rust, extension methods provide flexibility in modelling, named tuples in C# 12 converge even more with TS, it supports destructuring record types and classes, it has immutable record types\n    - Minimal APIs are very familiar for teams using Express but need more performance.  I&#x27;d actually say that it&#x27;s a bit simpler than Express on Node for common use cases since there&#x27;s nothing to import when setting up minimal APIs since it&#x27;s all first-party Microsoft.\n    - Platform support for source generators are a revelation; it removes a lot of boilerplate code while actually improving performance over reflection.\n    - Many of the things teams love about modern JS actually have influence from C#.  Lambda expressions in JavaScript, `async&#x2F;await`, and more.  In fact, C# and JS&#x2F;TS have been converging (see the linked repo).\n    - It&#x27;s relatively easy to write high throughput code in C# with support for both concurrency (Tasks + Channels) and high level abstractions for parallelism (Task Parallel Library) as well as full access to threading.\n    - C# allows easy access to underlying low-level primitives; you can program with high level abstractions for productivity but still have access to call `unsafe` code if needed.\n    - EF Core is possibly the best ORM on the market right now in terms of performance, ease of use, maturity, and database engine support.\n    - A benefit of a language and runtime backed by Microsoft and used in the enterprise is that security issues get addressed by a team of professional engineers; you don&#x27;t see the same types of security issues that pop up in the Node&#x2F;NPM ecosystem.\n    - This is a big boon particularly because of the broad standard libraries and first-party libraries for many use cases.  Rather than importing unknown dependencies for common use cases, you end up with a baseline of professionally maintained, OSS code.\n    - GitHub&#x27;s State of the Octoverse report in 2020[6] showed that C# had the least Dependabot alerts and has the least transitive dependencies (less prone to security issues via package managers).\n    - As a general purpose language, it can be used in many domains from desktop to devices to web to gaming (both Godot and Unity; RyujinX).\n    - It&#x27;s also quite mature and stable while languages like Rust are still ironing out async and Go just released generics.  C# has been there; done that.\n</code></pre>\nMy personal opinion is that C# is the language that most teams want but don&#x27;t know enough about it or have a bad taste from the .NET Framework days. While the runtime is more complex than Node, the language is very similar to TypeScript owing to its lineage from Anders Hejlsberg. C# and .NET in its current form is a great language and platform to build on.<p>Besides, if a team is already using VS Code, GitHub, and TypeScript, <i>they&#x27;re already in the Microsoft controlled ecosystem</i>.<p><pre><code>    [0] https:&#x2F;&#x2F;spectrum.ieee.org&#x2F;the-top-programming-languages-2023\n    [1] https:&#x2F;&#x2F;github.com&#x2F;CharlieDigital&#x2F;playwright-scrape-api\n    [2] https:&#x2F;&#x2F;github.com&#x2F;CharlieDigital&#x2F;js-ts-csharp\n    [3] https:&#x2F;&#x2F;medium.com&#x2F;servicetitan-engineering&#x2F;go-vs-c-part-3-compiler-runtime-type-system-modules-and-everything-else-faa423dddb34\n    [4] https:&#x2F;&#x2F;www.techempower.com&#x2F;benchmarks&#x2F;#section=data-r21&amp;test=composite&amp;hw=cl\n    [5] https:&#x2F;&#x2F;itnext.io&#x2F;getting-functional-with-c-6c74bf279616\n    [6] https:&#x2F;&#x2F;arxiv.org&#x2F;ftp&#x2F;arxiv&#x2F;papers&#x2F;2110&#x2F;2110.10246.pdf</code></pre>","created_at":"2023-09-12T13:46:32Z","created_at_i":1694526392,"objectID":"37481186","parent_id":37480930,"story_id":37480478,"story_title":"Why isn\u2019t dotnet core popular among startups?","story_url":"https://old.reddit.com/r/dotnet/login/","updated_at":"2024-09-20T15:06:42Z"},{"_highlightResult":{"author":{"matchLevel":"none","matchedWords":[],"value":"Locke1689"},"comment_text":{"fullyHighlighted":false,"matchLevel":"full","matchedWords":["parallel","claudes","c","compiler"],"value":"<i>You are making four big mistakes:\nFirst you are angry. You are not so much attacking PL/I as attacking me personally.</i><p>Nope. Besides noting that you have very little knowledge in PL research at the end, I made no comments about you personally.<p><i>Second you are pursuing religious arguments about programming languages.</i><p>Nope, I specifically mentioned practical things that matter.<p><i>Third you are arguing things about PL/I that are really not part of the language.</i><p>If you're talking about things like, \"no one knows PL/I,\" so what? This is entirely relevant from an engineering standpoint. Just because it's not \"really part of the language\" is irrelevant because we're not debating whether or not PL/I is better than <em>C</em>/<em>C</em>++ in the 1950s in a perfect world, we're talking about practical engineering <i>right now</i> on <i>real systems.</i><p><i>Fourth much of what you say about PL/I is technically wrong.</i><p>Not a one.<p><i>What PL/I <em>compilers</em> are awful? As far as I know, there aren't very many and the more common ones there are, essentially all from IBM, are highly polished.</i><p>Only if you're using <em>compiler</em> benchmarks from the 90's. I'm looking for things like packrat parsing and partial and incremental linking. Auto SSE/SIMD would be nice. If you're so convinced that IBM PL/I is good enough, why don't you benchmark it against GCC (on Intel ICC often outperforms GCC but I'm confident even GCC will far outperform PL/I).<p><i>That it's my 'favorite' doesn't mean that I suggest that others use it. I used the IBM PL/I on OS/2 a few times; I have the IBM PL/I for Windows but don't even have it installed. On Windows I use Visual Basic .NET, if only because it has such good access to .NET, ADO.NET, and ASP.NET. In many ways, I would prefer PL/I, but it is not a practical option.</i><p>My entire post was about how it's not a practical option and how you shouldn't be surprised when no one wants to use PL/I in production...<p><i>PL/I has some features that were deliberately included to make learning it relatively easy. E.g., PL/I has no reserved words! That is, all the 'key' words in the language can be used by programmers for their own identifier names. So, a beginner doesn't have to worry about using a reserved word. I taught some elementary parts of PL/I to some not very good students in the business school at Georgetown University, and they learned fine.</i><p>This is unimportant. Arguably it's worse than having reserved words because it allows for inadvertent shadowing, but really it's just a back-and-forth thing that no one cares about.<p><i>For 3, the only serious problem with 'type safety' is for pointers. True, in PL/I, pointers do not have 'types' based on what they point to. That is, any pointer can point to anything. But, then, using pointers in PL/I is not nearly as necessary or common as in <em>C</em>/<em>C</em>++, is quite advanced, and is not common. I liked using pointers because can really work with the memory and, at times, write some 'polymorphic' functions. Tricky work with pointers is always tricky, and that the pointers in PL/I are not 'strongly typed' didn't make the work harder. Again, PL/I is not nearly as dependent on pointers as <em>C</em>; a <em>C</em> programmer is forced to used pointers frequently, and PL/I programmer can do fine using pointers only rarely.</i><p>You completely misunderstood -- <em>C</em> and <em>C</em>++ are the standards. If you want people to use something not-standard you need to provide something which is <i>far better</i> in your own language than in the standards in order to compel people to switch. Being a little bit better isn't good enough, you need to be a <i>lot</i> better. Strong typing, garbage collection, and higher-order functions are all things which <i>suck</i> in <em>C</em>/<em>C</em>++. If you want people to adopt your language you should offer full support for these things because that gives you a compelling reason to switch.<p><i>Otherwise on types, PL/I took the attitude...</i><p>Read more about strong typing and read about type or category theory (preferably both). <em>C</em> and Java types are not strong typing, they're typing done in probably the worst possible way. Learn ML.<p><i>Or can do a calculation, enter a Begin-End block and do the automatic allocation inside that block.</i><p>Welcome to RAII, circa 2000.<p><i>To get around the problem, end up using <em>C</em> structures or <em>C</em>++ <em>classes</em>, both of which are much less efficient.</i><p>Only in <em>C</em> or <em>C</em>++ <em>compilers</em> from 1995...<p><i>Actually, can claim that for some years Rexx, with a few extensions for some lower level OS access, basically 'ran' all of IBM: There were about 4000 mainframes around the world connected with simple bisync lines. In the end, it all looked much like the Internet today. So, the mainframes were acting as both the servers and the routers. The hard work of the routing, security, etc. was done with 'server virtual machines' programmed mostly in Rexx with a few routines for some lower level access. It worked surprisingly well. Rexx was no toy.</i><p>It really is. IBM hasn't even come close to building what would be termed a modern distributed system infrastructure. There's no PL/I equivalent for MapReduce, BigTable, GFS, etc.<p><i>A lot of nonsense. On IBM, PL/I used standard OS calling sequences. Calling Fortran, Cobol, assembler, and <em>C</em> was routine. I wrote a collection of routines in PL/I to call <em>C</em> to call the TCP/IP routines. Occasionally I called assembler from PL/I.</i><p>OS calling sequences are the bare-minimum. If I wanted to optimize my Python code by dropping down and rewriting the code in a systems language, <em>C</em> has my back. Good luck with PL/I.<p>You seem to be using a lot of examples from HPC but they're not really relevant. HPC is a pretty easy target because you get to make a lot of assumptions about the DS you're architecting and the software that will be run on it. PL/I is just a dead language -- there's no reason to ever switch to it and while it may have been slightly better than <em>C</em>++ during IBM's heyday, the world has moved on. Even scientific computing prefers <em>parallel</em> Fortran, which ever since the latest version is incredibly fast."},"story_title":{"matchLevel":"none","matchedWords":[],"value":"A note to Google recruiters (and on Google hiring practices)"},"story_url":{"matchLevel":"none","matchedWords":[],"value":"http://infotrope.net/2011/07/21/a-note-to-google-recruiters/"}},"_tags":["comment","author_Locke1689","story_2800538"],"author":"Locke1689","children":[2806812],"comment_text":"<i>You are making four big mistakes:\nFirst you are angry. You are not so much attacking PL/I as attacking me personally.</i><p>Nope. Besides noting that you have very little knowledge in PL research at the end, I made no comments about you personally.<p><i>Second you are pursuing religious arguments about programming languages.</i><p>Nope, I specifically mentioned practical things that matter.<p><i>Third you are arguing things about PL/I that are really not part of the language.</i><p>If you're talking about things like, \"no one knows PL/I,\" so what? This is entirely relevant from an engineering standpoint. Just because it's not \"really part of the language\" is irrelevant because we're not debating whether or not PL/I is better than C/C++ in the 1950s in a perfect world, we're talking about practical engineering <i>right now</i> on <i>real systems.</i><p><i>Fourth much of what you say about PL/I is technically wrong.</i><p>Not a one.<p><i>What PL/I compilers are awful? As far as I know, there aren't very many and the more common ones there are, essentially all from IBM, are highly polished.</i><p>Only if you're using compiler benchmarks from the 90's. I'm looking for things like packrat parsing and partial and incremental linking. Auto SSE/SIMD would be nice. If you're so convinced that IBM PL/I is good enough, why don't you benchmark it against GCC (on Intel ICC often outperforms GCC but I'm confident even GCC will far outperform PL/I).<p><i>That it's my 'favorite' doesn't mean that I suggest that others use it. I used the IBM PL/I on OS/2 a few times; I have the IBM PL/I for Windows but don't even have it installed. On Windows I use Visual Basic .NET, if only because it has such good access to .NET, ADO.NET, and ASP.NET. In many ways, I would prefer PL/I, but it is not a practical option.</i><p>My entire post was about how it's not a practical option and how you shouldn't be surprised when no one wants to use PL/I in production...<p><i>PL/I has some features that were deliberately included to make learning it relatively easy. E.g., PL/I has no reserved words! That is, all the 'key' words in the language can be used by programmers for their own identifier names. So, a beginner doesn't have to worry about using a reserved word. I taught some elementary parts of PL/I to some not very good students in the business school at Georgetown University, and they learned fine.</i><p>This is unimportant. Arguably it's worse than having reserved words because it allows for inadvertent shadowing, but really it's just a back-and-forth thing that no one cares about.<p><i>For 3, the only serious problem with 'type safety' is for pointers. True, in PL/I, pointers do not have 'types' based on what they point to. That is, any pointer can point to anything. But, then, using pointers in PL/I is not nearly as necessary or common as in C/C++, is quite advanced, and is not common. I liked using pointers because can really work with the memory and, at times, write some 'polymorphic' functions. Tricky work with pointers is always tricky, and that the pointers in PL/I are not 'strongly typed' didn't make the work harder. Again, PL/I is not nearly as dependent on pointers as C; a C programmer is forced to used pointers frequently, and PL/I programmer can do fine using pointers only rarely.</i><p>You completely misunderstood -- C and C++ are the standards. If you want people to use something not-standard you need to provide something which is <i>far better</i> in your own language than in the standards in order to compel people to switch. Being a little bit better isn't good enough, you need to be a <i>lot</i> better. Strong typing, garbage collection, and higher-order functions are all things which <i>suck</i> in C/C++. If you want people to adopt your language you should offer full support for these things because that gives you a compelling reason to switch.<p><i>Otherwise on types, PL/I took the attitude...</i><p>Read more about strong typing and read about type or category theory (preferably both). C and Java types are not strong typing, they're typing done in probably the worst possible way. Learn ML.<p><i>Or can do a calculation, enter a Begin-End block and do the automatic allocation inside that block.</i><p>Welcome to RAII, circa 2000.<p><i>To get around the problem, end up using C structures or C++ classes, both of which are much less efficient.</i><p>Only in C or C++ compilers from 1995...<p><i>Actually, can claim that for some years Rexx, with a few extensions for some lower level OS access, basically 'ran' all of IBM: There were about 4000 mainframes around the world connected with simple bisync lines. In the end, it all looked much like the Internet today. So, the mainframes were acting as both the servers and the routers. The hard work of the routing, security, etc. was done with 'server virtual machines' programmed mostly in Rexx with a few routines for some lower level access. It worked surprisingly well. Rexx was no toy.</i><p>It really is. IBM hasn't even come close to building what would be termed a modern distributed system infrastructure. There's no PL/I equivalent for MapReduce, BigTable, GFS, etc.<p><i>A lot of nonsense. On IBM, PL/I used standard OS calling sequences. Calling Fortran, Cobol, assembler, and C was routine. I wrote a collection of routines in PL/I to call C to call the TCP/IP routines. Occasionally I called assembler from PL/I.</i><p>OS calling sequences are the bare-minimum. If I wanted to optimize my Python code by dropping down and rewriting the code in a systems language, C has my back. Good luck with PL/I.<p>You seem to be using a lot of examples from HPC but they're not really relevant. HPC is a pretty easy target because you get to make a lot of assumptions about the DS you're architecting and the software that will be run on it. PL/I is just a dead language -- there's no reason to ever switch to it and while it may have been slightly better than C++ during IBM's heyday, the world has moved on. Even scientific computing prefers parallel Fortran, which ever since the latest version is incredibly fast.","created_at":"2011-07-25T21:48:10Z","created_at_i":1311630490,"objectID":"2804839","parent_id":2804579,"story_id":2800538,"story_title":"A note to Google recruiters (and on Google hiring practices)","story_url":"http://infotrope.net/2011/07/21/a-note-to-google-recruiters/","updated_at":"2024-09-19T17:49:29Z"}],"hitsPerPage":20,"nbHits":62,"nbPages":4,"page":0,"params":"query=parallel+Claudes+C+compiler&advancedSyntax=true&analyticsTags=backend","processingTimeMS":41,"processingTimingsMS":{"_request":{"queue":1,"roundTrip":21},"afterFetch":{"format":{"highlighting":3,"total":3},"merge":{"mergeLoop":{"prepareNextHit":6,"total":6},"total":6},"total":6},"fetch":{"query":17,"scanning":15,"total":33},"total":41},"query":"parallel Claudes C compiler","serverTimeMS":46}
