Composing Non-orthogonal Meta-programs Composing Non-orthogonal Meta-programs
نویسندگان
چکیده
A key feature of meta-level architectures is the strict separation between the application and the non-functional requirements. In a base-level, the application behaviour is modelled. Other requirements are handled in a meta-program. This makes both application and meta-program reusable. We introduce a mechanism based on high-level declarative policies to overcome the diiculty of tailoring a meta-program to application demands, without sacriicing its genericity. These policies can also be used in the composition of multiple meta-programs in a meta-tower. Often, the requirements are not completely orthogonal, and dependencies between the meta-programs in the tower are generated. Through policy speciications, these dependencies can be described separately from the implementation. This results in reusable and composable meta-programs in a more general case. Abstract A key feature of meta-level architectures is the strict separation between the application and the non-functional requirements. In a base-level, the application behaviour is modelled. Other requirements are handled in a meta-program. This makes both application and meta-program reusable. We introduce a mechanism based on high-level declarative policies to overcome the diiculty of tailoring a meta-program to application demands, without sacriicing its genericity. These policies can also be used in the composition of multiple meta-programs in a meta-tower. Often, the requirements are not completely orthogonal, and dependencies between the meta-programs in the tower are generated. Through policy speciications, these dependencies can be described separately from the implementation. This results in reusable and composable meta-programs in a more general case.
منابع مشابه
Composing non-orthogonal meta-programs
A key feature of meta-level architectures is the strict separation between the application and the non-functional requirements. In a baselevel, the application behaviour is modelled. Other requirements are handled in a meta-program. This makes both application and metaprogram reusable. We introduce a mechanism based on high-level declarative policies to overcome the di culty of tailoring a meta...
متن کاملMeta-programming with Concrete Object Syntax
Meta programs manipulate structured representations, i.e., abstract syntax trees, of programs. The conceptual distance between the concrete syntax meta-programmers use to reason about programs and the notation for abstract syntax manipulation provided by general purpose (meta-) programming languages is too great for many applications. In this paper it is shown how the syntax definition formalis...
متن کاملComposing and Validating Orthogonal Concerns and Heterogeneous Models
Composing and Validating Orthogonal Concerns and Heterogeneous Models
متن کاملAmalgamating Language and Meta-language for Composing Logic Programs
Logic programming is extended with expressions of the form A in Pexp both in top-level goals and in clause bodies. A in Pexp is a meta-level feature that denotes the truth of a formula A with respect to a \virtual" set of clauses denoted by the program expression Pexp. Pexp involves named collections of clauses and composition operations over them. Both the operational and xpoint semantics of t...
متن کاملReconstruction of paradigm shifts
There are many extensions of the basic attribute grammar formalism intended to improve its pragmatics, e.g. certain modularity concepts, remote access, object-orientation, templates, rule models and higher-order features. In the paper, a generic and formal approach to an effective and orthogonal reconstruction of the concepts underlying some extensions is described. The reconstruction is effect...
متن کامل