论文信息 - Efficient Automata-Driven Pattern-Matching for Equational Programs - 字舞流文

Efficient Automata-Driven Pattern-Matching for Equational Programs

Nadia Nedjah | C. D. Walter | Colin D. Walter | Stephen Eldridge | S. Eldridge | N. Nedjah

[1] Rod M. Burstall,et al. HOPE: An experimental applicative language , 1980, LISP Conference.

[2] Robin Milner,et al. Definition of standard ML , 1990 .

[3] Christoph M. Hoffmann,et al. Programming with Equations , 1982, TOPL.

[4] Luc Maranget,et al. Two Techniques for Compiling Lazy Pattern Matching , 1994 .

[5] Satish R. Thatte. On the Correspondence Metween Two Classes of Reduction Systems , 1985, Inf. Process. Lett..

[6] D. A. Turner,et al. Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.

[7] Richard Kennaway. The Specificity Rule for Lazy Pattern-Matching in Ambiguous Term Rewrite Systems , 1990, ESOP.

[8] Philippe Schnoebelen. Refined Compilation of Pattern-Matching for Functional Languages , 1988, ALP.

[9] Lennart Augustsson,et al. A compiler for lazy ML , 1984, LFP '84.

[10] Robert Strandh,et al. Implementation of an interpreter for abstract equations , 1984, Softw. Pract. Exp..

[11] David J. Sherman,et al. Squeezing Intermediate Construction in Equational Programs , 1996, Dagstuhl Seminar on Partial Evaluation.

[12] Lennart Augustsson,et al. Compiling Pattern Matching , 1985, FPCA.

[13] Albert Gräf,et al. Left-to-Right Tree Pattern Matching , 1991, RTA.

[14] Christoph M. Hoffmann,et al. Pattern Matching in Trees , 1982, JACM.

[15] Murray Hill,et al. Yacc: Yet Another Compiler-Compiler , 1978 .