Abstract
This paper considers various approaches to the solving the problems of implementing functional programming languages. Emphasis has been put on the basic problems, their solution in terms of abstract machines and their realizations. No claim is made with respect to an exhaustive enumeration of all current machine projects and functional languages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Backus J., Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Communicatios of ACM, Vol. 21, August 1987, pp. 280–294.
Berkling K.J., Reduction Languages for Reduction Machines. In: Proc 2nd Int. Symp. Computer Architecture. Houston, Jan. 1975. New York, ACM-IEEE 75CH0916-7c, pp. 133–140.
Berkling K.J., A Consistent Extension of the Lambda Calculus as a Base for Functional Languages. (with E. Fehr) Information and Control, 55(1–3): 89–101.
Berkling K.J., Headorder Reduction: a Graph Reduction Scheme for the Operational Lambda Calculus, Technical Report No.8613, CASE Center, Syracuse, 1986, also: Conference Proceedings of the Graph Reduction Workshop, 1986, Santa Fe, New Mexico.
de Bruijn N.G., Lambda Calculus notation with nameless dummies. Indag Math. 34, pp. 381–392, 1972.
Church A., The Calculi of Lambda-Conversions. 1941, Princeton University Press.
Clarke T.J.W., Gladstone P.J.S., MacLean C.D., Norman A.C., SKIM — S,K,I, Reduction Machine. August 1980, Proceedings 1980 Lisp Conference, Stanford, California.
Curry H.B., Feys R., Combinatory Logic Voume 1, 1958, North Holland.
Hughes R.J.M., SUPER-COMBINATORS: A New Implementation Technique for Applicative Languages, August 1982, Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming, Pittsburg, Pennsylvania.
Johnsson T., The G-Machine: an Abstract Machine for Graph Reduction. August 1983, Programming Methodology Group, Chalmers University of Technology, Göteborg, Sweden.
Kenneway J.R., and Sleep M.R., Director strings as combinators. Department of Computer Science, University of East Anglia.
Landin P.J., The mechanical evaluation of expressions. Computer Journal, Vol. 6, 1964, pp. 308–320.
Mago, G.A., A network of microprocessors to execute reduction languages. Two parts. International Journal of Computers and Information Sciences 8,5 (1979), 349–385, 8, 6, (1979), pp. 435–471.
Turner D.A., A New Implementation Technique for Applicative Languages. Software Practice and Experience, Vol. 9, 1979, pp. 31–49.
Scheevel M., NORMA: a graph reduction processor. In Proceedings of the 1986 ACM Symposium on Lisp and Functional Programming, Cambridge Mass., 1986.
Schoenfinckel M., On the Building Blocks of Mathematical Logic, 1924, From Frege to Gödel: A Sourcebook in Mathematical Logic, van Heijenoort Ed.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berkling, K. (1988). System Architectures for Functional Programming Languages: Problems and Solutions. In: Kastens, U., Rammig, F.J. (eds) Architektur und Betrieb von Rechensystemen. Informatik-Fachberichte, vol 168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-73451-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-73451-9_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18994-7
Online ISBN: 978-3-642-73451-9
eBook Packages: Springer Book Archive