Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1976: Mathematical Foundations of Computer Science 1976 pp 330–336Cite as

An algebraic approach to data types, program verification, and program synthesis

  • Communications
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 45))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Birkhoff and J.D. Lipson: Heterogeneous algebras. Journ. Comb. Theory 8 (1970), 115–133.

    Google Scholar 

  2. R.S. Boyer and J.S. Moore: Proving theorems about LISP functions. Journ. of the ACM 22 (1975), 129–144.

    Article  Google Scholar 

  3. R.M. Burstall and J. Darlington: Some transformations for developing recursive programs. Proc. Int. Conf. on Reliable Software, Los Angeles, 1975, 465–472.

    Google Scholar 

  4. F.W. von Henke: On the representation of data structures in LCF. Memo AIM-267, Stanford University, 1975.

    Google Scholar 

  5. F.W. von Henke: Recursive data types and program structures. 1976 (to appear).

    Google Scholar 

  6. F.K. Mahn: Primitiv-rekursive Funktionen auf Termmengen. Arch. math. Logik 12 (1969), 54–65.

    Google Scholar 

  7. Z. Manna and R. Waldinger: Knowledge and reasoning in program synthesis. Techn. Note 98, Stanford Research Institute, 1974.

    Google Scholar 

  8. J. McCarthy: Towards a mathematical science of computation. Proc. IFIP Congr. 1962, 21–28.

    Google Scholar 

  9. R. Milner: Logic for computable functions — description of an implementation. Memo AIM-169, Stanford University, 1972.

    Google Scholar 

  10. R. Milner: Implementation and application of Scott's logic for computable functions. Proc. ACM Conf. on Proving Assertions about Programs, Las Cruces, New Mexico, 1972.

    Google Scholar 

  11. M. Newey: Formal semantics of LISP with applications to program correctness, (PhD thesis). Memo AIM-257, Stanford University, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Gesellschaft für Mathematik und Datenverarbeitung Bonn, 5205, St. Augustin 1, W-Germany

    Friedrich W. von Henke

Authors
  1. Friedrich W. von Henke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Mazurkiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

von Henke, F.W. (1976). An algebraic approach to data types, program verification, and program synthesis. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_195

Download citation

  • DOI: https://doi.org/10.1007/3-540-07854-1_195

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07854-8

  • Online ISBN: 978-3-540-38169-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation