Measures of ideal execution architectures
IBM Journal of Research and Development
Distributed execution of functional programs using serial combinators
IEEE Transactions on Computers
Data flow graph optimization in ifi
Proc. of a conference on Functional programming languages and computer architecture
The categorical abstract machine
Proc. of a conference on Functional programming languages and computer architecture
The g-machine: a fast, graph-reduction evaluator
Proc. of a conference on Functional programming languages and computer architecture
An execution architecture for FP
IBM Journal of Research and Development
Lambda-calculus combinators and functional programming
Lambda-calculus combinators and functional programming
A simple applicative language: mini-ML
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Code generation techniques for functional languages
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Mechanisms for efficient multiprocessor combinator reduction
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Partitioning parallel programs for macro-dataflow
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
NORMA: a graph reduction processor
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Implementing functional languages in the Categorical Abstract Machine
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Communications of the ACM
Compiling a functional language
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Super-combinators a new implementation method for applicative languages
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
An investigation of the relative efficiencies of combinators and lambda expressions
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
SKIM - The S, K, I reduction machine
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
The contour model of block structured processes
ACM SIGPLAN Notices
| Hi-index | 0.00 |
A technique is presented for comparing the performance of functional languages with different evaluation strategies running on different machines. A set of small benchmarks is used, and th execution times of these programs running in the functional language and in the implementation language of the functional system are compared. The ratio of these execution times measured how well the functional system used the resources of the underlying hardware and implementation language. Also two functional programming systems are described. One system is a graph reduction interpreter for lambda calculus. The other is a DEL-style intermediate instruction set architecture for FP. The benchmarks in FP and the performances of the two systems on these benchmarks are presented.