U. Reddy. A typed foundation for directional logic programming. In Proc. of the workshop on the Extensions of Logic Programming, Bologna, Italy, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....in [Barendregt 92] in constructing a tree which will have at its top. All the other systems have been shown to have useful applications related to natural and programming languages. Parsons 79] for example, presents a polymorphic system which can accommodate self referential terms. Reddy 93] presents a system based on linear logic but which attempts to add logical features to functional programming. Chierchia, Turner 88] presents a type free theory and interprets a fragment of English in it. Kamareddine 92b] provides powerful tools for the formalisation of quantifiers and ....

Reddy, U., A Typed Foundation for Directional Logic Programming, Departmental research report No FP-93-2b, Computing Sc, Glasgow University, 1993.

....follow the line of Barendregt in [3] in constructing a tree which will have at its top. All the other systems have been shown to have useful applications related to natural and programming languages. 36] for example, presents a polymorphic system which can accommodate self referential terms. [37] presents a system based on linear logic but which attempts to add logical features to functional programming. 6] presents a type free theory and interprets a fragment of English in it. 15] provides powerful tools for the formalisation of quantifiers and determiners, whereas [14] extends ....

Reddy, U., A Typed Foundation for Directional Logic Programming, Departmental research report No FP-93-2b, Computing Sc, Glasgow University, 1993.

....programming language [13] This system, however, lacked exibility and precision (some improvements have been proposed for example in [11] As a practical consequence many program errors were not detected. Another approach due to Aiken and Lakshman is based on the notion of a directional type [5, 1, 4, 3, 18] which distinguished input and output types of a predicate. This system is much more precise, it captures both procedural and declarative properties of logic programs, provides a good facility to describing data ow in a program but its usefulness is limited by the lack of polymorphism. Moreover, ....

U. S. Reddy. A typed foundation for directional logic programming. In E. Lamma and P. Mello, editors, Extensions of Logic Programming, LNAI, volume 660, pages 282318. Springer Verlag, 1993.

....paradigm, which gives the background for this paper. Here we find developments such as: logical accounts of the controversial negation as failure inference rule of logic programming [16, 29] and of control aspects of sequential logic programs [32] type and mode inference in logic programs [44]; logical encodings of process calculi formalisms [41] declarative reconstructions of concurrent computational models, such as Linda tuple spaces [26] the Chemical Abstract Machine [9] Actors [2, 48] production systems [14] group communication of the broadcasting and multicasting kind [11] ....

U. Reddy. A typed foundation for directional logic programming. In Proc. of the workshop on the Extensions of Logic Programming, Bologna, Italy, 1992.

....in [Barendregt 92] in constructing a tree which will have T Omega at its top. All the other systems have been shown to have useful applications related to natural and programming languages. Parsons 79] for example, presents a polymorphic system which can accommodate self referential terms. Reddy 93] presents a system based on linear logic but which attempts to add logical features to functional programming. Chierchia, Turner 88] presents a type free theory and interprets a fragment of English in it. Kamareddine 92b] provides powerful tools for the formalisation of quantifiers and ....

Reddy, U., A Typed Foundation for Directional Logic Programming, Departmental research report No FP-93-2b, Computing Sc, Glasgow University, 1993.

....the line of Barendregt in [3] in constructing a tree which will have T Omega at its top. All the other systems have been shown to have useful applications related to natural and programming languages. 36] for example, presents a polymorphic system which can accommodate self referential terms. [37] presents a system based on linear logic but which attempts to add logical features to functional programming. 1. FULL EXPRESSIVENESS AND LOGIC 293 [6] presents a type free theory and interprets a fragment of English in it. 15] provides powerful tools for the formalisation of quantifiers and ....

Reddy, U., A Typed Foundation for Directional Logic Programming, Departmental research report No FP-93-2b, Computing Sc, Glasgow University, 1993.

....with other ideas in functional programming. The value demand duality connects with much work on representing and computing demands, such as the use of projections [WH87] The yielder acceptor duality connects with the use of single assignment as in Id [ANP89] or the use of logical variables [Red93]. 1.1 Organisation The remainder of this note is organised as follows: In Section 2, an abstract datatype for arrows is introduced, together with the composition operation. Section 3 de nes tensor product and its usual symmetry and associativity operations. In order to show some interesting ....

