Technology Tags

Technology Tags > Tag based links for Dsl

The following links have been tagged dsl by users just like you, because these resources are off-site we cannot guarantee the accuracy or quality of any third-party information.

Optimising Embedded DSLs using Template Haskell: (October 2004), pp. 186-205.Embedd ed domain specific languages (EDSLs) provide a specialised language for a particular application area while harnessing the infrastructure of an existing general purpose programming language. The reduction in implementation costs that results from this approach comes at a price: the EDSL often compiles to inefficient code since the host language's compiler only optimises at the level of host language constructs.Sea n Seefried, Manuel Chakravarty, Gabriele Keller

Source: (October 2004), pp. 186-205.
DSL implementation using staging and monads: (1999), pp. 81-94.The impact of Domain Specific Languages (DSLs) on software design is considerable. They allow programs to be more concise than equivalent programs written in a high-level programming languages. They relieve programmers from making decisions about data-structure and algorithm design, and thus allows solutions to be constructed quickly. Because DSL's are at a higher level of abstraction they are easier to maintain and reason about than equivalent programs written in a highlevel language, and...Tim Sheard, Zine-El-Abidin e Benaissa, Emir Pasalic

Source: (1999), pp. 81-94.
High-level views on low-level representation s: (2005), pp. 168-179.This paper explains how the high-level treatment of datatypes in functional languages---us ing features like constructor functions and pattern matching---can be made to coexist with bitdata. We use this term to describe the bit-level representation s of data that are required in the construction of many different applications, including operating systems, device drivers, and assemblers. We explain our approach as a combination of two language extensions, each of which could potentially be adapted to any modern functional language. The first adds simple and elegant constructs for manipulating raw bitfield values, while the second provides a view-like mechanism for defining distinct new bitdata types with fine-control over the underlying representation . Our design leverages polymorphic type inference, as well as techniques for improvement of qualified types, to track both the type and the width of bitdata structures. We have implemented our extensions in a small functional language interpreter, and used it to show that our approach can handle a wide range of practical bitdata types.Iavor Diatchki, Mark Jones, Rebekah Leslie

Source: (2005), pp. 168-179.
Haskell server pages through dynamic loading: (2005), pp. 39-48.Haskell Server Pages (HSP) is a domain specific language, based on Haskell, for writing dynamic web pages. Its main features are concrete XML expressions as first class values, pattern-matchi ng on XML, and a runtime system for evaluating dynamic web pages.The first design of HSP was made by Erik Meijer and Danny van Velzen in 2000, but it was never fully designed nor implemented. In this paper we refine, extend and improve their design of the language and describe how to implement HSP using dynamic loading of pages.Niklas Broberg

Source: (2005), pp. 39-48.
Building compilers by combining algebras: Engineering of Computer-Based Systems, 2005. ECBS '05. 12th IEEE International Conference and Workshops on the (2005), pp. 331-338.Embedd ed systems present a wide variety of challenges for developers of language tools. Verification of correctness, flexibility for adding new language features, and retargeting new architectures all present significant problems when developing a compiler for embedded systems. In this paper we present a domain-specifi c language based on modular monadic semantics which addresses many of these challenges.G Kimmell, E Komp, P Alexander

Source: Engineering of Computer-Based Systems, 2005. ECBS '05. 12th IEEE International Conference and Workshops on the (2005), pp. 331-338.
Dynamic optimization for functional reactive programming using generalized algebraic data types: (2005), pp. 54-65.A limited form of dependent types, called Generalized Algebraic Data Types (GADTs), has recently been added to the list of Haskell extensions supported by the Glasgow Haskell Compiler. Despite not being full-fledged dependent types, GADTs still offer considerably enlarged scope for enforcing important code and data invariants statically. Moreover, GADTs offer the tantalizing possibility of writing more efficient programs since capturing invariants statically through the type system sometimes obviates entire layers of dynamic tests and associated data markup. This paper is a case study on the applications of GADTs in the context of Yampa, a domain-specifi c language for Functional Reactive Programming in the form of a self-optimizin g, arrow-based Haskell combinator library. The paper has two aims. Firstly, to explore what kind of optimizations GADTs make possible in this context. Much of that should also be relevant for other domain-specifi c embedded language implementation s, in particular arrow-based ones. Secondly, as the actual performance impact of the GADT-based optimizations is not obvious, to quantify this impact, both on tailored micro benchmarks, to establish the effectiveness of individual optimizations, and on two fairly large, realistic applications, to gauge the overall impact. The performance gains for the micro benchmarks are substantial. This implies that the Yampa API could be simplified as a number of "pre-composed" primitives that were there mainly for performance reasons are no longer needed. As to the applications, a worthwhile performance gain was obtained in one case whereas the performance was more or less unchanged in the other.Henrik Nilsson

Source: (2005), pp. 54-65.
Dynamic applications from the ground up: (2005), pp. 27-38.Some Lisp programs such as Emacs, but also the Linux kernel (when fully modularised) are mostly dynamic; i.e., apart from a small static core, the significant functionality is dynamically loaded. In this paper, we explore fully dynamic applications in Haskell where the static core is minimal and code is hot swappable. We demonstrate the feasibility of this architecture by two applications: Yi, an extensible editor, and Lambdabot, a plugin-based IRC robot. Benefits of the approach include hot swappable code and sophisticated application configuration and extension via embedded DSLs. We illustrate both benefits in detail at the example of a novel embedded DSL for editor interfaces.Don Stewart, Manuel Chakravarty

Source: (2005), pp. 27-38.
Compiling Embedded Languages: (2000), pp. 9-27.Functiona l languages are particularly well-suited to the implementation of interpreters for domain-specifi c embedded languages (DSELs). We describe an implemented technique for producing optimizing compilers for DSELs, based on Kamin's idea of DSELs for program generation. The technique uses a data type of syntax for Family of programming languages. Available variations include Visual Ba ...'>basic types, a set of smart constructors that perform rewriting over those types, some code motion transformation s, and a back-end code generator. Domain-specifi c optimization.. .Conal Elliott, Sigbjorn Finne, Oege de Moor

Source: (2000), pp. 9-27.
Notable design patterns for domain-specifi c languages: J. Syst. Softw., Vol. 56, No. 1. (February 2001), pp. 91-99.Diomidis Spinellis

Source: J. Syst. Softw., Vol. 56, No. 1. (February 2001), pp. 91-99.
Concrete syntax for data objects in functional languages: (1988), pp. 96-105.Annika Aasa, Kent Petersson, Dan Synek

Source: (1988), pp. 96-105.

If you would like to find additional social bookmark based links on the topic of dsl we recommend the Open Tag Directory > Dsl. If you would like to find related tags we recommend Tag Patterns > Dsl.