Tell me more ×
Programmers Stack Exchange is a question and answer site for professional programmers interested in conceptual questions about software development. It's 100% free, no registration required.

I'm doing some independent research/study with a professor who's a very functional guy. The goal is to examine more of what's happening behind the scenes with functional languages than we normally would during the course of the class I'm also taking with him (in which we're writing interpreters). The independent course will go beyond the interpreter level and look at how we might translate some of the concepts to a hardware machine.

Specifically, my professor mentioned two books, Functional Programming: Application and Implementation by Peter Henderson -- which covers the SECD machine (an idealized machine for functional computing), and The Implementation of Functional Programming Languages by Simon Peyton Jones -- which covers the SKI machine (and of course combinators).

From the poking around I've done, these two books seem pretty legendary in the functional programming world -- which is great (I still think K&R is one of the best C books). But, both books are also more than 30 years old. I'm curious if there has been any further research or instructive literature produced regarding these topics. It would also be interesting to know if any of these concepts are making their way into modern compilers and close-to-the-kernel interpreters.

share|improve this question
1  
Are you specifically looking for research on call-by-value languages? – dan_waterworth Jan 31 at 9:03
1  
Perhaps. I guess I'm most interested in modern manifestations of SECD machines. Has anyone implemented SECD hardware? Are pure functional languages using only combinators being actively researched and developed and written about? Has anyone written modern literature or updates to these two > 35 year-old texts which seem to introduce an interesting sub-genre of computer science/engineering? If research on call-by-value languages seems relevant, I'd love to hear about it. – David Cowden Jan 31 at 17:38
3  
You might find this interesting, although it was created for lazy languages. – dan_waterworth Feb 1 at 18:56

1 Answer

Here is a more recent paper by Simon Peyton Jones on the Spineless Tagless G-machine, which was (and still is) used as an intermediate language in the Glasgow Haskell Compiler:

Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine (1992).

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.