Constraint programming for type inference in flexible model-driven engineering
نویسندگان
چکیده
منابع مشابه
Model-Driven Constraint Engineering
Precise specification of meta-models is an important prerequisite for the successful application of a model-driven engineering (MDE) process. One means of precise specification are textual constraints. However, the task of constraint development is time-consuming and error-prone if done manually. In this paper, we present both a methodology and a tool for developing constraints in a systematic ...
متن کاملType Inference Using Concrete Syntax Properties in Flexible Model-Driven Engineering
In traditional Model-Driven Engineering (MDE) models are instantiated from metamodels. In contrast, in Flexible MDE, language engineers initially create example models of the envisioned metamodel. Due to the lack of a metamodel at the beginning, the example models may include errors like missing types, typos or the use of different types to express the same domain concepts. In previous work [1]...
متن کاملType Inference for Programming Languages: A Constraint Logic Programming Approach
In this paper we present an application of Constraint Logic Programming to the design and implementation of type inference algorithms for programming languages. We present implementations in Prolog and Constraint Handling Rules (CHR) of several algorithms which belong to the state of the art of type inference for programming languages: the Damas-Milner type system, the Ohory system for labeled ...
متن کاملPartial Model Completion in Model Driven Engineering using Constraint Logic Programming
In Model Driven Engineering a model is a graph of objects that conforms to a meta-model and a set of constraints. The meta-model and the constraints declaratively restrict models to a valid set. Models are used to represent the state and behaviour of software systems. They are specified in visual modelling environments or automatically synthesized for program testing. In such applications, a mo...
متن کاملProgramming Constraint Inference Engines
Existing constraint programming systems offer a fixed set of inference engines implementing search strategies such as single, all, and best solution search. This is unfortunate, since new engines cannot be integrated by the user. The paper presents first-class computation spaces as abstractions with which the user can program inference engines at a high level. Using computation spaces, the pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Languages, Systems & Structures
سال: 2017
ISSN: 1477-8424
DOI: 10.1016/j.cl.2016.12.002