<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: developedby</title><link>https://news.ycombinator.com/user?id=developedby</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Tue, 07 Apr 2026 08:13:22 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=developedby" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by developedby in "Bend: a high-level language that runs on GPUs (via HVM2)"]]></title><description><![CDATA[
<p>That's the main idea!</p>
]]></description><pubDate>Fri, 17 May 2024 17:13:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=40392080</link><dc:creator>developedby</dc:creator><comments>https://news.ycombinator.com/item?id=40392080</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40392080</guid></item><item><title><![CDATA[New comment by developedby in "Bend: a high-level language that runs on GPUs (via HVM2)"]]></title><description><![CDATA[
<p>Bending is an operation similar to folding, both in real life and in the language.
While fold is recursive on data, bend is recursive on a boolean condition (like a pure while that supports multiple branching recursion points).<p>I was actually looking forward to seeing someone from Bend to make a comment like this</p>
]]></description><pubDate>Fri, 17 May 2024 16:43:52 +0000</pubDate><link>https://news.ycombinator.com/item?id=40391751</link><dc:creator>developedby</dc:creator><comments>https://news.ycombinator.com/item?id=40391751</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40391751</guid></item><item><title><![CDATA[New comment by developedby in "Bend: a high-level language that runs on GPUs (via HVM2)"]]></title><description><![CDATA[
<p>The first `fork` is from using bend and passing the initial state<p><pre><code>  The program above will initialize a state (`x = 0`), and then, for as long as `x < 3`,
  it will "fork" that state in two, creating a `Tree/Node`, and continuing with `x + 1`.
  When `x >= 3`, it will halt and return a `Tree/Leaf` with `7`.
  When all is done, the result will be assigned to the `tree` variable:</code></pre></p>
]]></description><pubDate>Fri, 17 May 2024 11:42:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=40388815</link><dc:creator>developedby</dc:creator><comments>https://news.ycombinator.com/item?id=40388815</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40388815</guid></item></channel></rss>