000102707 001__ 102707
000102707 005__ 20190316233948.0
000102707 037__ $$aPROC
000102707 245__ $$aProceedings of the 21st European Conference on Object-Oriented Programming (ECOOP), Berlin
000102707 269__ $$a2006
000102707 260__ $$aHeidelberg$$bSpringer$$c2006
000102707 336__ $$aConference Proceedings
000102707 520__ $$aData in object-oriented programming is organized in a hierarchy of classes. The problem of *object-oriented pattern matching* is how to explore this hierarchy from the outside. This usually involves classifying objects by their run-time type, accessing their members, or determining some other characteristic of a group of objects. In this paper we compare six different pattern matching techniques: object-oriented decomposition, visitors, type-tests/type-casts, typecase, case classes, and extractors. The techniques are compared on nine criteria related to conciseness, maintainability and performance. The paper introduces case classes and extractors as two new pattern-matching methods and shows that their combination works well for all of the established criteria.
000102707 6531_ $$aobject-oriented programming
000102707 6531_ $$apattern matching
000102707 6531_ $$alanguage design
000102707 6531_ $$atype systems
000102707 6531_ $$ageneralized algebraic data types
000102707 7112_ $$aEuropean Conference on Object-Oriented Programming (ECOOP)$$cBerlin$$dJuly 30 - August 03
000102707 720_1 $$0241083$$aEmir, Burak$$eed.$$g126743
000102707 720_1 $$aKennedy, Andrew$$eed.
000102707 720_1 $$aRusso, Claudio$$eed.
000102707 720_1 $$aYu, Dachuan$$eed.
000102707 8564_ $$uhttp://ecoop07.swt.cs.tu-berlin.de/$$zURL
000102707 909C0 $$0252187$$pLAMP$$xU10409
000102707 909CO $$ooai:infoscience.tind.io:102707$$pproc$$pIC$$qGLOBAL_SET
000102707 937__ $$aLAMP-PROC-2007-001
000102707 973__ $$aEPFL$$sPUBLISHED
000102707 980__ $$aPROC