4 ms·
https://www.cs.york.ac.uk/fp/reduceron/ https://www.cs.york.ac.uk/fp/reduceron/ It's still fairly young technology but there has been work on processors for HL
by sourceless 11y ago
https://www.cs.york.ac.uk/fp/reduceron/ https://www.cs.york.ac.uk/fp/reduceron/
It's still fairly young technology but there has been work on processors for HLLs. The one above (if my understanding is correct) is effectively a combinator processor, and its input language is a subset of Haskell.
(and now I notice it's already linked in the article comments, but I'll keep it here for those interested.)
- _chris_ 11y agoYah, the author does a follow-up blogpost (albeit, only a few days later, and not years, hehe). http://yosefk.com/blog/high-level-cpu-follow-up.html http://yosefk.com/blog/high-level-cpu-follow-up.html
- sourceless 11y agoI don't 100% agree with the author that the reduceron is a "Haskell Machine" - it seems very much to be the motivation for the project, but I think it's more of a 'strongly typed functional language machine'. I'd be inclined to think that the more general machine Yosef wishes for would come with time and more languages implemented. Heck, maybe restricting the kind of languages best supported is a necessary feature - you can't say that von Neumann doesn't best support imperative & procedural languages after all.