Sigbjørn Finne
- BPR88.G.L. Burn, S.L. Peyton Jones, and J.D. Robson. The spineless G-machine. In Proceedings of the 1988 A CM Symposium on Lisp and Functional Programming, pages 244-258, Snowbird, Utah, 25-27 July 1988. Google Scholar
Digital Library
- Bur87.G.L. Burn. Evaluation transformers - A model for the parallel evaluation of functional languages (extended abstract). In G. Kahn, editor, Proceedings of the Functional Programming Languages and Computer Architecture Conference, pages 446- 470. Springer-Verlag LNCS 274, September 1987. Google ScholarDigital Library
- Bur90.G.L. Burn. Using projection analysis in compiling lazy functional programs. In Proceedings of the 1990 A CM Conference on Lisp and Functional Programming, pages 227-241, Nice, France, 27-29 June 1990. Google ScholarDigital Library
- Bur91.G.L. Burn. Lazy Functional Languages: Abstract Interpretation and Compilation. Research Monographs in Parallel and Distributed Computing. Pitman in association with MIT Press, 1991. 238pp. Google ScholarDigital Library
- BW88.R. Bird and P.L. Wadler. An introduction to Functional Programming. Prentice-Hall Series in Computer Science. Prentice-Hall international (UK) Ltd., Hemel Hempsteacl, Hertfordshire, England, 1988. Google ScholarDigital Library
- Hal92.C.V. Hall. An optimist's view oflife: Transforming list expressions. Technical report, Department of Computer Science, University of Glasgow, 1992.Google Scholar
- Har91a.P.H. Hartel. On the benefits of different analyses in the compilation of lazy functional languages. In 3rd Informal International Workshop on the Parallel Implementation of Functional Languages, pages 123-145, Southampton, 1991.Google Scholar
- Har91b.P.H. Hartel. Performance of lazy combinator graph reduction. Software -- Practice and Experience, 21(3):299-329, March 1991. Google ScholarDigital Library
- HB92.D.B. Howe and G.L. Burn. Experiments with strict STG-code. In 4th Informal International Workshop on the Parallel Implementation of Functional Languages, Aachen, 28-30 September 1992.Google Scholar
- HKL92.G. Hogen, A. Kindler, and R. Loogen. Automatic parallelisation of lazy functional programs. In Proceedings of ESOP92, pages 254-268. Springer- Vedag LNCS582, 1992. Google ScholarDigital Library
- Hol83.S. HolmstrSm. Polymorphic Type Systems and Concurrent Computation in Functional Languages. PhD thesis, Chalmers Tekniska HSgskola, GSteborg, Sweden, 1983.Google Scholar
- Hug89.R.J.M Hughes. Why functional programming matters. The Computer Journal, 32(2):98-107, April 1989. Google ScholarDigital Library
- Hun89.S. Hunt. Frontiers and open sets in abstract interpretation. In Proceedings of the Conference on Functional Programming Languages and Com. puter Architecture, Imperial College, London, 11- 13 September 1989. Google ScholarDigital Library
- Joh87.T. Johnsson. Compiling Lazy Functional Languages. PhD thesis, Chalmers Tekniska HSgskola, GSteborg, Sweden, 1987.Google Scholar
- KLB91.H. Kingdon, D.R. Lester, and G.L. Burn. A transputer-based HDG-machine. The Computer Journal, 34(4):290-301, August 1991. Google ScholarDigital Library
Index Terms
- Assessing the evaluation transformer model of reduction on the spineless G-machine
Recommendations
The spineless G-machine
LFP '88: Proceedings of the 1988 ACM conference on LISP and functional programmingRecent developments in functional language implementations have resulted in the G-machine, a programmed graph-reduction machine. Taking this as a basis, we introduce an optimised method of performing graph reduction, which does not need to build the ...
Compiling Lazy Functional Programs Based on the Spineless Tagless G-Machine for the Java Virtual Machine
FLOPS '01: Proceedings of the 5th International Symposium on Functional and Logic ProgrammingA systematic method of compiling lazy functional programs based on the Spineless Tagless G-machine (STGM) is presented for the Java Virtual Machine (JVM). A new specification of the STGM, which consists of a compiler and a reduction machine, is ...
Putting the Spine Back in the Spineless Tagless G-Machine: An Implementation of Resumable Black-Holes
IFL '98: Selected Papers from the 10th International Workshop on 10th International WorkshopInterrupt handling is a tricky business in lazy functional languages: we have to make sure that thunks that are being evaluated can be halted and later restarted if and when they are required. This is a particular problem for implementations which use ...
Comments