Abstract
The aim of this article is to provide a new theorical framework based on combinators for the study and implementation of applicative programming languages. This formal theory can be viewed as a Computability theory where functions are defined in a natural and usable way because Curryfication is abolished. This allows short definitions of functions and fast graph reduction machines.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
6 References
Arvind, K.P. Gostelow The U-interpreter. IEEE Computer. vol. 15, pp. 42–49, Feb. 1982.
J.W. Backus Can Programming be liberated from the Von Neumann style? A functional style and its Algebra of Programs, CACM Vol. 1, no 8, pp 613–641, 1978.
H.P. Barendregt The Lambda-Calculus, its syntax and semantics, Studies in Logic and the Foundations of Mathematics, Vol. 103, North Holland, 1981.
A. Belkhir Programmation Fonctionnelle et Parallèlisme, Rapport Gréco de Programmation 1986.
P. Bellot Graal: a functional programming system with uncurryfied combinators and its reduction machine. ESOP 86, LNCS 213, B. Robinet ed., pp. 82–98, Saarbrucken, 1986.
P. Bellot Sur les sentiers du Graal, étude, conception et réalisation d'un langage de programmation sans variable. Thèse d'Etat, UPMC Paris 6, Rapport LITP 86-62, 1986.
P. Bellot Proposal for a natural formalization of functional programming concepts, submitted to publication at RAIRO, 1987.
L. Cardelli Compiling a Functional Language, 1984 ACM Symposium on Lisp and Functional Programming, Austin, Texas, 1984.
J. Chailloux, M. Devin, J-M. Hullot Lelisp, a portable and efficient Lisp system, 1984 ACM Symposium on Lisp and Functional Programming, Austin, Texas, 1984.
G. Cousineau, P-L. Curien, M. Mauny, A. Suà rez Combinateurs Catégoriques et Implémentation des languages fonctionnels, 13th Spring School of the LITP, LNCS. 242. G. Cousineau, P-L. Curien, B. Robinet ed., pp. 85–103. Val d'Ajol, France, 1985.
H.B. Curry, R. Feys Combinatory Logic Vol I, North Holland, 1958.
N.J. Cutland Computability, an introduction to recursive function theory, Cambridge University Press, 1980.
J.B. Dennis The varieties of DataFlow computers, IEEE Int. Conf. on Distributed Systems, 1979.
H. Glaser, C. Hankin, D. Till Principles of Functional Programming. Prentice/Hall International, 1984.
K. Godel Uber formal unentscheidbare Satze des Principia Mathematica und verwandter System I, english translation in M. Davis, The undecidable, Raven N.Y. 1965.
J.R. Hindley, J.P. Seldin Introduction to Combinators and Lambda-Calculus. London Mathematical Society, Student Texts 1, Cambridge University Press, 1986.
J.W. Klop Combinatory Reduction Systems, Ph.D. Thesis, University of Amsterdam, 1980.
E. Mendelson Introduction to Mathematical Logic, Van Nostrand, 2nd ed., 1979.
The ML handbook, Rapport Inria, 1984.
B. Robinet Combinateurs récurrents et itérateurs de Church, Rapport LITP 82-1, 1982.
H. Rogers Theory of Recursive Functions and Effective Computability, McGraw Hill, N.Y., 1967.
H.R. Strong Algebraically generalized recursive function theory, IBM Journal for Research and Development, nov. 1968.
D.A. Turner A new implementation technique for applicative language, Software-Practice and Experience, Vol. 9, pp. 31–49, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bellot, P., Jay, V. (1987). A theory for natural modelisation and implementation of functions with variable arity. In: Kahn, G. (eds) Functional Programming Languages and Computer Architecture. FPCA 1987. Lecture Notes in Computer Science, vol 274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18317-5_13
Download citation
DOI: https://doi.org/10.1007/3-540-18317-5_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18317-4
Online ISBN: 978-3-540-47879-9
eBook Packages: Springer Book Archive