Preview
Unable to display preview. Download preview PDF.
References
R.M. Burstall and J. Darlington: A transformation system for developing recursive programs. Journal of the ACM 24 (1977), 44–67.
D.P. Friedman and D.S. Wise: Output driven interpretation of recursive programs, or writing creates and destroys data structures. Information Processing Letters 5 (1976), 155–160.
F.W. v. Henke: On the representation of data structures in LCF. Memo AIM-267, Stanford University, 1975.
F.W. v. Henke: Recursive data types and program structures. Internal report, GMD Bonn, 1976.
F.W. v. Henke: An algebraic approach to data types, program verification, and program synthesis. Proc. MFCS'76, Springer Lecture Notes in Computer Science No. 45, 1976.
D.E. Knuth: Structured programming with go to statements. Computing Surveys 6 (1974), 261–301.
D.B. Loveman: Program improvement by source-to-source transformation. Journal of the ACM 24 (1977), 121–145.
R. Milner: Implementation and applications of Scott's logic for computable functions. Proc. ACM Conf. on Proving Assertions about Programs, Las Cruces, 1972.
R. Milner: Logic for Computable Functions — description of an implementation. Memo AIM-169, Stanford University, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
von Henke, F.W. (1977). Formal transformations and the development of programs. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_147
Download citation
DOI: https://doi.org/10.1007/3-540-08353-7_147
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08353-5
Online ISBN: 978-3-540-37285-1
eBook Packages: Springer Book Archive