Domain-Specific Languages: IFIP TC 2 Working Conference, DSL 2009, Oxford, UK, July 15-17, 2009, Proceedings (Lecture Notes in Computer Science, 5658)

This volume presents the proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages, DSL 2009 held in Oxford, UK, during July 15-17, 2009. The 18 peer-reviewed full papers were selected from a total of 48 submissions. The topics covered by the papers represent the diversity of applications, challenges, and methods of domain-specific languages. The papers are organized in topical sections on semantics, methods and tools, and case studies. Front Matter....Pages - J Is for A Direct-Style Correspondence between Algol-Like Languages and JavaScript Using First-Class Continuations....Pages 1-19 Model-Driven Engineering from Modular Monadic Semantics: Implementation Techniques Targeting Hardware and Software....Pages 20-44 A MuDDy Experience–ML Bindings to a BDD Library....Pages 45-57 Gel: A Generic Extensible Language....Pages 58-77 A Taxonomy-Driven Approach to Visually Prototyping Pervasive Computing Applications....Pages 78-99 LEESA: Embedding Strategic and XPath-Like Object Structure Traversals in C++....Pages 100-124 Unit Testing for Domain-Specific Languages....Pages 125-147 Combining DSLs and Ontologies Using Metamodel Integration....Pages 148-169 A Domain Specific Language for Composable Memory Transactions in Java....Pages 170-186 CLOPS: A DSL for Command Line Options....Pages 187-210 Nettle: A Language for Configuring Routing Networks....Pages 211-235 Generic Libraries in C++ with Concepts from High-Level Domain Descriptions in Haskell....Pages 236-261 Domain-Specific Language for HW/SW Co-design for FPGAs....Pages 262-284 A Haskell Hosted DSL for Writing Transformation Systems....Pages 285-309 Varying Domain Representations in Hagl....Pages 310-334 A DSL for Explaining Probabilistic Reasoning....Pages 335-359 Embedded Probabilistic Programming....Pages 360-384 Operator Language: A Program Generation Framework for Fast Kernels....Pages 385-409 Back Matter....Pages - Dijkstra Once Wrote That Computer Science Is No More About Computers Than Astronomy Is About Telescopes. Despite The Many Incredible Advances In C- Puter Science From Times That Predate Practical Mechanical Computing, There Is Still A Myriad Of Fundamental Questions In Understanding The Interface Between Computers And The Rest Of The World. Why Is It Still Hard To Mechanize Many Tasks That Seem To Be Fundamentally Routine, Even As We See Ever-increasing - Pacity For Raw Mechanical Computing? The Disciplined Study Of Domain-speci?c Languages (dsls) Is An Emerging Area In Computer Science, And Is One Which Has The Potential To Revolutionize The ?eld, And Bring Us Closer To Answering This Question. Dsls Are Formalisms That Have Four General Characteristics. – They Relate To A Well-de?ned Domain Of Discourse, Be It Controlling Tra?c Lights Or Space Ships. – They Have Well-de?ned Notation, Such As The Ones That Exist For Prescribing Music, Dance Routines, Or Strategy In A Football Game. – The Informal Or Intuitive Meaning Of The Notation Is Clear. This Can Easily Be Overlooked, Especially Since Intuitive Meaning Can Be Expressed By Many Di?erent Notations That May Be Received Very Di?erently By Users. – The Formal Meaning Is Clear And Mechanizable, As Is, Hopefully, The Case For The Instructions We Give To Our Bank Or To A Merchant Online.