Performance of Lazy Combinator Graph
暂无分享,去创建一个
[1] Pieter H. Hartel,et al. Statistics on graph reduction of SASL programs , 1988, Softw. Pract. Exp..
[2] Lennart Augustsson,et al. Compiling Pattern Matching , 1985, FPCA.
[3] Simon L. Peyton Jones,et al. The spineless G-machine , 1988, LISP and Functional Programming.
[4] D. A. Turner,et al. A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..
[5] R. J. M. Hughes,et al. Super-combinators a new implementation method for applicative languages , 1982, LFP '82.
[6] Richard B. Kieburtz. A RISC architecture for symbolic computation , 1987, ASPLOS 1987.
[7] Thomas Johnsson,et al. Efficient compilation of lazy evaluation , 1984, SIGPLAN '84.
[8] Thomas Johnsson,et al. The Chalmers Lazy-ML Compiler , 1989, Computer/law journal.
[9] P. H. Hartel,et al. Performance analysis of storage management in combinator graph reduction , 1989 .
[10] Richard B. Kieburtz,et al. The G-Machine: A Fast, Graph-Reduction Evaluator , 1985, FPCA.
[11] Pieter W. M. Koopman. Interactive programs in a functional language: A functional implementation of an editor , 1987, Softw. Pract. Exp..
[12] Marko C. J. D. van Eekelen,et al. CLEAN: A language for functional graph writing , 1987, FPCA.