Advertisement

High order programming in extended FP

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. (Backus 78).
    J.W. Backus, Can programming be liberated from Von Neumann style? A functional style and its Algebre of Programs, CACM 21, Number 8, 1978.Google Scholar
  2. (Backus 81).
    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.Google Scholar
  3. (Barendregt 81).
    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.Google Scholar
  4. (Bellegarde 84).
    F. Bellegarde, Rewriting systems on FP expressions that reduce the number of sequences they yield, Symposium on Lisp and Functional Programming, 1984.Google Scholar
  5. (Bellot 83b).
    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.Google Scholar
  6. (Bellot 83c).
    P. Bellot, JYM 2.0, Un interprête des systèmes FP, manuel d'utilisation, Rapport Gréco de Programmation RG 9.84, 1984.Google Scholar
  7. (Bellot 83d).
    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.Google Scholar
  8. (Boehm 82).
    C. Boehm, Combinatory foundations of Functional Programming, Symposium on Lisp and Functional Programming, 1982.Google Scholar
  9. (Gibert 83a).
    J. Gibert, J. Shepherd, From Algebra to Compiler, an implementation of Functional Programming, Internal Report, University of Melbourne, Australia, 1983.Google Scholar
  10. (Gibert 83b).
    J. Gibert, An introduction to functional programming via mu-fp, International Report, University of Melbourne, Australia, 1983.Google Scholar
  11. (Gibert 84).
    J. Gibert, J. Shepherd, Programming the J-Machine, Internal Report, University of Melbourne, Australia, 1984.Google Scholar
  12. (Halpern).
    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.Google Scholar
  13. (Kantor 83).
    R. Kantor, G. Sontacchi, A Lisp-interprèter of functional programming realized with combinators, Internal report, University of Rome, 1983.Google Scholar
  14. (Lieu 85).
    C.T. Lieu, Etude d'un point-fixeur dans des ensembles restreints, Rapport LITP 85-07, Université PARIS VI, 1985.Google Scholar
  15. (Perrot 78).
    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.Google Scholar
  16. (Robinet 80).
    B. Robinet, Un modèle Logico-Combinatoire des systèmes de Backus, Rapport LITP 80-21, 1980.Google Scholar
  17. (Williams 81).
    J.H. Williams, Formal representations of recursively defined functional programs, Formalization of programming concepts, LNCS 107, Penniscola 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Patrick Bellot
    • 1
    • 2
  1. 1.LITP-CNRS (LA 248)Paris
  2. 2.Ile du SaulcyUniversité de MetzMetz-Cedex

Personalised recommendations