<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>tikhonj</author><text>If you&apos;re interested in something similar but a little more theoretical, take a look at &quot;Simply Easy&quot;[1], a little paper on implementing a couple of variations on the lambda calculus. The main idea is to demonstrate how to evaluate a dependently typed language.&lt;p&gt;It starts by looking at how to evaluate the simply typed lambda calculus and then going from that to a dependently typed lambda calculus. Surprisingly, the transformation is not all that complicated!&lt;p&gt;The actual code is in Haskell.&lt;p&gt;[1]: &lt;a href=&quot;http://strictlypositive.org/Easy.pdf&quot; rel=&quot;nofollow&quot;&gt;http://strictlypositive.org/Easy.pdf&lt;/a&gt;</text><parent_chain></parent_chain></comment><story><title>Write Yourself a Haskell in Lisp</title><url>http://gergo.erdi.hu/blog/2013-02-17-write_yourself_a_haskell..._in_lisp/</url></story>
<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>saosebastiao</author><text>Cool. Does it qualify as some sort of mutual recursion if you use haskell to build a lisp which builds haskell?</text><parent_chain></parent_chain></comment><story><title>Write Yourself a Haskell in Lisp</title><url>http://gergo.erdi.hu/blog/2013-02-17-write_yourself_a_haskell..._in_lisp/</url></story>