Operational termination of membership equational programs: The order-sorted way

Electronic Notes in Theoretical Computer Science

Volumn , Issue , 2008, Pages 189-205

  Lucas, Salvador ^a   Meseguer, José ^b  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Membership equational logic; Operational termination; Order sorted equational logic; Program analysis; Rewriting logic; Term rewriting

Indexed keywords

EQUATIONAL LOGIC; MEMBERSHIP EQUATIONAL LOGIC; OPERATIONAL TERMINATION; PROGRAM ANALYSIS; REWRITING LOGIC; TERM REWRITING;

COMPUTER SCIENCE;

APPLICATION PROGRAMS;

EID: 57549113716     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (24)

1. T. Aoto. Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems. Journal of Functional and Logic Programming, 2001(11):1-20, 2001.
2. A. Bouhoula, J.-P. Jouannaud, and J. Meseguer. Specification and proof in membership equational logic. Theoretical Computer Science, 236:35-132, 2000.
3. R. Bruni and J. Meseguer. Semantic foundations for generalized rewrite theories. Theoretical Computer Science 351(1):386-414, 2006.
4. M. Bidoit and P.D. Mosses. Casl User Manual - Introduction to Using the Common Algebraic Specification Language. Lecture Notes in Computer Science 2900, 2004.
5. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and C. Talcott. All About Maude - A High-Performance Logical Framework. Lecture Notes in Computer Science 4350, 2007.
6. F. Durán, S. Lucas, C. Marché, J. Meseguer, and X. Urbain. Proving Termination of Membership Equational Programs. In Proc. of PEPM'04, pages 147-158. ACM Press, 2004.
7. F. Durán, S. Lucas, J. Meseguer, C. Marché, and X. Urbain. Proving Operational Termination of Membership Equational Programs. Higher-Order and Symbolic Computation, 2008. To appear.
8. S. Eker. Term Rewriting with Operator Evaluation Strategies. In Proc. of WRLA'98, Electronic Notes in Computer Science, 15(1998):1-20, 1998.
9. K. Futatsugi and R. Diaconescu. CafeOBJ Report. World Scientific, AMAST Series, 1998.
10. J. Giesl, P. Schneider-Kamp, and R. Thiemann. AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework. In Proc. of IJCAR'06, LNAI 4130:281-286, Springer-Verlag, Berlin, 2006.
11. I. Gnaedig. Termination of Order-sorted Rewriting. In H. Kirchner and G. Levi, editors, Proc. of ALP'92, LNCS 632:37-52, Springer-Verlag, Berlin, 1992.
12. J. Goguen and J. Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science, 105:217-273, 1992.
13. J. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.-P. Jouannaud. Introducing OBJ. In Software Engineering with OBJ: Algebraic Specification in Action. Kluwer, 2000.
14. B. Gramlich and S. Lucas. Modular termination of context-sensitive rewriting. In Proc. of PPDP'02, pages 50-61, ACM Press, New York, 2002.
15. C. Kirchner, H. Kirchner, and J. Meseguer. Operational Semantics of OBJ3 In Proc. of ICALP'88, LNCS 317:287-301, Springer-Verlag, Berlin, 1988.
16. S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1998(1), 1998.
17. S. Lucas. Context-sensitive rewriting strategies. Information and Computation, 178(1):294-343, 2002.
18. S. Lucas. MU-TERM: A Tool for Proving Termination of Context-Sensitive Rewriting In Proc. of RTA'04, LNCS 3091:200-209, Springer-Verlag, Berlin, 2004.
19. S. Lucas, C. Marché, and J. Meseguer. Operational termination of conditional term rewriting systems. Information Processing Letters, 95:446-453, 2005.
20. J. Meseguer. Membership algebra as a logical framework for equational specification. In F. Parisi- Presicce, editor, Proceedings WADT'97, volume 1376 of Lecture Notes in Computer Science, pages 18-61. Springer-Verlag, 1998.
21. J. Meseguer and J. Goguen. Initiality, induction and computability. In M. Nivat and J. Reynolds, editors, Algebraic Methods in Semantics, 459-541. Cambridge University Press, 1985.
22. E. Ohlebusch. Advanced Topics in Term Rewriting. Springer-Verlag, 2002.
23. P.C. Ölveczky and O. Lysne. Order-Sorted Termination: The Unsorted Way. In Proc. of ALP'96, LNCS 1139:92-106, Springer-Verlag, Berlin, 1996.
24. H. Zantema. Termination of term rewriting: interpretation and type elimination. Journal of Symbolic Computation, v17:23-50, 1994