Removing partial parametrization for efficient implementation of functional languages

Authors:
Husheng Liao
Affiliations:
Department of Software Engineering, Beijing Computer Institute, No. 24 Xi-San-Huan-Bei Road, Beijing, People's Republic of China
Venue:
Computer Languages
Year:
1992

Citing 3
Cited 0

Lambda lifting: transforming programs to recursive equations

Proc. of a conference on Functional programming languages and computer architecture
Efficient compilation of lazy evaluation

SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Super-combinators a new implementation method for applicative languages

LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a program transformation technique for functional languages called removing partial parametrization. By transforming functional programs into equivalent ones without partial parametrization, each function is applied to the same number of arguments as its formal parameters. A new method of improving the efficiency of the implementation of functional language is to design the compiler according to the features of the program without partial parametrization. We have used this method in the environment-based implementation of the functional programming language LK. Programs run considerably faster and consume less memory space than traditional ones.