We discuss the application of heterogeneous metaprogramming (MPG) for the interfacebased design, which deals with the synthesis of the communication interfaces between Intellectual Property components (IPs). Heterogeneous MPG is based on the simultaneous usage of a domain language for describing domain functionality and a metalanguage for developing generic components and program generators. We...

We establish that regularly extended two-way nondeterministic tree automata with unranked alphabets have the same expressive power as regularly extended nondeterministic tree automata with unranked alphabets. We obtain this result by establishing regularly extended versions of a congruence on trees and of a congruence on, so called, views. Our motivation for the study of these tree models is th...

λProlog is known to be well-suited for expressing and implementing logics and inference systems. We show that lemmas and definitions in such logics can be implemented with a great economy of expression. We encode a higher-order logic using an encoding that maps both terms and types of the object logic (higher-order logic) to terms of the metalanguage (λProlog). We discuss both the Terzo and Tey...

We describe the core of a new strongly-typed functional programming language called LEAP, a \Language with Eval And Polymorphism." Pure LEAP is an extension of the !-order polymorphic -calculus (F ! ) by global de nitions that allows the representation of programs and the de nition of versions of reify, reflect, and eval for all of F ! . Pure LEAP is therefore highly re exive and strongly typed...

Plotkin has advocated the combination of linear lambda calculus, polymorphism and fixed point recursion as an expressive semantic metalanguage. We study its expressive power from an operational point of view. We show that the naturally call-by-value operators of linear lambda calculus can be given a call-by-name semantics without affecting termination at exponential types and hence without affe...

In this paper we argue that there is suucient experience with C++ to justify the development of a tool that examines C++ programs for the presence of likely programmer errors, and we describe a number of common mistakes that could be detected by such a tool. We show that such a tool would be both straightforward to develop and eecient to apply. We also discuss how such a tool could be extended ...

Compile-time reeective ML (CRML) is an extension to Standard ML providing a metalanguage for program manipulationn10]. The original motivation was the automatic generation of map and fold like combinators for arbitrary datatypess4, 9]. The mechanisms developed to achieve this are far more general than we at rst realized, providing the foundation for a rich class of language extensions expressed...

We establish that regularly extended two-way nondeterministic tree automata with un-ranked alphabets have the same expressive power as regularly extended nondeterministic tree automata with unranked alphabets. We obtain this result by establishing regularly extended versions of a congruence on trees and of a congruence on, so called, views. Our motivation for the study of these tree models is t...

0. To formulate a semantic theory of modal logic it is not sufficient to define for example, the necessary as that which is true in every model and the possible as that which is true in some model. These definitions would do no more than introduce the notions of ‘necessary’ and ‘possible’ in the metalanguage. A semantics of modal logic demands that we assume an object language containing modal ...