This is an automated archive made by the Lemmit Bot.

The original was posted on /r/programminglanguages by /u/kawabunda on 2024-11-01 22:45:50+00:00.

Hi guys :) French undergrad here (and new here :D). In my study path (Prépa for french people), we as students are required to do a tiny bit of research on an idea we got related to a field and present it in front of specialists of the said field. The field I chose is PLs and especially Parsing and Type theory. Basically when building my own language, I noticed that HM’s Algorithm W was working similarly (recursively) to a recursive descent parser (surprise!). I then saw no reason why we wouldn’t merge the two to maybe drop a constant in front of the time complexity of the two steps. After a bit of research, several rewrite and some struggles, I finally have a proof of concept using the pomymorphic LC’s grammar and HM type system. My question for you is : have you seen that anywhere before ? Do you think this idea has potential and should be digged more into (maybe toward a formalisation of the algorithm) ? Here is the GH repo of the project, the latest changes are made on the ‘2.0-typed’ branch. Thanks in advance! (Also don’t pay attention to the grammar in the README.md, it is no longer in use).