Type-safe covariance in C++

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Type-safe covariance in C++

Full text

Pdf (194 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 2004 ACM symposium on Applied computing table of contents

Nicosia, Cyprus

SESSION: Programming languages (PL) table of contents

Pages: 1496 - 1502

Year of Publication: 2004

ISBN:1-58113-812-1

Authors

Vitaly Surazhsky	Israel-Institute of Technology, Technion City, Haifa, Israel
Joseph (Yossi) Gil	Israel-Institute of Technology, Technion City, Haifa, Israel

Sponsor

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 79, Citation Count: 2

Additional Information:

abstract references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/967900.968198 What is a DOI?

ABSTRACT

We present a programming technique for implementing type safe covariance in C++. In a sense, we implement most of Bruce's matching approach to the covariance dilemma in C++. The appeal in our approach is that it relies on existing mechanisms, specifically templates, and does not require any modification to the existing language. The practical value of the technique was demonstrated in its successful incorporation in a large software body. We identify the ingredients of a programming language required for applying the technique, and discuss extensions to other languages.

REFERENCES

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	K. Arnold and J. Gasling. The Java Prog. Lang. Addison-Wesley, 1996.
	2	K. Bruce. Increasing JAVA'S expressiveness with this Type and match-bounded polymorphism. On the web6, 1997.
	3	K. Bruce, L. Cardeli, G. Castagna, T. H. O. Group, G. T. Leavens, and B. Pierce. On binary methods. Theory and Practice of Object Systems, 1(3), 1996.
	4	K. B. Bruce, A. Fiech, and L. Petersen. Subtyping is not a good "match" for oo lang. In ECOOP'97.
	5	Kim B. Bruce , Angela Schuett , Robert van Gent, PolyTOIL: A Type-Safe Polymorphic Object-Oriented Language, Proceedings of the 9th European Conference on Object-Oriented Programming, p.27-51, August 07-11, 1995
	6	Luca Cardelli , Peter Wegner, On understanding types, data abstraction, and polymorphism, ACM Computing Surveys (CSUR), v.17 n.4, p.471-523, Dec. 1985 [doi>10.1145/6041.6042]
	7	Giuseppe Castagna, Covariance and contravariance: conflict without a cause, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.3, p.431-447, May 1995 [doi>10.1145/203095.203096]
	8	Craig Chambers , Gary T. Leavens, Typechecking and modules for multimethods, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.6, p.805-843, Nov. 1995 [doi>10.1145/218570.218571]
	9	D. Colnet and L. Liquori. Match-O, a dialect of Eiffel with Match-Types, pp. 190--201. In TOOLS PACIFIC'00.
	10	Erich Gamma , Richard Helm , Ralph Johnson , John Vlissides, Design patterns: elements of reusable object-oriented software, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1995
	11	J. Y. Gil and Z. Gutterman. Compile time symbolic derivation with C++ templates. In COOTS'98, pp. 249--262.
	12	Adele Goldberg , David Robson, Smalltalk-80: the language and its implementation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1983
	13	C. Gotsman and V. Surazhsky. Guaranteed intersection-free polygon morphing. Computers & Graphics, 25(1):67--75, Feb. 2001.
	14	O. L. Madsen, B. Møller-Pedersen, and K. Nygaard. OO Prog. in the Beta Prog. Lang. Addison-Wesley, 1993.
	15	Bertrand Meyer, Eiffel: the language, Prentice-Hall, Inc., Upper Saddle River, NJ, 1992
	16	Todd D. Millstein , Craig Chambers, Modular Statically Typed Multimethods, Proceedings of the 13th European Conference on Object-Oriented Programming, p.279-303, June 14-18, 1999
	17	David R. Musser , Atul Saini, The STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1995
	18	S. M. Omohundro The Sather 1.0 Specification, Jan. 1994.
	19	Laurence C. Paulson, ML for the working programmer, Cambridge University Press, New York, NY, 1991
	20	R. Rinat. Type-safe covariant specialization with generalized matching. In The 7th Int. Workshop on Foundations of OO Lang.
	21	Guy L. Steele, Jr., Common LISP: the language (2nd ed.), Digital Press, Newton, MA, 1990
	22	B. Stroustrup. The C++ Prog. Lang. Addison-Wesley. 2nd ed., 1991.
	23	B. Stroustrup. The C++ Prog. Addison-Wesley, 3rd ed., 1997.
	24	Controllable morphing of compatible planar triangulations, ACM Transactions on Graphics (TOG), v.20 n.4, p.203-231, October 2001 [doi>10.1145/502783.502784]
	25	Vitaly Surazhsky , Craig Gotsman, Explicit surface remeshing, Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing, June 23-25, 2003, Aachen, Germany
	26	C. Szypersky, S. Omohundro, and S. Murer. Engineering a prog. lang.: The type and class system of Sather. Tech. Rep. 93--064, The Int. Comp. Sc. Inst., Berkeley, Ca, Nov. 1993.
	27	David A. Watt, Programming language concepts and paradigms, Prentice-Hall, Inc., Upper Saddle River, NJ, 1990
	28	N. Wirth. The prog. lang. Pascal. Acta Inf., 1:35--63, 1971.

CITED BY 2

	Chang-Hyun Jo , Marjan Mernik , Barrett R. Bryant, Editorial message: special track on the programming languages, Proceedings of the 2004 ACM symposium on Applied computing, March 14-17, 2004, Nicosia, Cyprus
	Joseph (Yossi) Gil , Keren Lenz, Simple and safe SQL queries with c++ templates, Proceedings of the 6th international conference on Generative programming and component engineering, October 01-03, 2007, Salzburg, Austria