Streams are not dreams

  • P. Bellot
  • B. Robinet
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 242)


Functional Programming Primitive Function Generalize Stream Empty List Reduction Machine 
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.

6) References

  1. [1]
    J.W. Backus Can programming be liberated from Von Neumann style? A functional style and its Algebra of programs., CACM 21, Volume 8, 1978.Google Scholar
  2. [2]
    F. Bellegarde Rewriting systems on FP expressions that reduce the number sequences they yeild, Symposium on Lisp and Functional Programming 1984, LNCS, pp 63–73, Austin (Texas), 1984.Google Scholar
  3. [3]
    P. Bellot JYM: un langage de programmation sans variables et ses réalisations, Actes des journées Afcet-Groplan, Bulletin BIGRE+GLOBULE, J. André éditeur, à paraître, Toulouse 1985.Google Scholar
  4. [4]
    P. Bellot High order programming in extended FP, IFIP conference on Functional Programming and Computer Architecture, LNCS 201, pp 65–80, Nancy 1985.Google Scholar
  5. [5]
    P. Bellot and B. Robinet Functional programming with uncurryfied combinators, First Workshop on Reduction Machines, to appear in LNCS, Ustica (Italy), 1985.Google Scholar
  6. [6]
    P. Bellot Graal: a functional programming system with uncurryfied combinators and its reduction machine, submitted for publication, octobre 1985.Google Scholar
  7. [7]
    J.L. Durieux Sémantique des liaisons nom-valeur; application à l'implémentation des lambda-langages, Thèse d'Etat, Université Paul Sabatier, Toulouse 1981.Google Scholar
  8. [8]
    T. Ida and J. Tanaka Functional programming with streams, Proceedings of the IFIP 9th World Computer Congress, R.E.A., Masson Ed.Google Scholar
  9. [9]
    B. Robinet Un modèle Logico-Combinatoire des systèmes de Backus, Rapport LITP 80–21, 1980.Google Scholar
  10. [10]
    B. Robinet Programmation sans variables ou la Logique Combinatoire à la Backus, Journées Groplan-Afcet, Cargese 1979.Google Scholar
  11. [11]
    J.H. Williams Formal representation of recursively defined functional programs, Formalization of programming concepts, LNCS 107, Penniscola 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • P. Bellot
    • 1
  • B. Robinet
    • 2
  1. 1.Faculté des SciencesUniversité de MetzMetz Cédex
  2. 2.L.I.T.P., U.A. 248Université P. et M. Curie (Paris 6)Paris Cédex 05

Personalised recommendations