A Local Termination Property for Term Rewriting Systems

We describe a desirable property, local termination, of rewrite systems which provide an operational semantics for formal functional programming (FFP) languages, and we give a multiset ordering which can be used to show that the property holds.

[1]  Richard S. Bird,et al.  Introduction to functional programming , 1988, Prentice Hall International series in computer science.

[2]  John H. Williams,et al.  Formal Representations for Recursively Defined Functional Programs , 1981, International Colloquium on Formalization of Programming Concepts.

[3]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[4]  Joseph Y. Halpern,et al.  Denotational semantics and rewrite rules for FP , 1985, POPL.

[5]  I. Ramos,et al.  Formalization of Programming Concepts , 1981, Lecture Notes in Computer Science.

[6]  Allan Borodin,et al.  Subrecursive Programming Languages, Part I: efficiency and program structure , 1972, JACM.

[7]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[8]  J. Darlington,et al.  Functional programming and its applications , 1982 .

[9]  Geoffrey Alson Frank.  Virtual memory systems for closed applicative language interpreters , 1979 .

[10]  Donald E. Knuth,et al.  Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .

[11]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[12]  Susan Eisenbach.  Functional programming: languages, tools, and architectures , 1987 .

[13]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[14]  Zohar Manna,et al.  Proving termination with multiset orderings , 1979, CACM.

[15]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[16]  Nachum Dershowitz,et al.  Orderings for term-rewriting systems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).