User loginNavigation |
Lazy Graph Reduction and abstract machinesI'm trying to find some interesting abstract machines that support lazy graph reduction. Haskell implementations seem to prefer the Spineless Tagless G-Machine (GHC, NHC, YHC), and the G-Machine (Hugs). I've heard that Clean is based on the ABC Machine, but I can't really find any literature on it. I've also seen the machines that SP Jones mentions in his "Implementing functional languages, a tutorial", which IIRC includes: Template Instantiation, the G-Machine, and the Three Instruction Machine (TIM). I have a couple of questions about this: 1) Are there any other interesting machines out there? EDIT: Spineless Tagless G-Machine, not Stackless... By Sean Gillespie at 2008-10-01 15:28 | LtU Forum | previous forum topic | next forum topic | other blogs | 11395 reads
|
Browse archivesActive forum topics
|
Recent comments
6 days 19 hours ago
1 week 4 days ago
1 week 5 days ago
1 week 5 days ago
2 weeks 3 days ago
2 weeks 6 days ago
2 weeks 6 days ago
2 weeks 6 days ago
4 weeks 2 days ago
4 weeks 3 days ago