Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
International Symposium on Programming (Programming 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 167))

Included in the following conference series:

  • 133 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographie

  1. J.W. BACKUS, Can programming be liberated from the Von Neumann style? dans CACM, Vol 21, No 8, pp 613–641, 1978

    Google Scholar 

  2. J.W. BACKUS, Reduction languages and variable-free programming, dans IBM Research report, RJ 1010, 1972

    Google Scholar 

  3. H.P. BARENDREGT, Normed Uniformly Reflexives Structures, dans Notes on Logic and computer sciences, LOCOS 24, Janvier 1975

    Google Scholar 

  4. H.P. BARENDREGT, The lambda-calculus, North Holland Pub. V103

    Google Scholar 

  5. P. BELLOT, Systèmes de programmation sans variables, Compterendus de l'Académie des Sciences, I 274

    Google Scholar 

  6. P. BELLOT, Propriétés Logico-Combinatoire des systèmes de programmation sans variables, Thèse de 3ème cycle, dec. 1983

    Google Scholar 

  7. C. BOEHM, Combinatory foundations of functional programming, ACM, Symposium on Lisp and functional programming, 1982

    Google Scholar 

  8. H.B. CURRY, Combinatory Logic Vol. I, North Holland, 1958

    Google Scholar 

  9. S.C. KLEENE, Introduction to meta-mathematics, Van Nostrand NY

    Google Scholar 

  10. J. Mac CARTHY, A basis for mathematical theory of computer sciences, computer programming and formal system, Bradford & Hircshing, North Holland 1963, pp 33–70

    Google Scholar 

  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 1978

    Google Scholar 

  12. B. ROBINET, Un modèle Logico-combinatoire des systèmes de Backus Publications Litp 80-21, 1980

    Google Scholar 

  13. B. ROBINET, Programmation sans variables ou la Logique Combinatoire à la Backus, Grosplan Afcet, Cargese 1979

    Google Scholar 

  14. H. ROGERS, Theory of recursive functions and effective computability, 1967, Mac Graw Hill

    Google Scholar 

  15. H.R. STRONG, Algeabrically generalized recursive function theory IBM J. of Research and development, 1968, pp 465–475

    Google Scholar 

  16. E.G. WAGNER, URS: an axiomatic approach to computability, Information sciences, vol I, 1968

    Google Scholar 

  17. E.G. WAGNER, URS: on the nature of Godelisation and relative computability, Trans. Amer. Math. Society 1969, pp 1–41

    Google Scholar 

  18. J.H. WILLIAMS, Formal representations of recursively defined functional programs, Proc. Penniscola 1981, pp 460–470

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LITP et Institut de Programmation, Université Pierre et Marie CURIE, Tour 55–65, bureau 410 4 place Jussieu, 75230, Paris Cedex 05

    Patrick Bellot

Authors
  1. Patrick Bellot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Paul B. Robinet

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bellot, P. (1984). Semantiques comparees des systemes de programmation fonctionnelle FP et FFP de J.W. Backus. In: Paul, M., Robinet, B. (eds) International Symposium on Programming. Programming 1984. Lecture Notes in Computer Science, vol 167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12925-1_25

Download citation

  • DOI: https://doi.org/10.1007/3-540-12925-1_25

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12925-7

  • Online ISBN: 978-3-540-38809-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation