<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>List on Hillel Wayne</title>
    <link>https://www.hillelwayne.com/tags/list/</link>
    <description>Recent content in List on Hillel Wayne</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <lastBuildDate>Wed, 25 Mar 2020 00:00:00 +0000</lastBuildDate>
    
	<atom:link href="https://www.hillelwayne.com/tags/list/index.xml" rel="self" type="application/rss+xml" />
    
    
    <item>
      <title>10 Most(ly dead) Influential Programming Languages</title>
      <link>https://www.hillelwayne.com/post/influential-dead-languages/</link>
      <pubDate>Wed, 25 Mar 2020 00:00:00 +0000</pubDate>
      
      <guid>https://www.hillelwayne.com/post/influential-dead-languages/</guid>
      <description>The other day I read 20 most significant programming languages in history, a &amp;ldquo;preposterous table I just made up.&amp;rdquo; He certainly got preposterous right: he lists Go as &amp;ldquo;most significant&amp;rdquo; but not ALGOL, Smalltalk, or ML. He also leaves off Pascal because it&amp;rsquo;s &amp;ldquo;mostly dead&amp;rdquo;. Preposterous! That defeats the whole point of what &amp;ldquo;significant in history&amp;rdquo; means.
So let&amp;rsquo;s talk about some &amp;ldquo;mostly dead&amp;rdquo; languages and why they matter so much.</description>
    </item>
    
    <item>
      <title>Just a Whole Bunch of Different Tests</title>
      <link>https://www.hillelwayne.com/post/a-bunch-of-tests/</link>
      <pubDate>Mon, 02 Apr 2018 00:00:00 +0000</pubDate>
      
      <guid>https://www.hillelwayne.com/post/a-bunch-of-tests/</guid>
      <description>I&amp;rsquo;ve been working on a bunch of longform obligation pieces and while they&amp;rsquo;re a lot of fun, they&amp;rsquo;re also steadily driving me insane. So I took a day off to write about all of the kinds of automated testing I know about. I&amp;rsquo;m defining tests here to be &amp;ldquo;an independent verification program that, as part of verification, executes the code we want to verify.&amp;rdquo; This means types are not tests, as they don&amp;rsquo;t involve execution of the code, and contracts are not tests, because they&amp;rsquo;re not executed as an independent program.</description>
    </item>
    
    <item>
      <title>List of TLA&#43; Examples</title>
      <link>https://www.hillelwayne.com/post/list-of-tla-examples/</link>
      <pubDate>Thu, 08 Mar 2018 00:00:00 +0000</pubDate>
      
      <guid>https://www.hillelwayne.com/post/list-of-tla-examples/</guid>
      <description>People always tell me that the hardest part of learning TLA+ is finding good examples. This makes sense to me: most of the main ones out there are either toy problems or immensely complex algorithms. It&amp;rsquo;s sort of the nature of TLA+: if you&amp;rsquo;re using it, you&amp;rsquo;re trying to design something complicated, and that&amp;rsquo;s usually because you&amp;rsquo;re trying to sell something complicated.
Also, the community is tiny. You could probably fit all of the TLA+ experts in the world in a small coffee shop.</description>
    </item>
    
    <item>
      <title>Monad Tutorials for Other Topics</title>
      <link>https://www.hillelwayne.com/post/monad-tutorials/</link>
      <pubDate>Mon, 05 Mar 2018 00:00:00 +0000</pubDate>
      
      <guid>https://www.hillelwayne.com/post/monad-tutorials/</guid>
      <description>&amp;ldquo;Mathematics doesn&amp;rsquo;t have a sense of time, but often we need to track time. So programmers borrow an idea from the field of formal logic and replace all functions (f: A → B) ↦ f: A × T → B where T is the partially ordered set t1 ... tn. If T is totally ordered we can then define a mutation as a tuple in M ⊆ Var × Val × Val × T such that &amp;lt;x, a, b, t&amp;gt; ∈ M ⇔ x[b, t&#39;] ∈ x&#39;[a, t].</description>
    </item>
    
    <item>
      <title>Important Women in CS Who Aren&#39;t Grace Hopper</title>
      <link>https://www.hillelwayne.com/post/important-women-in-cs/</link>
      <pubDate>Fri, 26 Jan 2018 00:00:00 +0000</pubDate>
      
      <guid>https://www.hillelwayne.com/post/important-women-in-cs/</guid>
      <description>I&amp;rsquo;m tired of hearing about Grace Hopper, Margaret Hamilton, and Ada Lovelace. Can&amp;rsquo;t we think of someone else for once? I went ahead and compiled a bunch of really important women according to some fairly arbitrary rules:
 There&amp;rsquo;s a specific thing you can point to and say &amp;ldquo;That. That&amp;rsquo;s their contribution.&amp;rdquo; This leaves out a lot of really qualified people who made lots of general contributions, but I wanted to keep this list fixed on soundbites.</description>
    </item>
    
  </channel>
</rss>