Preview
Unable to display preview. Download preview PDF.
References
J.W. Backus, Can programming be liberated from Von Neumann style? A functional style and its Algebre of Programs, CACM 21, Number 8, 1978.
J.W. Backus, The algebra of Functional Programming, function level reasoning, linear equations and extended definitions, in Formalization of Programming concepts, LNCS 107, Peniscola 1981.
H.P. Barendregt, The lambda-calculus, its syntax and semantics, Studies in Logic and the Foundations of Mathematics 103, J. Barwise ed., North Holland, 1981.
F. Bellegarde, Rewriting systems on FP expressions that reduce the number of sequences they yield, Symposium on Lisp and Functional Programming, 1984.
P. Bellot, Propriétes Logico-Combinatoires des systèmes de programmation sans variables, Thèse de troisième cycle, Rapport LITP 84-30, Université PARIS VI, 1984.
P. Bellot, JYM 2.0, Un interprête des systèmes FP, manuel d'utilisation, Rapport Gréco de Programmation RG 9.84, 1984.
P. Bellot, Sémantiques comparées des systèmes de programmation fonctionelle sans variables de J.W. Backus, International Symposium on Programming, 6th Colloquium, B. Robinet ed., LNCS 167, pp 23–34, Springer-Verlag, 1984.
C. Boehm, Combinatory foundations of Functional Programming, Symposium on Lisp and Functional Programming, 1982.
J. Gibert, J. Shepherd, From Algebra to Compiler, an implementation of Functional Programming, Internal Report, University of Melbourne, Australia, 1983.
J. Gibert, An introduction to functional programming via mu-fp, International Report, University of Melbourne, Australia, 1983.
J. Gibert, J. Shepherd, Programming the J-Machine, Internal Report, University of Melbourne, Australia, 1984.
J.Y. Halpern, J.H. Williams, E.L. Wimmers, T.C. Winkler, Denotational semantics and rewriting rules for FP, Research report RJ 4525(48653) 12/5/84 Computer Sciences, IBM research laboratory, San Jose CA 95193.
R. Kantor, G. Sontacchi, A Lisp-interprèter of functional programming realized with combinators, Internal report, University of Rome, 1983.
C.T. Lieu, Etude d'un point-fixeur dans des ensembles restreints, Rapport LITP 85-07, Université PARIS VI, 1985.
J.F. Perrot, Lisp et Lambda-calcul, Actes de la sixième école de Printemps d'Informatique théorique, B. Robinet ed., Publications LITP, La Châtre 1978.
B. Robinet, Un modèle Logico-Combinatoire des systèmes de Backus, Rapport LITP 80-21, 1980.
J.H. Williams, Formal representations of recursively defined functional programs, Formalization of programming concepts, LNCS 107, Penniscola 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bellot, P. (1985). High order programming in extended FP. In: Jouannaud, JP. (eds) Functional Programming Languages and Computer Architecture. FPCA 1985. Lecture Notes in Computer Science, vol 201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15975-4_30
Download citation
DOI: https://doi.org/10.1007/3-540-15975-4_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15975-9
Online ISBN: 978-3-540-39677-2
eBook Packages: Springer Book Archive