This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
ADJ (J. Goguen, J. Thatcher, E. Wagner) (1976) An Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types, IBM Research Report RC 6487.
ADJ (J. Goguen, J. Thatcher, E. Wagner, J. Wright) (1977) Initial Algebra Semantics and Continuous Algebras, Jour. ACM 24, 68–95.
Boyer, R. and J Moore. (1975): Proving Theorems about LISP Functions, Jour. ACM 22(1), 129–144 (January).
Cartwright, R. (1976): User-Defined Data Types as Aid to Verifying LISP Programs, in S. Michaelson and R. Milner (eds.), Automata Languages, and Programming, pp. 228–256, Edinburgh Press, Edinburgh.
Cartwright, R. (1980): A Constructive Alternative to Axiomatic Data Type Definitions. Proc. of 1980 LISP Conference, Stanford, California, August, 1980, pp. 46–55.
Cartwright, R. (1981): Formal Program Testing, Proc. Eighth Annual ACM Symposium on Principles of Programming Languages, January 1981, pp. 125–132.
Cartwright, R. and J. Donahue (1981): The Semantics of Lazy Evaluation, Technical Report, Department of Mathematical Sciences, Rice University, Houston, Texas.
Cartwright, R. and J. McCarthy (1979): First Order Programming Logic, Proc. Sixth Annual ACM Symposium on Principles of Programming Languages, January 1979, pp. 68–80.
Constable, R. and M. O'Donnell (1978): A Programming Logic, Winthrop Publishers, Cambridge.
Floyd, R. W. (1967): Assigning Meaning to Programs, Proc. of a Symposium in Applied Mathematics, American Mathematical Society, pp. 19–32.
Guttag, J. V. et al. (1976): Abstract Data Types and Software Validation, USC Information Sciences Institute Technical Report ISI/RR-76-48.
Guttag, J. V. (1977): Abstract Data Types and the Development of of Data Types, Acta Informatica 10, 27–52.
Guttag, J. V. and J. J. Horning (1978): The Algebraic Specification Data Structures, Comm. ACM 20, 396–404.
Henderson, P. and J. Morris (1976): A Lazy Evaluator, Proc. of the 3rd Annual ACM Symposium on Principles of Programming Languages, January 1976, pp. 95–103.
von Henke, F. and D. C. Luckham (1974): Automatic Program Verification III: A Methodology for Verifying Programs, Stanford Artificial Intelligence Project Memo AIM-256.
Hoare, C. A. R. (1969): "An Axiomatic Basis for Computer Programming", Comm. ACM 12, 576–580.
Hoare, C. A. R. (1973): Recursive Data Types, Stanford Artificial Intelligence Project Memo AIM-223.
Loeckx, J. (1980): Algorithmic Specifications of Abstract Data Types, Technical Report, Informatik, Universitat des Saarlandes, Saarbrucken, West Germany.
McCarthy, J. (1963): A Basis for a Mathematical Theory of Computation, in P. Braffort and D. Hirschberg (eds.), Computer Programming and Formal Systems), pp. 33–70. North-Holland Publishing Company, Amsterdam.
Milner, R., Implementation and Application of Scott's Logic for Computable Functions, Proc. ACM Conf. on Proving Assertions about Programs, SIGPLAN Notices 7,1, January, 1972, pp. 1–6.
Pratt, V. (1976): Semantical Considerations of Floyd-Hoare Logic, 17th Annual IEEE Symposium on the Foundations of Computer Science, October, 1976, pp. 109–121.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cartwright, R. (1982). Toward a logical theory of program data. In: Kozen, D. (eds) Logics of Programs. Logic of Programs 1981. Lecture Notes in Computer Science, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025773
Download citation
DOI: https://doi.org/10.1007/BFb0025773
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11212-9
Online ISBN: 978-3-540-39047-3
eBook Packages: Springer Book Archive