Add to ORKGAbstract In this thesis we look at mode analysis of logic programs. Being based on the mathematical formalism of predicate logic, logic programs have no a priori notion of data flow-- a single logic program may run in multiple modes where each mode describes, or prescribes, a pattern of data flow
In general, an n-ary predicate symbol defined by a normal logic program describes the relationship a...
In a previous paper we presented a high level polymorphic mode system for logic programs. In this pa...
In this paper we show, among other things, that logical structures such as di erence lists have a na...
Modes were introduced in logic programming to differentiate the input arguments of a predicate from ...
AbstractModes were introduced in logic programming to differentiate the input arguments of a predica...
This thesis deals with two themes: (1) construction of abstract domains for mode analysis of typed l...
This thesis deals with two themes: (1) construction of abstract domains for mode analysis of typed l...
There are many applications where precise mode analysis is required. However, within the framework o...
In general, an n-ary predicate (relation) describes the relationship among its arguments, and such t...
Abstract. We provide here a systematic comparative study of the relative strength and expressive pow...
Functional logic languages amalgamate functional and logic programming paradigms. They can be effici...
Precise mode information is important for compiler optimisations and in program development tools. W...
: A scheme is presented to enable the mode analysis of concurrent logic programs manipulating arrays...
The paper presents a novel approach to the analysis of typed logic programs. We assume regular type...
This article surveys various complexity and expressiveness results on different forms of logic progr...
In general, an n-ary predicate symbol defined by a normal logic program describes the relationship a...
In a previous paper we presented a high level polymorphic mode system for logic programs. In this pa...
In this paper we show, among other things, that logical structures such as di erence lists have a na...
Modes were introduced in logic programming to differentiate the input arguments of a predicate from ...
AbstractModes were introduced in logic programming to differentiate the input arguments of a predica...
This thesis deals with two themes: (1) construction of abstract domains for mode analysis of typed l...
This thesis deals with two themes: (1) construction of abstract domains for mode analysis of typed l...
There are many applications where precise mode analysis is required. However, within the framework o...
In general, an n-ary predicate (relation) describes the relationship among its arguments, and such t...
Abstract. We provide here a systematic comparative study of the relative strength and expressive pow...
Functional logic languages amalgamate functional and logic programming paradigms. They can be effici...
Precise mode information is important for compiler optimisations and in program development tools. W...
: A scheme is presented to enable the mode analysis of concurrent logic programs manipulating arrays...
The paper presents a novel approach to the analysis of typed logic programs. We assume regular type...
This article surveys various complexity and expressiveness results on different forms of logic progr...
In general, an n-ary predicate symbol defined by a normal logic program describes the relationship a...
In a previous paper we presented a high level polymorphic mode system for logic programs. In this pa...
In this paper we show, among other things, that logical structures such as di erence lists have a na...