From conditional to unconditional rewriting

Lecture Notes in Computer Science

Volumn 3423, Issue , 2005, Pages 218-233

  Roşu, Grigore ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; OPTIMIZATION; PERFORMANCE;

FRONT-END TRANSFORMATIONS; REWRITE SYSTEMS; UNCONDITIONAL REWRITING;

ALGEBRA;

EID: 24344432100     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31959-7_13     Document Type: Conference Paper

References (18)

1. S. Antoy, B. Brassel, and M. Hanus. Conditional narrowing without conditions. In 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming (PPDP'03), pages 20-31. ACM Press, 2003.
2. J. Bergstra and J. Klop. Conditional rewrite rules: Confluence and termination. Journal of Computer and System Sciences, 32(3):323-362, 1986.
3. P. Borovansky, H. Cirstea, H. Dubois, C. Kirchner, H. Kirchner, P. Moreau, C. Ringeissen, and M. Vittek. ELAN: User Manual, 2000. Loria, Nancy, France.
4. M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, and C. Talcott. Maude 2.0 Manual, 2003. http://maude.cs.uiuc.edu/manual.
5. N. Dershowitz and M. Okada. A rationale for conditional equational programming. Theoretical Computer Science, 75:111-138, 1990.
6. R. Diaconescu and K. Futatsugi. CafeOBJ Report: The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification. World Scientific, 1998. AMAST Series in Computing, volume 6.
7. D. P. Friedman, C. T. Haynes, and M. Wand. Essentials of programming languages. MIT Press, 1992.
8. E. Giovannetti and C. Moiso. Notes on the elimination of conditions. In 1st International Workshop on Conditional Term Rewriting Systems (CTRS'87), volume 308 of LNCS, pages 91-97. Springer, 1987.
9. J. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.-P. Jouannaud. Introducing OBJ. In Software Engineering with OBJ: algebraic specification in action, pages 3-167. Kluwer, 2000.
10. M. Hanus. The integration of functions into logic programming: From theory to practice. The Journal of Logic Programming, 19 & 20:583-628, 1994.
11. C. Hintermeier. How to transform canonical decreasing ctrss into equivalent canonical trss. In 4th International Workshop on Conditional and Typed Rewriting Systems (CTRS'94), volume 968 of LNCS, pages 186-205, 1994.
12. J. Meseguer and G. Roşu. Rewriting logic semantics: From language specifications to formal analysis tools. In 2nd International Joint Conference on Automated Reasoning (IJCAR'04), LNCS, to appear, 2004.
13. A. Middeldorp and E. Hamoen. Completeness results for basic narrowing. Journal of Applicable Algebra in Eng., Communication and Computing, 5:313-353, 1994.
14. E. Ohlebusch. Advanced Topics in Term Rewriting. Springer, 2002.
15. J. C. Reynolds. The discoveries of continuations. LISP and Symbolic Computation, 6(3-4)-.233-247, 1993.
16. G. Roşu. From conditional to unconditional rewriting. Technical Report UIUCDCS-R-2004-2471, University of Illinois at Urbana-Champaign, Aug. 2004.
17. P. Viry. Elimination of conditions. Journal of Symbolic Computation, 28:381-401, Sept. 1999.
18. E. Visser. Stratege: A language for program transformation based on rewriting strategies. System description of Stratego 0.5. In Rewriting Techniques and Applications (RTA'01), volume 2051 of LNCS, pages 357-361. Springer, May 2001.