Abstract
Turing complete languages can express unbounded computations over unbounded structures, either directly or by a suitable encoding. In contrast, Domain Specific Languages (DSLs) are intended to simplify the expression of computations over structures in restricted contexts. However, such simplification often proves irksome, especially for constructing more elaborate programs where the domain, though central, is one of many considerations. Thus, it is often tempting to extend a DSL with more general abstractions, typically to encompass common programming tropes, typically from favourite languages. The question then arises: once a DSL becomes Turing complete, then in what sense is it still domain specific?
| Original language | English |
|---|---|
| Title of host publication | RWDSL '16 Proceedings of the 1st International Workshop on Real World Domain Specific Languages |
| Publisher | Association for Computing Machinery |
| ISBN (Print) | 9781450340519 |
| DOIs | |
| Publication status | Published - 12 Mar 2016 |
| Event | 1st International Workshop on Real World Domain Specific Languages 2016 - Barcelona, Spain Duration: 12 Mar 2016 → 12 Mar 2016 |
Conference
| Conference | 1st International Workshop on Real World Domain Specific Languages 2016 |
|---|---|
| Abbreviated title | RWDSL 2016 |
| Country/Territory | Spain |
| City | Barcelona |
| Period | 12/03/16 → 12/03/16 |
Keywords
- Domain specific languages
- Expressiveness
ASJC Scopus subject areas
- Human-Computer Interaction
- Computer Networks and Communications
- Computer Vision and Pattern Recognition
- Software