Advertisement

Lazy pattern matching in the ML language

  • Alain Laville
Session 7 Programming Methodology
Part of the Lecture Notes in Computer Science book series (LNCS, volume 287)

Keywords

Pattern Match Priority Rule Initial Pattern Matching Tree Pattern Match Algorithm 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    L. Augustsson “A Compiler for Lazy ML”, A.C.M. Conference on Lisp and Functional Programming, Austin 1984, pp 218–225Google Scholar
  2. [2]
    J. Baeten J. Bergstra J. Klop “Priority Rewrite Systems', Report CS-R8407, Center for Mathematics and Computer Science, AmsterdamGoogle Scholar
  3. [3]
    R. Burstall D. MacQueen D. Sannella “HOPE: An Experimental Applicative Language”, A.C.M. Conference on Lisp and Functional Programming, Stanford 1980, pp 136–143Google Scholar
  4. [4]
    L. Cardelli “Compiling a Functional Language”, A.C.M. Conference on Lisp and Functional Programming, Austin 1984, pp 208–217Google Scholar
  5. [5]
    G. Cousineau P.L. Curien M. Mauny “The Categorical Abstract Machine”, in J.P. Jouannaud ed. Functional Programming Languages and Computer Architecture, L.N.C.S. 201, Springer-Verlag 1985Google Scholar
  6. [6]
    P.L. Curien “Categorical Combinators, Sequential Algorithms and Functional Programming”, Research Notes in Theoretical Computer Science, Pitman Publishing Ltd 1986Google Scholar
  7. [7]
    G. Huet J.J. Lévy “Call by Need Computations in Non Ambiguous Linear Term Rewriting Systems”, Rapport IRIA Laboria 359, August 1979Google Scholar
  8. [8]
    G. Kahn G. Plotkin “Domaines concrets”, Rapport IRIA Laboria 336, December 1978Google Scholar
  9. [9]
    A. Laville “Filtrage et Evaluation paresseuse”, Thèse de Doctorat, Université Paris 7, to appearGoogle Scholar
  10. [10]
    M. Mauny “Compilation des Languages Fonctionnels dans les Combinateurs Catégoriques, Application au langage ML”, Thèse de 3ème cycle, Université Paris 7, 1985Google Scholar
  11. [11]
    M. Mauny A. Suarez “Implementing Functional Languages in the Categorical Abstract Machine”, A.C.M. Conference on Lisp and Functional Programming, Cambridge 1986, pp 266–278Google Scholar
  12. [12]
    R. Milner “A Proposal for Standard ML”, A.C.M. Conference on Lisp and Functional Programming, Austin 1984, pp 184–197Google Scholar
  13. [13]
    G. Plotkin “Call-by-need, Call-by-value and the Lambda Calculus”, T.C.S. Vol 1, pp 125–159, 1975CrossRefGoogle Scholar
  14. [14]
    A. Suarez “Une Implémentation de ML en ML”, Thèse, Université Paris 7, to appearGoogle Scholar
  15. [15]
    D. Turner “Miranda a Non Strict Functional Language with Polymorphic Types”, in J.P. Jouannaud ed. Functional Programming Languages and Computer Architecture, L.N.C.S. 201, Springer-Verlag 1985Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Alain Laville
    • 1
    • 2
  1. 1.I.N.R.I.A. (Projet FORMEL)Le Chesnay CedexFrance
  2. 2.Université de ReimsReims CedexFrance

Personalised recommendations