Semantiques comparees des systemes de programmation fonctionnelle FP et FFP de J.W. Backus

  • Patrick Bellot
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 167)


Nous Allons Nous Utiliserons Nous Montrerons Nous Construisons Nous Posons 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J.W. BACKUS, Can programming be liberated from the Von Neumann style? dans CACM, Vol 21, No 8, pp 613–641, 1978Google Scholar
  2. [2]
    J.W. BACKUS, Reduction languages and variable-free programming, dans IBM Research report, RJ 1010, 1972Google Scholar
  3. [3]
    H.P. BARENDREGT, Normed Uniformly Reflexives Structures, dans Notes on Logic and computer sciences, LOCOS 24, Janvier 1975Google Scholar
  4. [4]
    H.P. BARENDREGT, The lambda-calculus, North Holland Pub. V103Google Scholar
  5. [5]
    P. BELLOT, Systèmes de programmation sans variables, Compterendus de l'Académie des Sciences, I 274Google Scholar
  6. [6]
    P. BELLOT, Propriétés Logico-Combinatoire des systèmes de programmation sans variables, Thèse de 3ème cycle, dec. 1983Google Scholar
  7. [7]
    C. BOEHM, Combinatory foundations of functional programming, ACM, Symposium on Lisp and functional programming, 1982Google Scholar
  8. [8]
    H.B. CURRY, Combinatory Logic Vol. I, North Holland, 1958Google Scholar
  9. [9]
    S.C. KLEENE, Introduction to meta-mathematics, Van Nostrand NYGoogle Scholar
  10. [10]
    J. Mac CARTHY, A basis for mathematical theory of computer sciences, computer programming and formal system, Bradford & Hircshing, North Holland 1963, pp 33–70Google Scholar
  11. [11]
    J.F. PERROT, Lisp et lambda-calcul, dans Lambda-calcul et semantique formelle des langages de programmation, Actes de la 6ème école de printemps d'informatique théorique, Litp-Ensta 1978Google Scholar
  12. [12]
    B. ROBINET, Un modèle Logico-combinatoire des systèmes de Backus Publications Litp 80-21, 1980Google Scholar
  13. [13]
    B. ROBINET, Programmation sans variables ou la Logique Combinatoire à la Backus, Grosplan Afcet, Cargese 1979Google Scholar
  14. [14]
    H. ROGERS, Theory of recursive functions and effective computability, 1967, Mac Graw HillGoogle Scholar
  15. [15]
    H.R. STRONG, Algeabrically generalized recursive function theory IBM J. of Research and development, 1968, pp 465–475Google Scholar
  16. [16]
    E.G. WAGNER, URS: an axiomatic approach to computability, Information sciences, vol I, 1968Google Scholar
  17. [17]
    E.G. WAGNER, URS: on the nature of Godelisation and relative computability, Trans. Amer. Math. Society 1969, pp 1–41Google Scholar
  18. [18]
    J.H. WILLIAMS, Formal representations of recursively defined functional programs, Proc. Penniscola 1981, pp 460–470Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Patrick Bellot
    • 1
  1. 1.LITP et Institut de ProgrammationUniversité Pierre et Marie CURIEParis Cedex 05

Personalised recommendations