Two Reengineering Patterns: Eliminating Type Checking

Ducasse, Stéphane; Nebbe, Robb; Richner, Tamar (July 1998). Two Reengineering Patterns: Eliminating Type Checking. In: Dyson, Paul (ed.) Third European Conference on Pattern Languages of Programming and Computing. Konstanz, Germany: UVK Universitätsverlag Konstanz GmbH

[img] Text
Duca98bTwoReengPatterns.pdf - Published Version
Restricted to registered users only
Available under License Publisher holds Copyright.

Download (61kB) | Request a copy

A reengineering pattern describes how to go from an existing legacy solution to a new refactored solution. In this paper we discuss the role of reengineering patterns and contrast them with design patterns and antipatterns. We then highlight the structure of a reengineering pattern and present two simple, related patterns for type-check elimination.

Item Type:

Conference or Workshop Item (Paper)

Division/Institute:

08 Faculty of Science > Institute of Computer Science (INF)
08 Faculty of Science > Institute of Computer Science (INF) > Software Composition Group (SCG)

UniBE Contributor:

Ducasse, Stephane

Subjects:

000 Computer science, knowledge & systems
500 Science > 510 Mathematics

Publisher:

UVK Universitätsverlag Konstanz GmbH

Language:

English

Submitter:

Manuela Bamert

Date Deposited:

10 Jan 2018 17:11

Last Modified:

21 Nov 2019 00:56

BORIS DOI:

10.7892/boris.104468

URI:

https://boris.unibe.ch/id/eprint/104468

Actions (login required)

Edit item Edit item
Provide Feedback