Strategy construction in the higher-order framework of TL

Electronic Notes in Theoretical Computer Science

Volumn 124, Issue 1, 2005, Pages 149-170

  Winter, Victor L ^a  

^a UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

Author keywords

Higher order rewriting; Program transformation; Rewriting; Strategic programming; TL; Transient combinator

Indexed keywords

BINARY CODES; COMBINATORIAL MATHEMATICS; DATA REDUCTION; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; STRATEGIC PLANNING;

HIGHER-ORDER REWRITING; PROGRAM TRANSFORMATION; REWRITING; STRATEGIC PROGRAMMING; TRANSIENT COMBINATOR;

LOGIC PROGRAMMING;

EID: 13944281059     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.07.020     Document Type: Conference Paper

References (16)

1. J.A. Bergstra J. Heering P. Klint Algebraic Specification 1989 ACM Press/Addison-Wesley
2. P. Borovansky, C. Kirchner, H. Kirchner, P.-E. Moreau, and C. Ringeissen An Overview of ELAN C. Kirchner H. Kirchner International Workshop on Rewriting Logic and its Applications Electronic Notes in Theoretical Computer Science 15 1998 France, Elsevier Science http://www.elsevier.com/locate/entcs/volume15.html
3. J.M. Boyle, T.J. Harmer, and V.L. Winter The TAMPR program transformation system: Simplifying the development of numerical software E. Arge A.M. Pettersen H.P. Langtangen Modern Software Tools for Scientific Computing 1997 Birkhauser 353 372
4. M.G.J. van den Brand, P. Klint, and J.J. Vinju Term Rewriting with Traversal Functions ACM Transactions on Software Engineering and Methodology (TOSEM) 12 2 2003 152 190
5. Cirstea, H., and Kirchner, C., Intoduction to the rewriting calculus. INRIA Research Report RR-3818, December 1999
6. HATS. http://faculty.ist.unomaha.edu/winter/hats-uno/HATSWEB/index.html
7. Lämmel, R., Visser, J., and Kort, J., Dealing with Large Bananas. In Johan Jeuring, editor, Workshop on Generic Programming, Ponte de Lima, July 2000. Technical Report, Universiteit Utrecht
8. E. Meijer, M.M. Fokkinga, and R. Paterson Functional Programming with Bananas, Lenses, Envelopes, and Barbed Wire J. Hughes FPCA'91: Functional Programming Languages and Computer Architecture LNCS Vol. 523 1991 Springer-Verlag 124 144
9. E. Meijer, and J. Jeuring Merging Monads and Folds for Functional Programming J. Jeuring E. Meijer 1st International Spring School on Advanced Functional Programming Techniques, B astad, Sweden LNCS Vol. 925 1995 Springer-Verlag 228 266
10. E. Visser Scoped dynamic rewrite rules M. van den Brand R. Verma Rule Based Programming (RULE'01) Electronic Notes in Theoretical Computer Science 59 4 2001 Elsevier Science Publishers http://www.elsevier.com/locate/entcs/ volume15.html
11. Visser, E., Benaissa, Z., and Tolmach, A., Building Program Optimizers with Rewriting Strategies. Proceedings of the third ACM SIGPLAN International Conference on Functional Programming (ICFP'98)
12. E. Visser, and Z. Benaissa A Core Language for Rewriting C. Kirchner H. Kirchner Electronic Notes in Theoretical Computer Science 15 1998 Elsevier Science Publishers http://www.elsevier.com/locate/entcs/volume15.html
13. Visser, E., Personal communication, Feb. 18, 2004
14. Winter, V. L., and Subramaniam, M., The Transient Combinator, Higher-Order Strategies, and the Distributed Data Problem. Science of Computer Programming (accepted)
15. Winter, V. L., Roach, S., and Fraij, F., Higher-Order Strategic Programming: A Road to Dependable Software. Submitted to IEEE Transactions on Dependable and Secure Computing
16. V. Winter, S. Roach, and G. Wickstrom Transformation-Oriented Programming: A Development Methodology for High Assurance Software Advances in Computers Vol. 58 2003