Strongly Typed Rewriting For Coupled Software Transformation

Electronic Notes in Theoretical Computer Science

Volumn 174, Issue 1, 2007, Pages 17-34

  Cunha, Alcino ^a   Visser, Joost ^a  

^a UNIVERSITY OF MINHO   (Portugal)

Author keywords

data refinement; generalized abstract datatypes; Program transformation; strategic programming; term rewriting

Indexed keywords

COMPUTATIONAL METHODS; DATA PRIVACY; DATA PROCESSING; MATHEMATICAL TRANSFORMATIONS;

DATA REFINEMENT; GENERALIZED ABSTRACT DATATYPES; PROGRAM TRANSFORMATIONS; STRATEGIC PROGRAMMING; TERM REWRITING;

COMPUTER SOFTWARE;

EID: 34247365585     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.10.019     Document Type: Article

References (24)

1. Baars A.I., and Swierstra S.D. Typing dynamic typing. ICFP '02: Proc. 7th ACM SIGPLAN Int. Conf. Functional programming (2002), ACM Press 157-166
2. Bird R. Introduction to Functional Programming using Haskell. International Series in Computer Science (1998), Prentice Hall
3. Cheney J., and Hinze R. A lightweight implementation of generics and dynamics. Proc. ACM SIGPLAN 2002 Haskell Workshop (2002), ACM Press 90-104
4. Cleve A., and Hainaut J.-L. Co-transformations in database applications evolution. In: Lämmel R., Saraiva J., and Visser J. (Eds). Generative and Transformational Techniques in Software Engineering. LNCS volume 4143 (2006), Springer 399-411
5. Cleve A., Henrard J., and Hainaut J.-L. Co-transformations in information system reengineering. Electr. Notes Theor. Comput. Sci. 137 3 (2005) 5-15
6. Cunha A., Oliveira J.N., and Visser J. Type-safe two-level data transformation. Formal Methods, International Symposium of Formal Methods Europe, 2006, Proceedings. LNCS volume 4085 (2006), Springer 284-299
7. A. Cunha, J. Sousa Pinto, and J. Proença. A framework for point-free program transformation. In Selected papers 17th Int. Workshop on Implementation and Application of Functional Languages, LNCS. Springer, 2006. To appear
8. di Cosmo R., and Kesner D. A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object. In: Lingas A. (Ed). Proc. of the 20th Int. Conf. on Automata, Languages and Programming. (ICALP'93). LNCS volume 700 (1993), Springer 645-656
9. Dougherty D. Some lambda calculi with categorical sums and products. In: Kirchner C. (Ed). Proc. 5th Int. Conf. on Rewriting Techniques and Applications. LNCS volume 690 (1993), Springer 137-151
10. Foster J.N., et al. Combinators for bi-directional tree transformations: a linguistic approach to the view update problem. POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages. New York, NY, USA (2005), ACM Press 233-246
11. Gibbons J. Calculating functional programs. In: Backhouse R., et al. (Ed). Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. LNCS volume 2297 (2002), Springer 148-203 chapter 5
12. Hinze R., and Löh A. In: Hagiya M., and Wadler P. (Eds). Proc. 8th Int. Symp. on Functional and Logic Programming. LNCS volume 3945 (2006), Springer 13-29
13. Hu Z., Yokoyama T., and Takeichi M. Program optimizations and transformations in calculational form. In: Lämmel R., Saraiva J., and Visser J. (Eds). Generative and Transformational Techniques in Software Engineering. LNCS volume 4143 (2006), Springer 136-164
14. R. Lämmel. Coupled Software Transformations (Extended Abstract). In First International Workshop on Software Evolution Transformations, November 2004
15. Lämmel R. Transformations everywhere. Sci. Comput. Program. 52 (2004) 1-8 Guest editor's introduction to special issue on program transformation
16. Lämmel R., and Lohmann W. Format Evolution. Proc. 7th Int. Conf. on Reverse Engineering for Information Systems. books@ocg.at volume 155 (2001), OCG 113-134
17. Lämmel R., and Meijer E. Mappings make data processing go 'round. In: Lämmel R., Saraiva J., and Visser J. (Eds). Generative and Transformational Techniques in Software Engineering. LNCS volume 4143 (2006), Springer 165-214
18. Lämmel R., and Peyton Jones S. Scrap your boilerplate with class: extensible generic functions. Proc. ACM SIGPLAN International Conference on Functional Programming. (ICFP 2005) (September 2005), ACM Press 204-215
19. de Moor O., and Sittampalam G. Generic program transformation. In: Swierstra D., Henriques P., and Oliveira J. (Eds). Proc. 3rd Int. Summer School on Advanced Functional Programming. LNCS volume 1608 (1999), Springer 116-149
20. Morgan C., and Gardiner P.H.B. Data refinement by calculation. Acta Informatica 27 (1990) 481-503
21. Oliveira J.N. A reification calculus for model-oriented software specification. Formal Asp. Comput. 2 1 (1990) 1-23
22. S. Peyton Jones, G. Washburn, and S. Weirich. Wobbly types: type inference for generalised algebraic data types. Technical Report MS-CIS-05-26, Univ. of Pennsylvania, July 2004
23. Reig F. Generic proofs for combinator-based generic programs. In: Loidl H.-W. (Ed). Trends in Functional Programming volume 5 (2006), Intellect 17-32
24. Wadler P. Deforestation: Transforming programs to eliminate trees. Proc. European Symposium on Programming. LNCS volume 300 (1988), Springer 344-358