Expressiveness of the operation set of a data abstraction

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 1980, Pages 139-153

  Kapur, Deepak ^a   Mandayam, Srivas ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COBOL (PROGRAMMING LANGUAGE);

COMPUTABLE FUNCTIONS; DATA ABSTRACTION; EXPRESSIVE POWER;

ABSTRACTING; COMPUTER PROGRAMMING LANGUAGES;

EID: 0019112114     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/567446.567460     Document Type: Conference Paper

References (18)

1. Greif, I. G., Induction in Proofs about Programs. MAC TR-93, MIX, Cambridge, MA, Feb,, 1972.
2. Goguen, J. A., Thatcher, J. W., Wagner, E. G., "Initial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types", Current Trends in Programming Methodology, Vol. IV, Data Structuring, (Ed. Yeh, R. T.), Prentice Hall (Automatic Computation Series), Englewood Cliffs, New Jersey, 1978.
3. Guttag, J. V., The specification and Application to Programming of Abstract Data Types. Ph. D. Thesis, University of Toronto, CSRG-59, 1975.
4. Guttag, J. V., Horowitz, E., Musser, D. R., "Abstract Data Types and Software Validation", Comm. ACM Vol. 21 No. 12, 1048-1064, Dec. 1978.
5. Hoare, C. A. R., "Proof of Correctness of Data Representations", Acta Informatica Vol. 1, No. 4, pp 271-281, 1972.
6. Jones, A. K., Liskov, B. H. "A Language Extension for Controlling Access to Shared Data", IEEE Tran. on Software Engg Vol. SE-2 No. 4, pp. 277-285, Dec. 1976.
7. Kapur, D., Srivas, M. K., Expressiveness of the Operation Set of A Data Abstraction. Computation Structures Group Memo 179-1, Lab. for Computer Science, M. I. T., Cambridge, MA, June, 1979, Revised Nov., 1979.
8. Kapur, D., Towards a Theory for Abstract Data Types Forthcoming Ph. D. Thesis, Dept. of E. E. & C. S., M. I. T., Cambridge, Mass., Jan., 1980.
9. Kleene, S. C., "General Recursive Functions of Natural Numbers", Mathematical Annals 112, pp. 727-742 (1936).
10. Liskov, B. H., Snyder, A., Atkinson, R., Schaffert, C, "Abstraction Mechanisms in CLU", CACM Vol. 20 No. 8, pp. 564-576, 1977.
11. Liskov, B. L., Snyder, A. S., Exception Handling In CLU. Computation Structures Group Memo 155-2, Lab. for Computer Science, M. I. T., Cambridge, MA, Dec, 1977, Revised March 1979. To appear in IEEE Trans. on Software Engineering.
12. McCarthy, J., "A Basis for a Mathematical Theory of Computation" in Computer Programming and Formal Systems, (Eds. Braffort and Hirschberg), North Holland Publishing Co., Amsterdam-London, pp 33-70, 1963.
13. Morris, J. H., Jr., "Towards More Flexible Systems", Lecture Notes in Computer Science 19, Springer-Verlag, pp. 377-383, 1974.
14. Rogers, H., Jr., Theory of Recursive Functions and Effective Computability. McGraw-Hill Series in Higher Mathematics, McGraw-Hill, Inc., 1967.
15. Srivas, M. K., "Draft of a Thesis Proposal on Automatic Synthesis of Abstract Data Types", LCS, M. I. T., December 1978.
16. Weihrauch, K., "A Generalized Computability Thesis", Lecture Notes in Computer Science 56, Springer-verlag, pp. 538-542, 1977.
17. Wulf, W., London, R. L., and Shaw, M., Abstraction and Verification in ALPHARD: Introduction to Language and Methodology. Carnegie-Mellon University Technical Report, also USC Information Sciences Institute Research Report, 1976.
18. Zilles, S. N., An Introduction to Data Algebra. Draft Working Paper, IBM San Jose Research Lab., Sept. 1975.