This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
10. Bibliography
Backus, J., Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs, Comm. ACM 21, 8 (Aug. 1978), 613–641.
Burton, F. W., A Linear Space Translation of Functional Programs to Turner Combinators, Inf. Proc. Lett. 14, 5 (Jul. 1982), 201–204.
Cousot, P. and Cousot, R., Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixed Points, in Proc. 4th. ACM Symp. on Princ. Prog. Lang., ACM, Los Angeles, 1977.
Curry, H. B., Feys, R. and Craig, W., Combinatory Logic, Vol. I, North Holland, Amsterdam, 1958.
Friedman, D. P. and Wise, D. S., CONS Should not Evaluate its Arguments, in 3rd. Intl. Coll. in Autom. Lang. & Programming, Edinburgh, Jul. 1976, 257–284.
Gordon, M., Milner, R. and Wadsworth, C., Edinburgh LCF, CSR-11-77, Parts I and II, Dep. Comp. Sci, University of Edinburgh, Edinburgh, Scotland, 1977.
Hughes, R. J. M., Super Combinators: A New Implementation Method for Applicative Languages, in Conf. Record of the 1982 ACM Symp on LISP and Funct. Prog., ACM, Pittsburgh, PA, 15–18 Aug. 1982, 1–10.
Jones, N. D. and Muchnick, S. S., A Fixed-Program Machine for Combinator Expression Evaluation, in Conf. Record of the 1982 ACM Symp on LISP and Funct. Prog., ACM, Pittsburgh, PA, 15–18 Aug. 1982, 11–20.
Jones, N. D., Flow Analysis of Lambda Expressions, DAIMI PB-128, Comp. Sci. Dept., Aarhus Univ., Aarhus, Denmark, Jan. 1981.
Meira, S., The Kent Recursive Calculator (KRC): Syntax and Semantics, unpublished, Canterbury, U. K., 1983.
Meira, S., Abstract Interpretation Methods for Optimization of Combinatoric Code, in preparation, Computing Laboratory, University of Kent, Canterbury, U. K., 1983.
Mycroft, A., Abstract Interpretation and Optimising Transformations for Applicative Programs, Ph. D. Thesis, Dep. of Comp. Sci., Univ. of Edinburgh, Edinburgh, 1981.
Nielson, F., A Denotational Framework for Data Flow Analysis, Acta Informatica 18, 3 (1982), 265–288.
Pettorossi, A., Improving Memory utilization in Transforming Recursive Programs, in Math. Found. of Comp. Sci. 1978, J. Winkowski, ed., Springe Verlag, Zakopane, Poland, 1978, 416–425.
Schonfinkel, M., On The Building Blocks of Mathematical Logic, in From Frege to Godel — A Source Book in Mathematical Logic, 1879–1931, J. van Heijenoort, ed., Harvard Univ. Press, Cambridge, Mass, 1977.
Turner, D. A., A New Implementation Technique for Applicative Languages, Soft. Pract. and Exp. 9, (1979), 31–49.
Turner, D. A., SASL Language Manual, Comp. Lab. Report, University of Kent, Canterbury, 1979.
Turner, D. A., Recursion Equations as a Programming Language, in Functional Programming and its Applications, An Advanced Course, C. U. P., Cambridge, UK, 1982.
Turner, D. A., Another Algorithm for Bracket Abstraction, J. Sym. Log. 44, 2 (Jun. 1979), 267–270.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meira, S.L. (1984). Optimized combinatoric code for applicative language implementation. In: Paul, M., Robinet, B. (eds) International Symposium on Programming. Programming 1984. Lecture Notes in Computer Science, vol 167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12925-1_40
Download citation
DOI: https://doi.org/10.1007/3-540-12925-1_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12925-7
Online ISBN: 978-3-540-38809-8
eBook Packages: Springer Book Archive