This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R.B. Boyer and J S. Moore: Proving theorems about LISP functions. Journal of the ACM 22 (1975), 129–144.
F. W. von Henke: On the representation of data structures in LCF. Memo AIM-267, Stanford University, 1975.
F. W. von Henke: Notes on automating theorem proving in LCF. Technical report, GMD Bonn, 1976.
Z. Manna: Mathematical Theory of Computation. McGraw-Hill, 1974.
R. Milner: Logic for computable functions — description of an implementation. Memo AIM-169, Stanford University, 1972.
R. Milner: Implementation and applications of Scott's logic for computable functions. Proc. ACM Conference on Proving Assertions about Programs, Las Cruces, N.M., 1972, 1–6.
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
von Henke, F.W. (1977). Towards automation of proofs by induction. In: Theoretical Computer Science. Lecture Notes in Computer Science, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08138-0_18
Download citation
DOI: https://doi.org/10.1007/3-540-08138-0_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08138-8
Online ISBN: 978-3-540-37389-6
eBook Packages: Springer Book Archive