U. S. Reddy. A typed foundation for directional logic programming. In E. Lamma and P. Mello, editors, Third International Workshop on Extensions of logic programming, pages 150167, Bologna, Italy, 1993. SpringerVerlag LNAI 660.

....by an example of an execution model where unification is controlled by directional types, and where our new well typing condition is applied to show the absence of deadlock. 1. INTRODUCTION Recently there has been a growing interest in the notion of directional types for logic programs [1, 5, 7, 12, 13, 14, 39, 40, 44]. A directional type describes the intended ways of calling the program, as well as the user s intuition of how the program behaves when called as prescribed. Together with some methods and tools for type checking, directional types may provide a good support for program validation. This article ....

U.S. Reddy. A typed foundation for directional logic programming. In E. Lamma and P. Mello (eds.) Extensions of logic programming . LNAI 660, pp. 282--318. Springer Verlag, Berlin, 1992.

.... models were discussed by Lafont [12] and Holstrom [10] Abramsky wrote a highly influential paper that explored computing applications of both intuitionistic and classical linear logic [1] Other models have been discussed by Chirimar, Gunter, and Riecke [3] Lincoln and Mitchell [13] Reddy [16], and Wadler [21, 22] The particular formulation of linear logic presented here is based on Girard s Logic of Unity, a refinement of linear logic [7] This overcomes some technical problems with other presentations of linear logic, some of which are discussed by Benton, Bierman, de Paiva, and ....

U. S. Reddy, A typed foundation for directional logic programming. In E. Lamma and P. Mello, editors, Extensions of logic programming, Lecture Notes in Artificial Intelligence 660, Springer-Verlag, 1993.

....has also shown promise in helping with the analysis of conventional logic programs. See, for example, the work of Cerrito on specifying the semantics of various aspects of Prolog using linear logic [Cerrito 1990, Cerrito 1992b, Cerrito 1992a] and of Reddy in specifying modes using linear logic [Reddy 1993]. The most active work on using linear logic in logic programming, however, has been in the area of designing and using new logic programming languages. 3 New Logic Programming Languages In the field of logic programming there does not seem to be a principle, like that of the Curry Howard ....

U. S. Reddy. A typed foundation for directional logic programming. In E. Lamma and P. Mello, editors, Third International Workshop on Extensions of logic programming, pages 150-167, Bologna, Italy, 1993. Springer-Verlag LNAI 660.

....syntax and semantic judgments of many object languages This work was supported by NSF Grant CCR 930383 in a concise and natural manner. The presence of these features presents a challenge, but also provides an opportunity. The challenge is to extend previous work on modes (see, e.g. [10, 4, 7, 25, 27]) and termination (see, e.g. 24, 1] to deal with types and higher order constraint simplification. On the other hand it turns out that we can take advantage of the already very expressive underlying type structure in our analysis. In order to concentrate our effort on higher order terms and ....

....of i 9Pk Gamma 9P=P ;9P ; P 2 cp (lam x:x) lam y:y) j initial Delta 0 ; results in Delta 0 j ; j 9 (cplam (x:x) y:y) x:D:D) P , and j . 3 Mode Analysis Modes. Modes have been proposed for expressing aspects of the operational semantics of logic programs (see, e.g. [7, 25, 27]) The simplest and most useful modes declare the input and output arguments of a predicate. The input arguments to a predicate should be ground when it is called. Upon successful return, the output arguments should be ground. This is often strengthened by requiring the output arguments to a ....

[Article contains additional citation context not shown here]

Uday S. Reddy. A typed foundation for directional logic programming. In E. Lamma and P. Mello, editors, Proceedings of the Third International Workshop on Extensions of Logic Programming, pages 282--318, Bologna, Italy, February 1992. Springer-Verlag LNAI 660.

No context found.

U. Reddy. A typed foundation for directional logic programming. In Proc. of the workshop on the Extensions of Logic Programming, Bologna, Italy, 1992.

No context found.

U. S. Reddy, A typed foundation for directional logic programming. In E. Lamma and P. Mello, editors, Extensions of logic programming, Lecture Notes in Artificial Intelligence 660, Springer-Verlag, 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