https://hackerpaper.kaipfister.de/p/1403.0749/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=12605888urn:hackerpapers:mention:1403.0749:12605888Thu, 29 Sep 2016 15:13:07 GMT<p>Yeah, the free monad structures involve lots of lambdas. It&#x27;s not so much that information is &quot;lost&quot;, more that you cannot see beyond the next lambda abstraction. From a DSL perspective, it&#x27;s like you can only inspect the program so far as to know the next statement in the &quot;do&quot; block. To see what the next statement will be, you need to actually evaluate the current one. Instead of free monads, if you want very analyzable structures, look at free applicative functors. &quot;Applicative functors are a generalisation of monads. Both allow the expression of effectful computations into an otherwise…</p><p><a href="https://hackerpaper.kaipfister.de/p/1403.0749/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.PL