Compiling Pattern Matching by Term Decomposition (1989)

Cached

Download Links

by Laurence Puel , Ascander Suarez
Citations:23 - 0 self

Documents Related by Co-Citation

81 Compiling pattern matching – L Augustsson - 1985
11 Implementation of lazy pattern matching algorithms – Alain Laville - 1988
36 Call by need computations in non-ambiguous linear term rewriting systems, Rapport laboria 359, INRIA, Le ChesnaY:-France – G Huet, J-J Levy - 1979
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
38 Efficient compilation of pattern matching – P Wadler
20 Call-by-need computations in nonambiguous linear term rewriting systems – G Huet, J J Levy - 1979
12 Comparison of priority rules in pattern matching and term rewriting – A Laville - 1991
93 The ZINC experiment, an economical implementation of the ML language – Xavier Leroy - 1990
80 Equational Logic as a Programming Language – M J O’Donnell - 1985
11 Compiling Lazy Pattern Matching – Luc Maranget - 1992
755 Inductive-Data-Type Systems – Frederic Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada - 2002
40 An experimental applicative language – R BURSTALL, D MACQUEEN, D Hope SANNELLA - 1980
22 Adaptive Pattern Matching – R. C. Sekar, Bellcore Rm A, R. Ramesh, I. V. Ramakrishnan - 1992
86 A compiler for lazy ML – L AUGUSTSSON - 1984
226 Functional Data Structures – Chris Okasaki - 1996
16 The specificity rule for lazy pattern-matching in ambiguous term rewrite systems – J R Kennaway - 1990
12 GAML: a Parallel Implementation of Lazy ML – Luc Maranget - 1991
45 The definition of Standard ML – R Harper, R Milner, M Tofte - 1990
102 98: A non-strict, purely functional language. http://www.haskell.org – Simon L Peyton Jones, John Hughes - 1999