This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Bijlsma, A unified approach to sequences, bags, and trees. Computing Science Notes 88/13. Eindhoven University of Technology, 1988.
R.S. Bird, An introduction to the theory of lists; in: M. Broy (ed.), Logic of programming and calculi of discrete design (lecture notes international summer school, Marktoberdorf, 1986). NATO Adv. Sci. Inst. Ser. F, 36. Springer-Verlag, Berlin, 1987.
L. Meertens, Algorithmics: towards programming as a mathematical activity; in: J.W. de Bakker, M. Hazewinkel, J.K. Lenstra (eds.), Mathematics and computer science. North Holland, Amsterdam, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bijlsma, A. (1989). Transformational programming and forests. In: van de Snepscheut, J.L.A. (eds) Mathematics of Program Construction. MPC 1989. Lecture Notes in Computer Science, vol 375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51305-1_9
Download citation
DOI: https://doi.org/10.1007/3-540-51305-1_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51305-6
Online ISBN: 978-3-540-46191-3
eBook Packages: Springer Book Archive