no. 3
Proposal for a natural formalization of functional programming concepts
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 22 (1988) no. 3, pp. 341-360. 
@article{ITA_1988__22_3_341_0,
     author = {Bellot, Patrick and Sarni, Djamil},
     title = {Proposal for a natural formalization of functional programming concepts},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {341--360},
     publisher = {EDP-Sciences},
     volume = {22},
     number = {3},
     year = {1988},
     mrnumber = {963596},
     zbl = {0648.68041},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1988__22_3_341_0/}
}
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
SP  - 341
EP  - 360
VL  - 22
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1988__22_3_341_0/
LA  - en
ID  - ITA_1988__22_3_341_0
ER  - 
%0 Journal Article
%A Bellot, Patrick
%A Sarni, Djamil
%T Proposal for a natural formalization of functional programming concepts
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1988
%P 341-360
%V 22
%N 3
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1988__22_3_341_0/
%G en
%F ITA_1988__22_3_341_0
Bellot, Patrick; Sarni, Djamil. Proposal for a natural formalization of functional programming concepts. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 22 (1988) no. 3, pp. 341-360. http://www.numdam.org/item/ITA_1988__22_3_341_0/

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. | MR | Zbl

2. H. P. Barendregt, The Lambda-Calculus, its Syntax and Semantics, Studies in Logic and the Foundations of Mathematics, Vol. 103, North Holland, 1981. | MR | Zbl

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.

6. P. Bellot, High order Programming in Extended FP, FPCA 85, LNCS 201 J. P. JOUANNAUD Ed., pp. 65-80, Nancy, 1985. | Zbl

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. | Zbl

9. H. B. Curry and R. Feys, Combinatory Logic I, North Holland, 1958. | MR | Zbl

10.N. Glaser, C. Hankin and D. Till, Principles of Functional Programming, Prentice/Hall International, 1984. | MR | Zbl

11.J. W. Klop, Combinatory Reduction Systems, Dissertation, University of Utrecht, 1980. | MR

12. J. R. Hindley and J. P. Seldin, Introduction to Combinators and Lambda-Calculus, London Mathematical Society, Student Texts 1, Cambridge University Press, 1986. | MR | Zbl

13. S. C. Kleene, Introduction to Metamathematics, Van Nostrand 1952. | MR | Zbl

14. S. C. Kleene, Introduction to Mathematical Logic, Van Nostrand, 2nd ed., 1979. | MR

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. | Zbl

17. E. G. Wagner, URS : in an Axiomatic Approach to Computability, formation Sciences 1, 1969, pp. 343-362. | MR