Order-sorted termination: The unsorted way

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1139, Issue , 1996, Pages 92-106

  Ölveczky, Peter Csaba ^a   Lysne, Olav ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITY OF OSLO   (Norway)

Author keywords

Order sortedness; Termination

Indexed keywords

ALGEBRA; LOGIC PROGRAMMING; MAPPING; RECONFIGURABLE HARDWARE;

ORDER-SORTEDNESS; REWRITE SYSTEMS; TERMINATION;

COMPUTER CIRCUITS;

EID: 57549109080     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61735-3_6     Document Type: Conference Paper

References (14)

1. O.-J. Dahl and O. Owe. Formal development with ABEL. In Proceedings 4th International Symposium of VDM Europe, LNCS 552, 1991.
2. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3:69-116, 1987.
3. N. Dershowitz and C. Hoot. Natural termination. Theoretical Computer Science, 142:179-207, 1995.
4. H. Ganzinger. Order-sorted completion: the many-sorted way. Theoretical Computer Science, 89:3-32, 1991.
5. I. Gnaedig. ELIOS-OBJ: theorem proving in a specification language. In Proceedings of the 4th European Symposion on Programming, LNCS 582, pages 182-199, 1992.
6. I. Gnaedig. Termination of order-sorted rewriting. In Proceedings 3rd International Conference on Algebraic and Logic Programming, Pisa (Italy), LNCS 632, pages 37-52, 1992.
7. I. Gnaedig, C. Kirchner, and H. Kirchner. Equational completion in order-sorted algebras. Theoretical Computer Science, 72:169-202, 1990.
8. J. A. Goguen and J. Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operators. Technical report, Programming Research Group, Oxford University Computing Laboratory, 1989.
9. J. A. Goguen and T. Winkler. Introducing OBJ3. Technical report, SRI International, Computer Science Lab, 1988.
10. S. Kamin and J.-J. Lévy. Two generalizations of the recursNe path ordering. Unpublished Note, Department of Computer Science, University of Illinois, Urbana, IL, 1980.
11. D. E. Knuth and P. B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263-297. Pergamon Press, Oxford, 1970.
12. P. Lescanne. Termination of rewrite systems by elementary interpretations. In Proceedings 3rd International Conference on Algebraic and Logic Programming, Pisa (Italy), LNCS 632, pages 21-36, 1992.
13. U. Waldman. Semantics of order-sorted specifications. Theoretical Computer Science, 94:1-35, 1992.
14. H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24:89-105, 1995.