Context-sensitive domain-independent algorithm composition and selection

Progressing beyond the productivity of present-day languages appears to require using domain-specific knowledge. Domain-specific languages and libraries (DSLs) proliferate, but most optimizations and language features have limited portability because each language’s semantics are related closely to its domain. We explain how any DSL compiler can use a domain-independent AI planner to implement algorithm composition as a language feature. Our notion of composition addresses a common DSL problem: good library designers tend to minimize redundancy by including only fundamental procedures that users must chain together into call sequences. Novice users are confounded by not knowing an appropriate sequence to achieve their goal. Composition allows the er to define and call an abstract algorithm (AA) like a procedure. The compiler replaces an AA call with a sequence of library calls, while considering the calling context. Because AI planners compute a sequence of operations to reach a ...

• Type: Conference
• Year: 2006
• Where: PLDI
• Authors: Troy A. Johnson, Rudolf Eigenmann
• Keywords: Ai Planners, Algorithm Composition, Language Feature, PLDI 2006, Programming Languages