Abstract not found

Abstract not found

This paper introduces the Aster distributed configuration -based programming system that is aimed at easing the development of emerging distributed applications having quality of service requirements. Our approach is based on high-level customization: given the specification of application requirements using the Aster interconnection language, a distributed runtime system, customized for meeting these requirements is built. So as to make the customization process sound, we propose a formal method that allows to reason about specification matching of a customized distributed runtime system with the application's requirements. 1 Introduction Progress in processor and network technology leads to an evolution of distributed computing systems: they are now eligible for supporting a wide class of applications, ranging from online multimedia services to massively parallel applications. However, for this use of computing systems to become effective, open issues relevant to the programming sys...

Abstract not found

Abstract not found

We describe a proof plan that characterises a family of proofs corresponding to the synthesis of recursive functional programs. This plan provides a significant degree of automation in the construction of recursive programs from specifications, together with correctness proofs. This plan makes use of meta-variables to allow successive refinement of the identity of unknowns, and so allows the program and the proof to be developed hand in hand. We illustrate the plan with parts of a substantial example --- the synthesis of a unification algorithm.

We propose a new implementation of logic programming with higher-order terms. In order to illustrate the properties of our implementation, we apply the coding of lists as functions to the context of logic programming. As a side-effect, we show that higher-order unification is a good tool for manipulating the function-lists. It appears that the efficiency of the program thus obtained relies critically upon the implementation of higher-order operations (unification and reduction). In particular, we show that a good choice for data-structures and reduction strategy yields a linear naive reverse. 1 Introduction The extension of Prolog to higher-order terms has been proposed by Miller and Nadathur[6]. The prototypal system is Prolog, of which we know two implementations: a Prolog based implementation and a Lisp based one. The first one was intended for experimental use and is very inefficient. We shall only refer to the Lisp based implementation. We propose another implementation in which ...

In this review of metaprogramming in logic we pay equal attention to theoretical and practical issues: the contents range from mathematical and logical preliminaries to implementation and applications in, e.g., software engineering and knowledge representation. The area is one in rapid development but we have emphasized such issues that are likely to be important for future metaprogramming languages and methodologies. 1 Introduction The term `metaprogramming' relates to `programming' as `metalanguage' relates to `language' and `metalogic' to `logic': programming where the data represent programs. It should be no surprise that metaprogramming with logic programming languages takes advantage of many results from metalogic. In the most general interpretation we would say that `metaprogramming ' refers to any kind of computer programming where the input or output represents programs. We will refer to a program of this kind as a metaprogram and to its data as object programs. Analogousl...

Contents 1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 2 The expressive power of second order Logic : : : : : : : : : : : 3 2.1 The language of second order logic : : : : : : : : : : : : : 3 2.2 Expressing size : : : : : : : : : : : : : : : : : : : : : : : : 4 2.3 Defining data types : : : : : : : : : : : : : : : : : : : : : 6 2.4 Describing processes : : : : : : : : : : : : : : : : : : : : : 8 2.5 Expressing convergence using second order validity : : : : : : : : : : : : : : : : : : : : : : : : : 9 2.6 Truth definitions: the analytical hierarchy : : : : : : : : 10 2.7 Inductive definitions : : : : : : : : : : : : : : : : : : : : : 13 3 Canonical semantics of higher order logic : : : : : : : : : : : : 15 3.1 Tarskian semantics of second order logic : : : : : : : : : 15 3.2 Function and re

An embedding of the implicational propositional intuitionistic logic (iil) into the nonmodal fragment of intuitionistic linear logic (imall) is given. The embedding preserves cut-free proofs in a proof system that is a variant of iil. The embedding is efficient and provides an alternative proof of the pspace-hardness of imall. It exploits several proof-theoretic properties of intuitionistic implication that analyze the use of resources in iil proofs. Linear logic is a refinement of classical and intuitionistic logic that provides an intrinsic and natural accounting of resources. In Girard's words [12], "linear logic is a logic behind logic." A convenient way to present linear logic is by modifying the traditional Gentzen-style sequent calculus axiomatization of classical logic (see, e.g., [15, 22]). The modification may be briefly described in three steps. The first step is to remove two structural rules, contraction and weakening, which manipulate the use of hypotheses and conclusi...