Skip to main content
SpringerLink
Log in

A simple programming language with data types: semantics and verification

Extended abstract

  • Conference paper
  • First Online:
Logics of Programs (Logic of Programs 1985)

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

Included in the following conference series:

  • 165 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barwise, J. Admissible sets of Structures, Springer-Verlag, Berlin (1975).

    Google Scholar 

  2. R.M. Burstall and B. Lampson, "A kernel language for abstract data types and modules," Proc. of the International Symp. Semantics of Data Types, (G. Kah, D.B. MacQueen and G.D. Plotkin, eds.), Lecture Notes in Computer Science 173, Springer-Verlag (1984), pp. 1–50.

    Google Scholar 

  3. S.A. Cook, "Soundness and completeness of an axiom system for program verification," SIAM J. Computing, 7 (1978), pp. 70–90.

    Google Scholar 

  4. O.J. Dahl, B. Myhrhang, and K. Nygaard, "The Simula 67 common base language," Norwegian Computing Center, Oslo (1968).

    Google Scholar 

  5. G.W. Ernst and W.F. Ogden, "Specification of abastract data types in MODULA," ACM TOPLAS, Vol. 2, No. 4, (1980), pp. 522–543.

    Google Scholar 

  6. K. Futatsugi, J.A. Goguen, J.P. Jouannaud and J. Meseguer, "Principles of OBJ2," Proc. of the 12th Ann. ACM Symp. Principles of Programming Languages, (1985), pp. 52–56.

    Google Scholar 

  7. C.A.R. Hoare, "Proof of correctness of data representation," Acta Informatica," 1 (1972), pp. 271–281.

    Google Scholar 

  8. B. Liskov, A. Snyder, R. Atkinson, and C. Schaffert, "Abstraction mechanisms in CLU," Communications ACM, 20 (1977), pp. 564–576.

    Google Scholar 

  9. R.L. London, J.V. Guttag, J.J. Horning, B.W. Lampson, J.G. Mitchell, and G.J. Popek, "Proof rules for the programming language EUCLID," Acta Informatica, 10 (1978), pp. 1–26.

    Google Scholar 

  10. P. Martin-Lof, "An intuitionistic theory of types: predicative part," Logic Colloquium '73, (H.E. Rose and J.C. Shepherdson, eds.), North-Holland (1975), pp. 73–118.

    Google Scholar 

  11. J.C. Mitchell and G.D. Plotkin, "Abstract types have existential type," Proc. of the 12th Ann. ACM Symp. Principles of Programming Languages, (1985), pp. 37–51.

    Google Scholar 

  12. D.C. Oppen and S.A. Cook, "Proving assertions about programs that manipulate data structures," Proc. of the 7th Ann. ACM Symp. Theory of Computing, (1975), pp. 107–116.

    Google Scholar 

  13. T. Venema and J. des Rivieres, "Euclid and Pascal," SIGPLAN Notices, Vol. 13 (3), (1978), pp. 57–69.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Warsaw, Poland

    Jerzy Tiuryn

Authors
  1. Jerzy Tiuryn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rohit Parikh

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tiuryn, J. (1985). A simple programming language with data types: semantics and verification. In: Parikh, R. (eds) Logics of Programs. Logic of Programs 1985. Lecture Notes in Computer Science, vol 193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15648-8_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-15648-8_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15648-2

  • Online ISBN: 978-3-540-39527-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation