Final Data Types and Their Specification

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	ARDIS, M., AND HAMLET, R. The structure of specifications and implementations of data abstractions. Tech. Rep. TR-801, Dep. of Computer Science, Univ. of Maryland College Park, College Park, Md., 1979.
	2	Alberto Bertoni , Giancarlo Mauri , Pierangelo Miglioli, Towards a Theory of Abstract Data Types: A Discussion on Problems and Tools, Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming, p.44-58, April 22-24, 1980
	3	Martin Wirsing , Manfred Broy, Abstract Data Types as Lattices of Finitely Generated Models, Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science, p.673-685, September 01-05, 1980
	4	Robert Cartwright, A constructive alternative to axiomatic data type definitions, Proceedings of the 1980 ACM conference on LISP and functional programming, p.46-55, August 25-27, 1980, Stanford University, California, United States [doi>10.1145/800087.802789]
	5	DAHL, O.-J., AND HOARE, C.A.R. Hierarchical program structures. In O.-J. Dahl. E.W. Dijkstra, and C.A.R. Hoare, Structured Programming. Academic Press, New York, 1972, pp. 175-220.
	6	Jay Earley, Toward an understanding of data structures, Communications of the ACM, v.14 n.10, p.617-627, Oct. 1971 [doi>10.1145/362759.362764]
	7	Robert W. Floyd, The paradigms of programming, Communications of the ACM, v.22 n.8, p.455-460, Aug. 1979 [doi>10.1145/359138.359140]
	8	GIARRATANA, V., GIMONA, F., AND MONTANARI, U. Observability concepts in abstract data type specifications. In Lecture Notes in Computer Science, vol. 45: Mathematical Foundations of Computer Science 1976, A. Mazurkiewicz (Ed.). Springer-Verlag, New York, 1976, pp. 576-587.
	9	GOCUEN, J.A., THATCHER, J.W., AND WAGNER, E.G. An initial algebra approach to the specification, correctness, and implementation of abstract data types. In Current Trends in Programruing Methodology, vol. 4, R. Yeh (Ed.). Prentice-Hall, Englewood Cliffs, N.J., 1979, pp. 80-149.
	10	GORDON, M. The denotational semantics of sequential machines. Inf. Process. Lett. 10, 1 (Feb. 1980), 1-3.
	11	GOROON, M., MILNER, R., AND WADSWORTH, C. Lecture Notes in Computer Science, vol. 78: Edinburgh LCF. Springer-Verlag, New York, 1979.
	12	John Guttag, Abstract data types and the development of data structures, Communications of the ACM, v.20 n.6, p.396-404, June 1977 [doi>10.1145/359605.359618]
	13	John V. Guttag , Ellis Horowitz , David R. Musser, Abstract data types and software validation, Communications of the ACM, v.21 n.12, p.1048-1064, Dec. 1978 [doi>10.1145/359657.359666]
	14	HARRISON, M. Introduction to Switching and Automata Theory. McGraw-Hill, New York, 1965.
	15	HOARE, C.A.R. Proof of correctness of data representations. Acta Inf. 1, 4 (Nov. 1972), 271-281.
	16	JONES, C.B. Implementation bias in constructive specifications of abstract objects. Tech. Rep., IBM Belgium, European Systems Research Institute, La Hulpe, Belgium, 1977.
	17	KAMIN, S. Specifications and implementations. Unpublished manuscript.
	18	Samuel Kamin, Final data type specifications: a new data type specification method, Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.131-138, January 28-30, 1980, Las Vegas, Nevada [doi>10.1145/567446.567459]
	19	Sam Kamin, Some definitions for algebraic data type specifications, ACM SIGPLAN Notices, v.14 n.3, March 1979 [doi>10.1145/988071.988075]
	20	D. Kapur, TOWARDS A THEORY FOR ABSTRACT DATA TYPES, Massachusetts Institute of Technology, Cambridge, MA, 1980
	21	Deepak Kapur , Srivas Mandayam, Expressiveness of the operation set of a data abstraction, Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.139-153, January 28-30, 1980, Las Vegas, Nevada [doi>10.1145/567446.567460]
	22	LEHMANN, D.J., AND SMYTH, M.B. Data types. In 18th Annual Symposium on Foundations of Computer Science, Providence, R.I., Oct. 31-Nov. 2, 1977, pp. 7-12.
	23	LESCANNE, P. Behavioral completeness of abstract data type specifications. Massachusetts Inst. of Technology, Cambridge, Mass., 1981.
	24	LF. SCANNE, P. }~tude alg~brique et relationelle des types abstraits et de leur representation. Th~se d'Etat, Univ. de Nancy, Sept. 1979.
	25	Barbara Liskov , Alan Snyder , Russell Atkinson , Craig Schaffert, Abstraction mechanisms in CLU, Communications of the ACM, v.20 n.8, p.564-576, Aug. 1977 [doi>10.1145/359763.359789]
	26	LISKOV, B., AND ZILLES, S. Specification techniques for data abstractions. IEEE Trans. Softw. Eng. SE-1 (1975), 7-19.
	27	Limits of the "algebraic" specification of abstract data types, ACM SIGPLAN Notices, v.12 n.10, p.37-42, October 1977 [doi>10.1145/954627.954630]
	28	Zohar Manna, Mathematical Theory of Computation, Dover Publications, Incorporated, 2003
	29	MILNER, R. Fully abstract models of typed lambda-calculi. Theor. Comput. Sci. 4, 1 (Feb. 1977), 1-22.
	30	Robin Milner, Models of LCF., Stanford University, Stanford, CA, 1973
	31	PARK, D. Fixpoint induction and proofs of program properties. In Machine Intelligence, vol. 5, B. Meltzer and D. Michie (Eds.). Edinburgh Univ. Press, Edinburgh, 1969, pp. 59-78.
	32	PARNAS, D. The use of precise specifications in the development of software. Information Processing 77 (Toronto, Ont., Aug. 8-12, 1977), B. Gilchrist (Ed.). Elsevier North-Holland, New York, 1977, pp. 861-867.
	33	D. L. Parnas, On the criteria to be used in decomposing systems into modules, Communications of the ACM, v.15 n.12, p.1053-1058, Dec. 1972 [doi>10.1145/361598.361623]
	34	D. L. Parnas, A technique for software module specification with examples, Communications of the ACM, v.15 n.5, p.330-336, May 1972 [doi>10.1145/355602.361309]
	35	PLOTKIN, G. LCF considered as a programming language. Theor. Comput. Sci. 5, 3 (Dec. 1977), 223-255.
	36	ROBrNSON, L. The HDM Handbook, vol. 1: The Foundations of HDM. SRI International, Menlo Park, Calif., 1979.
	37	SCOTT, D. Data types as lattices. SIAM J. Comput. 5, 3 (Sept. 1976), 522-586.
	38	SUBRAHMANYAM, P., AND KIEBURTZ, R. Toward automatic program synthesis: Obtaining implementations from formal specifications. Tech. Rep. TR-80, Computer Science Dep., State Univ. of New York at Stony Brook, Stony Brook, N.Y., Sept. 1977.
	39	WAND, M. Final algebra semantics and data type extensions. J. Comput. Syst. Sci. 19, I (Aug. 1979), 27-44.
	40	WULF, W., LONDON, R., AND SHAW, M. An introduction to the construction and verification of ALPHARD programs. IEEE Trans. Softw. Eng. SE-2, 4 (Dec. 1976), 253-265.