[HN Gopher] Implementing a functional language with graph reduct...
       ___________________________________________________________________
        
       Implementing a functional language with graph reduction (2021)
        
       Author : Bogdanp
       Score  : 39 points
       Date   : 2025-07-25 17:20 UTC (5 hours ago)
        
 (HTM) web link (thma.github.io)
 (TXT) w3m dump (thma.github.io)
        
       | tromp wrote:
       | A similar implementation of a large subset of Haskell was done by
       | Ben Lynn in a winning IOCCC entry as described at [1]. The graph
       | reduction engine is the small C programs shown in [2].
       | 
       | A much larger and more production-ready implementation of Haskell
       | into combinatory logic was made by Lennart Augustsson [3].
       | 
       | [1] https://crypto.stanford.edu/~blynn/compiler/
       | 
       | [2] https://crypto.stanford.edu/~blynn/compiler/c.html
       | 
       | [3] https://github.com/augustss/MicroHs
        
       | taliesinb wrote:
       | Given that whole name binding thing is ultimately a story of how
       | to describe a graph using a tree, I was primed to look for
       | monoidal category-ish things, and sure enough the S and K
       | combinators look very much like copy and delete operators; counit
       | and comultiplication for a comonoid. That's very vibe-based,
       | anyone know of a formal version of this observation?
        
       ___________________________________________________________________
       (page generated 2025-07-25 23:01 UTC)