Proposal for a natural formalization of functional programming concepts
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1988)
- Volume: 22, Issue: 3, page 341-360
- ISSN: 0988-3754
Access Full Article
topHow to cite
topBellot, Patrick, and Sarni, Djamil. "Proposal for a natural formalization of functional programming concepts." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 22.3 (1988): 341-360. <http://eudml.org/doc/92312>.
@article{Bellot1988,
author = {Bellot, Patrick, Sarni, Djamil},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {functional programming; combinatory logic; formalization; formal theory; uncurryfied combinator; polyadic application; semantics; Graal language},
language = {eng},
number = {3},
pages = {341-360},
publisher = {EDP-Sciences},
title = {Proposal for a natural formalization of functional programming concepts},
url = {http://eudml.org/doc/92312},
volume = {22},
year = {1988},
}
TY - JOUR
AU - Bellot, Patrick
AU - Sarni, Djamil
TI - Proposal for a natural formalization of functional programming concepts
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1988
PB - EDP-Sciences
VL - 22
IS - 3
SP - 341
EP - 360
LA - eng
KW - functional programming; combinatory logic; formalization; formal theory; uncurryfied combinator; polyadic application; semantics; Graal language
UR - http://eudml.org/doc/92312
ER -
References
top- 1. J. W. BACKUS, Can Programming Be Liberated from the Von Neumann Style? A Functional Style and its Algebra of Programs, C.A.C.M., Vol. 1, N° 8, 1978,pp. 613-641. Zbl0383.68013MR520392
- 2. H. P. BARENDREGT, The Lambda-Calculus, its Syntax and Semantics, Studies in Logic and the Foundations of Mathematics, Vol. 103, North Holland, 1981. Zbl0467.03010MR622912
- 3. A. BELKHIR, Programmation fonctionnelle et parallélisme, Rapport Gréco de Programmation, 1986.
- 4. F. BELLEGARDE, Rewriting Systems on FP Expressions that reduce the Number of Sequences they Yields, A.C.M. Symposium on Lisp and Functional Programming, Austin, 1984.
- 5. P. BELLOT, Propriétés logico-combinatoires des systèmes de programmation sans variable, Thèse 3e cycle, U.P.M.C. Paris-VI, Rapport LITP 84-30, 1983. Zbl0527.68007
- 6. P. BELLOT, High order Programming in Extended FP, FPCA 85, LNCS 201 J. P. JOUANNAUD Ed., pp. 65-80, Nancy, 1985. Zbl0574.68013
- 7. P. BELLOT, Sur les sentiers du Graal, étude, conception et réalisation d'un langage de programmation sans variable, Thèse d'État, U.P.M.C. Paris-VI, Rapport LITP 86-62, 1986.
- 8. P. BELLOT, Graal: a Functional Programming System with Uncurryfied Combinators and its Reduction Machine, ESOP86, LNCS 213, B. ROBINET Ed., pp. 82-98, Saarbrucken, 1986. Zbl0587.68002
- 9. H. B. CURRY and R. FEYS, Combinatory Logic I, North Holland, 1958. Zbl0175.27601MR94298
- 10. N. GLASER, C. HANKIN and D. TILL, Principles of Functional Programming, Prentice/Hall International, 1984. Zbl0649.68002MR894921
- 11. J. W. KLOP, Combinatory Reduction Systems, Dissertation, University of Utrecht, 1980. MR603274
- 12. J. R. HINDLEY and J. P. SELDIN, Introduction to Combinators and Lambda-Calculus, London Mathematical Society, Student Texts 1, Cambridge University Press, 1986. Zbl0614.03014MR879272
- 13. S. C. KLEENE, Introduction to Metamathematics, Van Nostrand 1952. Zbl0047.00703MR51790
- 14. S. C. KLEENE, Introduction to Mathematical Logic, Van Nostrand, 2nd ed., 1979. MR524725
- 15. B. ROBINET, Un modèle logico-combinatoire des systèmes de Backus, Rapport LITP 80-21, 1980.
- 16. D. A. TURNER, A New Implementation Technique for Applicative Language, Software-Practice and Experience, Vol. 9, 1979, pp. 31-49. Zbl0386.68009
- 17. E. G. WAGNER, URS : in an Axiomatic Approach to Computability, formation Sciences 1, 1969, pp. 343-362. MR262078
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.