Maurice P. Herlihy
Barbara Liskov
- 1 CLARK, D.W. Copying list structures without auxiliary storage. Tech. Rep., Carnegie-Mellon Univ., Pittsburgh, Pa., Oct. 1975.Google Scholar
- 2 FABRY, R.S. How to design a system in which modules can be changed on the fly. Proc. 2nd Int. Conf. on Software Engineering, San Francisco, Calif., Oct. 1976, pp. 470-477. Google Scholar
- 3 FEINLER, E., AND POSTEL, J. Arpanet Protocol Handbook. Network Information Center, SRI International, Menlo Park, Calif., Jan. 1978.Google Scholar
- 4 FISHER, D.A. Copying cyclic structures in linear time using bounded workspace. Commun. ACM 18, 5 (May 1975), 251-253. Google Scholar
- 5 GUTTAG, J.V., AND HORNING, J.J. The algebraic specification of abstract data types. Acta Inf. 10 (1978), 27-52.Google Scholar
- 6 HABERMANN, N. Dynamically modifiable distributed systems. Proc. Distributed Sensor Net Workshop, Pittsburgh, Pa., Dec. 1978, pp. 111-114.Google Scholar
- 7 HERLmY, M. Transmitting abstract values in messages. Tech. Rep. MIT/LCS/TR-234, Laboratory for Computer Science, M.I.T., Cambridge, Mass., May 1980. Google Scholar
- 8 HOARE, C.A.R. Proof of correctness of data representation. Acta Inf. I (1972), 271-281.Google Scholar
- 9 KAPUR, D. Towards a theory for abstract data types. Tech. Rep. MIT/LCS/TR-237, Laboratory for Computer Science, M.I.T., Cambridge, Mass., May 1980. Google Scholar
- 10 LmKov, B.H. On linguistic support for distributed programs. Proc. Symp. on Reliability in Distributed Software and Data Base Systems, Pittsburgh, Pa., July 1981, pp. 53-60.Google Scholar
- 11 LmKov, B.H., ATKINSON, R.A., BLOOM, T., Moss, J.E., SCHAFFERT, J.C., SCHEIFLER, a.w., A~'O SNYDER, A. CL U Reference Manual, Lecture Notes in Computer Science 114. Springer-Verlag, New York, 1981.Google Scholar
- 12 LmKov, B.H., AND SCHEIFLER, R.W. Guardians and actions: Linguistic support for robust, distributed programs. Proc. 9th Ann. ACM Symp. on Principles of Programming Languages, Albuquerque, N.M., Jan. 1982, pp. 7-19. Google Scholar
- 13 LmKov, B.H., A~O SNYOER, A. Exception handling in CLU. IEEE Trans. Softw. Eng. SE-5, 6 (Nov. 1979), 546-558.Google Scholar
- 14 LIsKov, B.H., SNYDER, A., ATKINSON, R.R., AND SCHArFERT, J.C. Abstraction mechanisms in CLU. Commun. ACM 20, 8 (Aug. 1977), 564-576. Google Scholar
- 15 LIsI~ov, B.H., Argo ZILLES, S.N. Programming with abstract data types. Proc. ACM-SIGPLAN Conf. on Very High Level Languages, SIGPLAN Notices (ACM) 9, 4 (Apr. 1974), 50-59. Google Scholar
- 16 Moo~q, D.A. MacLISP Reference Manual, Revision O. Project MAC, M.I.T., Cambridge, Mass., Apr. 1974.Google Scholar
- 17 PRELIMXNARY ADA REFERENCE MANUAL. SIGPLAN Notices (ACM) 14, 6 (June 1979). Google Scholar
- 18 SCHANTZ, R.E., ANn MILLSTEIN, R.E. The foreman: Providing the program execution environment for the national software works. Tech. Rep. No. 3442, BBN, Jan. 1977.Google Scholar
- 19 SOLLINS, K. Copying complex structures in a distributed system. Tech. Rep. MIT/LCS/TR- 219, Laboratory for Computer Science, M.I.T., Cambridge, Mass., May 1979. Google Scholar
Index Terms
- A Value Transmission Method for Abstract Data Types
Recommendations
Polymorphic type inference and abstract data types
Many statically typed programming languages provide an abstract data type construct, such as the module in Modula-2. However, in most of these languages, implementations of abstract data types are not first-class values. Thus, they cannot be assigned to ...
Contractive signatures with recursive types, type parameters, and abstract types
ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part IIAlthough theories of equivalence or subtyping for recursive types have been extensively investigated, sophisticated interaction between recursive types and abstract types has gained little attention. The key idea behind type theories for recursive types ...
Comments