: Tuesday
Scalable Component Abstractions
San Diego Room
Tuesday, 11:30, 30 minutes
| 7 | · | 8 | · | 9 | · | 10 | · | 11 | · | 12 | · | 13 | · | 14 | · | 15 | · | 16 | · | 17 | · | 18 | · | 19 | · | 20 | · | 21 |
Martin Odersky, EPFL
Matthias Zenger, Google
We identify three programming language abstractions for the construction of reusable components: abstract type members, explicit selftypes, and symmetric mixin composition. Together, these abstractions enable us to transform an arbitrary assembly of static program parts with hard references between them into a system of reusable components. The transformation maintains the structure of the original system. We demonstrate this approach in two case studies, a subject/observer framework and a compiler front-end.
