Algorithm-oriented generic libraries
Software—Practice & Experience
Efficient implementation of adaptive software
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Adaptive Object-Oriented Software: The Demeter Method with Propagation Patterns
Adaptive Object-Oriented Software: The Demeter Method with Propagation Patterns
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Component Enhancement: An Adaptive Reusability Mechanism for Groups of Collaborating Classes
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Interaction Schemata: Compiling Interactions to Code
TOOLS '99 Proceedings of the Technology of Object-Oriented Languages and Systems
Demeter interfaces: adaptive programming without surprises
ECOOP'06 Proceedings of the 20th European conference on Object-Oriented Programming
| Hi-index | 0.00 |
This paper studies a particular variant of Generic Programming, called Adaptive Programming (AP).W e explain the approach taken by Adaptive Programming to attain the goals set for Generic Programming.Within the formalism of AP, we explore the important problem of refinement: given two generic programs, does one express a subset of the programs expressed by the other? We show that two natural definitions of refinement coincide, but the corresponding decision problem is computationally intractable (co-NP-complete).W e proceed to define a more restricted notion of refinement, which arises frequently in the practice of AP, and give an efficient algorithm for deciding it.