论文信息 - The Specificity Rule for Lazy Pattern-Matching in Ambiguous Term Rewrite Systems

The Specificity Rule for Lazy Pattern-Matching in Ambiguous Term Rewrite Systems

Many functional languages based on term rewriting (such as Miranda and ML) allow the programmer to write ambiguous rule systems, with the understanding that rules will be matched against a term in the order in which the rules are written, and that the pattern-matching of a rule against a term proceeds from left to right.

Richard Kennaway

[1] Alain Laville. Lazy pattern matching in the ML language , 1987, FSTTCS.

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

[3] Gérard Berry,et al. Stable Models of Typed lambda-Calculi , 1978, ICALP.

[4] Simon J. Thompson,et al. Lawful Functions and Program Verification in Miranda , 1990, Sci. Comput. Program..

[5] J. R. Kennaway,et al. DACTL: A computational model and compiler target language based on graph reduction , 1987 .

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

[7] Alain Laville. Comparison of Priority Rules in Pattern Matching and Term Rewriting , 1991, J. Symb. Comput..

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

[9] Jan Willem Klop,et al. Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.

[10] Michael J. O'Donnell,et al. Equational Logic as a Programming Language , 1985, Logic of Programs.

[11] Jan A. Bergstra,et al. Conditional Rewrite Rules: Confluence and Termination , 1986, J. Comput. Syst. Sci..

[12] Marko C. J. D. van Eekelen,et al. CLEAN: A language for functional graph writing , 1987, FPCA.

[13] Jan Willem Klop,et al. Term rewriting systems: a tutorial , 1987 .

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