# A simple programming language with data types: semantics and verification

Extended abstract

Conference paper

First Online:

## Preview

Unable to display preview. Download preview PDF.

## References

- [B 75]Barwise, J. Admissible sets of Structures, Springer-Verlag, Berlin (1975).Google Scholar
- [BL 84]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
- [C 78]S.A. Cook, "Soundness and completeness of an axiom system for program verification," SIAM J. Computing, 7 (1978), pp. 70–90.Google Scholar
- [DMN 68]O.J. Dahl, B. Myhrhang, and K. Nygaard, "The Simula 67 common base language," Norwegian Computing Center, Oslo (1968).Google Scholar
- [EO 80]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
- [FG 85]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
- [H 72]C.A.R. Hoare, "Proof of correctness of data representation," Acta Informatica," 1 (1972), pp. 271–281.Google Scholar
- [LS 77]B. Liskov, A. Snyder, R. Atkinson, and C. Schaffert, "Abstraction mechanisms in CLU," Communications ACM, 20 (1977), pp. 564–576.Google Scholar
- [LG 78]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
- [M-L 73]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
- [MP 85]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
- [OC 75]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
- [VR 78]T. Venema and J. des Rivieres, "Euclid and Pascal," SIGPLAN Notices, Vol. 13 (3), (1978), pp. 57–69.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1985