000 | 01638naa a2200217 a 4500 | ||
---|---|---|---|
003 | AR-LpUFIB | ||
005 | 20250311170417.0 | ||
008 | 230201s2009 xx o 000 0 eng d | ||
024 | 8 |
_aDIF-M6510 _b6648 _zDIF005931 |
|
040 |
_aAR-LpUFIB _bspa _cAR-LpUFIB |
||
100 | 1 | _aBarrientos, Pablo Andrés | |
245 | 1 | 0 |
_aDeveloping DSLs using combinators : _ba design pattern |
300 | _a1 archivo (129,5 KB) | ||
500 | _aFormato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática - UNLP (Colección BIPA/Biblioteca) | ||
520 | _aThe development of domain-specific languages (DSLs) is considered by many authors as a hard task. To simplify the design of DSLs we describe a design pattern based on the combinators technique, which can also provide guidelines for previous domain analysis phase because it is based on equational reasoning over the domain knowledge. Combinators is a common technique from functional programming to write programs. It was used many times to implement domain-specific embedded languages (DSELs) but that implementation approach is not the only one. In this paper we present the pattern together with the underlying and basic ideas behind it. We also show benefits of using it and illustrate the use of this pattern with some examples. | ||
534 | _aInternational Multiconference on Computer Science and Information Technology (2009 oct. 12-14 : Mrągowo, Polonia). Proceedings. pp 635 - 642 | ||
650 | 4 | _aLENGUAJES DE DOMINIO ESPECÍFICO - DSL | |
700 | 1 | _aMartínez López, Pablo Ernesto | |
856 | 4 | 0 | _uhttp://dx.doi.org/10.1109/IMCSIT.2009.5352773 |
942 | _cCP | ||
999 |
_c55713 _d55713 |