Towards automation of proofs by induction

  • F. W. von Henke
Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 48)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /1/.
    R.B. Boyer and J S. Moore: Proving theorems about LISP functions. Journal of the ACM 22 (1975), 129–144.CrossRefGoogle Scholar
  2. /2/.
    F. W. von Henke: On the representation of data structures in LCF. Memo AIM-267, Stanford University, 1975.Google Scholar
  3. /3/.
    F. W. von Henke: Notes on automating theorem proving in LCF. Technical report, GMD Bonn, 1976.Google Scholar
  4. /4/.
    Z. Manna: Mathematical Theory of Computation. McGraw-Hill, 1974.Google Scholar
  5. /5/.
    R. Milner: Logic for computable functions — description of an implementation. Memo AIM-169, Stanford University, 1972.Google Scholar
  6. /6/.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • F. W. von Henke

There are no affiliations available

Personalised recommendations