1999 ◽  
Vol 9 (5) ◽  
pp. 483-525 ◽  
Author(s):  
PETER THIEMANN

We present a general method to transform a compositional specification of a specializer for a functional programming language into a set of combinators that can be used to perform the same specialization more efficiently. The main transformation steps are the transition to higher-order abstract syntax and untagging. All transformation steps are proved correct. The resulting combinators can be implemented in any functional language, typed or untyped, pure or impure. They may also be considered as forming a domain-specific language for meta-programming. We demonstrate the generality of the method by applying it to several specializers of increasing strength. We demonstrate its efficiency by comparing it with a traditional specialization system based on self-application.


2012 ◽  
Vol 9 (3) ◽  
pp. 1075-1103 ◽  
Author(s):  
Milan Celikovic ◽  
Ivan Lukovic ◽  
Slavica Aleksic ◽  
Vladimir Ivancevic

In this paper, we present a platform independent model (PIM) of IIS*Case tool for information system (IS) design. IIS*Case is a model driven software tool that provides generation of executable application prototypes. The concepts are described by Meta Object Facility (MOF) specification, one of the commonly used approaches for describing meta-models. One of the main reasons for having IIS*Case PIM concepts specified through the meta-model, is to provide software documentation in a formal way, as well as a domain analysis purposed at creation a domain specific language to support IS design. Using the PIM meta-model, we can generate test cases that may assist in software tool verification. The meta-model may be also a good base for the process of the concrete syntax generation for some domain specific language.


Author(s):  
Alberto Simões ◽  
Rui Miguel da Costa Meira

This chapter describes an approach for the implementation of embedded domain-specific languages by using operator overloads and the creation of abstract syntax trees in run-time. Using the host language parser, an AST is created stating the structure of the DSL expression that is later analyzed, simplified, and optimized before the evaluation step. For the illustration of this process, the chapter proposes a domain-specific language for a basic linear algebra system dealing with matrices algebra and its optimization.


Author(s):  
Jessica Ray ◽  
Ajav Brahmakshatriya ◽  
Richard Wang ◽  
Shoaib Kamil ◽  
Albert Reuther ◽  
...  

2021 ◽  
Vol 205 ◽  
pp. 102610
Author(s):  
Davide Ancona ◽  
Luca Franceschini ◽  
Angelo Ferrando ◽  
Viviana Mascardi

2021 ◽  
pp. 102642
Author(s):  
Xiomarah Guzmán-Guzmán ◽  
Edward Rolando Núñez-Valdez ◽  
Raysa Vásquez-Reynoso ◽  
Angel Asencio ◽  
Vicente García-Díaz

Sign in / Sign up

Export Citation Format

Share Document