7 citations found. Retrieving documents...
HILL Pat, A Parameterised Module System for Constructing Types Logic Programs, In Proceedings of IJCAI93 Thirteenth International Conference on Artificial Intelligence, vol.2, pp:874-880, Morgan Kaufmann, 1993.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Dynamic Composition of Parameterised Logic Modules - Brogi, Renso, Turini   (Correct)

....for combining de nite programs into a single, cooperating program expression. Important features such as context switching or the dynamic construction of program expressions are not supported. Another limitation is the lack of parameterisation of object level programs. As shown for instance in [4], allowing programs to be parameterised over the language symbols sensibly increases the programming (and meta programming) capabilities of a language. The objective of this work is exactly to extend the program composition approach so as to overcome the above mentioned limitations. We will ....

....and logic programming. The language provides a parameterised module system which o ers functionalities similar to those described in [22] The module system is however described in terms of EqLog rather than Prolog so that it is not directly applicable to logic programming languages. Hill [4] describes a typed parameterised module system for the logic programming language G odel [24] Modules can be parameterised w.r.t. predicate and function symbols, and predicate de nitions can be split over di erent modules. The semantics of modules is de ned via a program transformation that ....

[Article contains additional citation context not shown here]

P.M. Hill. A parameterised module system for constructing typed logic programs. In IJCAI, volume 2, pages 874-880, 1993.


Modules, Reuse and Correctness - Lau, Ornaghi   (Correct)

....it is necessary to view modules very abstractly as (logical) theories. It follows that declarative paradigms such as logic programming are well equipped to provide such an abstract semantics of modules, and to some extent, logic programming has succeeded in promulgating this approach (see e.g. [8, 2]) On the other hand, in our view, other approaches in logic programming which define modules as pieces of in line subtext of a program will always run into difficulty when it comes to reasoning about composition and correctness (see [4] for a survey on modularity in logic programming) In this ....

P.M. Hill. A parameterised module system for constructing typed logic programs. In R. Bajcsy, editor, Proc. 13th IJCAI , pages 874--880, Morgan-Kaufman, 1993.


A Module System for Meta-Programming - Hill (1994)   Self-citation (Hill)   (Correct)

....encapsulation, and separate compilation, Godel has a number of module conditions (see Section 3) These force a modular logic program to be represented in the meta program as a single module. Thus, the encapsulation and separate compilation of the object module are lost in the representation. In [7], we described a parametrised module system that extended the Godel module system which provided better facilities for defining abstract relations. In this paper, we focus on the application of this system for meta programming using the non ground representation. 2 Important issues for ....

....same (logic) programming language and hence be constructed by means of the same module system. Thus it is desirable that a programming language be able to represent its own module system. We will show in this paper, that the parametrised module system described here (and defined more formally in [7]) satisfies this requirement. Since the ideas in this paper are based on the Godel programming language, we give below a simple Godel program for readers not familiar with the language. This program defines a family and the relations between them 3 . Further examples illustrating the ideas of ....

[Article contains additional citation context not shown here]

P.M. Hill. A parameterised module system for constructing typed logic programs. In R. Bajcsy, editor, Proceedings of 13th International Joint Conference on Artificial Intelligence, Chamb'ery, France, pages 874--880. MorganKaufmann, 1993.


A Type Classes System for Logic Programming - Fernández   (Correct)

No context found.

HILL Pat, A Parameterised Module System for Constructing Types Logic Programs, In Proceedings of IJCAI93 Thirteenth International Conference on Artificial Intelligence, vol.2, pp:874-880, Morgan Kaufmann, 1993.


Towards a glass-box typed CLP language - Fernández   (Correct)

No context found.

HILL P., A Parameterised Module System for Constructing Types Logic Programs, In Proceedings of IJCAI93 Thirteenth International Conference on Artificial Intelligence, vol.2, pp:874-880, Morgan Kaufmann, 1993.


Towards a glass-box typed CLP language - Fernández   (Correct)

No context found.

HILL P., A Parameterised Module System for Constructing Types Logic Programs, In Proceedings of IJCAI93 Thirteenth International Conference on Artificial Intelligence, vol.2, pp:874-880, Morgan Kaufmann, 1993.


A Theory of Modules and its Implementation in SEQUEL 11.0 - Tarver (1995)   (Correct)

No context found.

Hill P. A Parameterised Module System for Constructing Typed Logic Programs, IJCAI 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC