Abstract
Reusability is claimed to be one of the practically most promising aspects of transformational programming. Whereas algebraic types as “reusable software components” and transformation rules as “reusable programming knowledge” have been discussed and exemplified in numerous case studies, substantial experience on reusing transformational developments is still lacking. In this paper, we suggest a simple strategy for reuse (of developments) based on generalization, and illustrate it by means of a particular example.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Backhouse, R., Chisholm, P., Malcolm, G., Saaman, E.: Do-it-yourself type theory. Department of Mathematics and Computer Science, University of Groningen, Technical Report 1988
Bauer, F.L., Berghammer, R., Broy, M., Dosch, W., Geiselbrechtinger, F., Gnatz, R., Hangel, E., Hesse, W., Krieg-Bruckner, B., Laut, A., Matzner, T., Moller, B., Nickl, F., Partsch, H., Pepper, P., Samelson, K., Wirsing, M., Wössner, H.: The Munich project CIE Volume I: The wide spectrum language CIP-L. Lecture Notes in Computer Science 183, Berlin: Springer 1985
Bauer, F.L., Ehler, H., Horsch, A., Möller, B., Partsch, H., Paukner, O., Pepper, P.: The Munich project CIR Volume II: The transformation system CIP-S. Lecture Notes in Computer Science 292, Berlin: Springer 1987
Burstall, R.M., Darlington, J.: A transformation system for developing recursive programs. Journal ACM 24:1, 41–67 (1977)
Ehrig, H., Kreowski, H.-J., Padawitz, P.: Algebraic implementation of abstract data types: concept, syntax, semantics and correctness. Proc. 7th Int. Coll, on Automata, Languages and Programming, Noordwijkerhout, Netherlands, 1980. Lecture Notes in Computer Science 85, Berlin: Springer 1980, pp. 142–156
Fischer, MJ., Salzberg, S.L.: Problem 81–5 by J. Moore. Journal of Algorithms 3, 375–379 (1982)
van Gasteren, AJ.M.: On the majority of a bag. Rijksuniversiteit Utrecht, Technical Notes AvG79 and AvG79a, 1988
Gaudel, Moineau 88] Gaudel, M.C., Moineau, T.: A theory of software reusability. In: Ganzinger, H. (ed.): ESOP ’88. Lecture Notes in Computer Science 300 Berlin: Springer 1988, pp. 115150
Meertens, L.G.L.T.: Majority divided and ruled. Rijksuniversiteit Utrecht, Technical Note 1989
Misra, J., Gries, D.: Finding repeated elements. Science of Computer Programming 2, 143–152 (1982)
Moller, B.: Applicative assertions In• van de Snepsheut, J.L.A. (ed.): Mathematics of program construction. Lecture Notes in Computer Science 375, Berlin: Springer 1989, pp. 348–362
Partsch, H.: The majority problem. Computer Science Department, KU Nijmegen, Technical Report 88–11, 1988
Partsch, H.: Specification and transformation of programs — a formal approach to software development. Berlin: Springer 1990
Wirsing, M.: Algebraic description of reusable software components. Fakultät für Mathematik und Informatik, Universität Passau, Report MIP-8816, 1988.
Zantema, H.: Majority voting: characterization and algorithms. Vakgroep Informatica, Rijksuniversiteit Utrecht, Technical Report RUU-CS-88–32, 1988
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Partsch, H. (1991). Reusability of Transformational Developments. In: Broy, M. (eds) Informatik und Mathematik. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76677-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-76677-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-76678-7
Online ISBN: 978-3-642-76677-0
eBook Packages: Springer Book Archive