Abstract
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.
On leave 1985–1988 at CUNY; Work partially supported by NSF Grants #MCS81-04217; #DCR83-02879 and by CUNY Grants #PSC-CUNY-667920; #PSC-CUNY-668293.
Work supported by the AXL project of Enidata.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6 References
BACKUS, J., ‘Can programming be liberated from the von Neumann style? A functional style and its algebra of programs,’ Communications of the ACM, 21(1978), 613–641.
BACKUS, J., WILLIAMS, J. H., and WIMMERS, E. L. ‘FL Language Manual,’ Research Report RJ 5339, IBM Research Laboratory, San Jose, CA, November, 1986.
BIRD, R. and WALDER, P., Introduction to Functional Programming, Prentice Hall, New York, 1988.
BOYER, R. S., and MOORE, J. S., A Computational Logic; Academic Press, New York, 1979.
CONSTABLE, R. E., and BORODIN, A., ‘Subrecursive programming languages. Part 1,’ J. Assoc. Comp. Mach., 19(1972), 526–568.
DERSHOWITZ, N., ‘Orderings for term rewriting systems,” J. of Theoretical Comp. Sci., 17(1982), 279–310.
DERSHOWITZ, N., ‘Termination,’ Proceedings of Rewriting Techniques and Applications, Dijon, France, May 1985, LNCS 202, Springer-Verlag, New York, 1985, 180–224.
DERSHOWITZ, N., and MANNA, Z., ‘Proving termination with multiset orderings,’ Communications of the ACM, 22(1979), 465–467.
EISENBACH, S., Functional Programming: Languages, Tools and Architectures, John Wiley & Sons, New York, 1987.
FRANK, G., Virtual Memory Systems for Closed Applicative Language Interpreters, Ph.D. Dissertation, University of North Carolina at Chapel Hill, 1979.
HALPERN, J. Y., WILLIAMS, J. H., WIMMERS, E.L. and WINKLER, T. C., ‘Denotational semantics and rewrite rules for FP,’ Proceedings of the Twelfth ACM Symposium of Principles of Programming Languages, January 1985, 108–120.
HOPCROFT, J. E., and ULLMAN, J. D., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
HUET, G., ‘Confluent reductions: abstract properties and applications to term rewriting systems,’ J. of Assoc. Comp. Mach., 27(1980), 797–821.
KNUTH, D. and BENDIX, P., 'simple word problems in universal algebras,’ Computational Problems in Abstract Algebra, Leech, J., ed., Pergamon Press, 1970, 263–297.
LANKFORD, D. S., ‘Canonical algebraic simplification in computational logic,’ MEM ATP-25, Automated Theorem Proving Project, University of Texas, Austin, TX, May 1985.
LATCH, D. M. and SIGAL, R., ‘Generating evaluation theorems for functional programming languages,’ Proceedings of the Third International Symposium on Methodologies for Intelligent Systems, Torino, Italy, October, 1988, 47–58.
TURNER, D., ‘On the Kent recursive calculator,’ Functional Programming and Its Applications, Darlington, J., ed., Cambridge University Press, New York, 1982.
WILLIAMS, J. H., ‘Formal representations for recursively defined functional programs,’ Formalization of Programming Concepts, LNCS 107, Springer-Verlag, New York, 1981, 460–470.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Latch, D.M., Sigal, R. (1989). A local termination property for term rewriting systems. In: Dershowitz, N. (eds) Rewriting Techniques and Applications. RTA 1989. Lecture Notes in Computer Science, vol 355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51081-8_111
Download citation
DOI: https://doi.org/10.1007/3-540-51081-8_111
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51081-9
Online ISBN: 978-3-540-46149-4
eBook Packages: Springer Book Archive