Keynote address - data abstraction and hierarchy
OOPSLA '87 Addendum to the proceedings on Object-oriented programming systems, languages and applications (Addendum)
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
Lua—an extensible extension language
Software—Practice & Experience
Object-oriented software construction (2nd ed.)
Object-oriented software construction (2nd ed.)
Revised Report on the Algorithmic Language Scheme
Higher-Order and Symbolic Computation
Supporting compile-time debugging and precise error reporting in meta-programs
TOOLS'12 Proceedings of the 50th international conference on Objects, Models, Components, Patterns
| Hi-index | 0.00 |
Dynamically typed languages imply runtime resolution for type matching, setting-up an effectible ground for type-polymorphic functions. In statically typed object-oriented languages, operator overloading signifies the capability to statically extend the language semantics in the target program context. We show how the same can be accomplished dynamically in the Delta dynamic language, through simple member-function naming contracts. Additionally, we provide a software-pattern for dynamically extensible function semantics, something that cannot be accommodated with static function overloading. We demonstrate how meta-programming, i.e. crafting of parametric program capsules solving generic problems known as meta-algorithms or meta-components, become truly polymorphic, i.e. can accept an open set of parameter values, as far as those dynamically bind to eligible elements compliant to the meta-program design contract. In Delta, inheritance is dynamically supported as a runtime function, without any compile-time semantics, while all member function calls are resolved through late binding. We employ those features to show how Delta supports the imperative programming of polymorphic higher-order functions, such as generic function composers or the map function.