[HN Gopher] Using Obscure Graph Theory to Solve Programming Lang...
       ___________________________________________________________________
        
       Using Obscure Graph Theory to Solve Programming Languages Problems
        
       Author : matt_d
       Score  : 14 points
       Date   : 2025-05-13 20:09 UTC (2 hours ago)
        
 (HTM) web link (reasonablypolymorphic.com)
 (TXT) w3m dump (reasonablypolymorphic.com)
        
       | tekknolagi wrote:
       | This seems, at least upon first read, analogous to global value
       | numbering (GVN). Or, depending on how you look at it, common
       | subexpression elimination (CSE). I am mostly wondering why they
       | are not mentioned in the article.
        
       | georgewsinger wrote:
       | If you like reasoning about a program in terms of expression
       | trees/graphs, I recently discovered that Wolfram Language has
       | built-ins for this:
       | 
       | https://reference.wolfram.com/language/ref/ExpressionTree.ht...
        
       ___________________________________________________________________
       (page generated 2025-05-13 23:01 UTC)