Advertisement

Implementation of lazy pattern matching algorithms

  • Alain Laville
5. Implementation Of Programming Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 300)

Keywords

Pattern Match Minimal Element Accessible Pattern Initial Pattern Matching Tree 
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.

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]
    L. Augustsson “A Pattern Matching Compiler”, Conf. on Functional Programming Languages and Computer Architecture, Nancy, 1985 (LNCS 217)Google 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]
    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
  5. [5]
    G. Huet J.J. Lévy “Call by Need Computations in Non Ambiguous Linear Term Rewriting Systems”, Rapport IRIA Laboria 359, August 1979Google Scholar
  6. [6]
    A. Laville “Lazy Pattern Matching in the ML Language”, Proceedings of the 7th Conference on Foundations of Software Technology and Theoretical Computer Science, Pune (India), December 1987, L.N.C.S.Google Scholar
  7. [7]
    A. Laville “Filtrage et Evaluation paresseuse”, Thèse de Doctorat, Université Paris 7, to appearGoogle Scholar
  8. [8]
    M. Mauny “Compilation des Langages Fonctionnels dans les Combinateurs Catégoriques, Application au langage ML”, Thèse de 3ème cycle, Université Paris 7, 1985Google Scholar
  9. [9]
    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
  10. [10]
    R. Milner “A Proposal for Standard ML”, A.C.M. Conference on Lisp and Functional Programming, Austin 1984, pp 184–197Google Scholar
  11. [11]
    G. Plotkin “Call-by-need, Call-by-value and the Lambda Calculus”, T.C.S. Vol 1, pp 125–159, 1975Google Scholar
  12. [12]
    A. Suarez “Une Implémentation de ML en ML”, Thèse, Université Paris 7, to appearGoogle Scholar
  13. [13]
    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
  14. [14]
    P. Wadler, “Efficient Compilation of Pattern Matching”, in S. Peyton Jones The Implementation of Functional Programming Languages, Prentice-Hall Series in Computer Science, 1987Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

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

Personalised recommendations