A. Hanson and Tarnlund, S- A. A natural programming calculus. In Proc. 6th IJCAI, pages 348--355, Tokyo, 1979. International Joint Conference on Artificial Intelligence.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....provides an interactive synthesis using the ideas of (Manna and Waldinger, 1980) showing the effectiveness of the calculus in interactive use, but again not attempting to automate the synthesis process. On the Logic Programming side, a calculus for the development logic programs was given in (Hanson and Tarnlund, S A. 1979), and used in (Eriksson, 1984) to synthesise a unification algorithm. The development there was done by hand, the proof involving thousands of proof steps. On the type theoretic side, the framework closest to what we propose can be found in (Constable and Howe, 1990) though here again the ....

Hanson, A. and Tarnlund, S- A. (1979). A natural programming calculus. In Proc. 6th IJCAI, pages 348--355, Tokyo. International Joint Conference on Artificial Intelligence.

....the specification. See [1, 2] for instance. A more direct approach is to give the specification in the form of a set of axioms, and then to systematically derive a set of clauses which are logical consequences of these axioms. We shall call this approach deductive synthesis. 1 Examples include [5, 6, 9]. In this paper, we shall concentrate on deductive synthesis of logic programs. Following Hogger [6, 7] we represent a (logical) specification, by the pair hS; Gi, where S is a set of closed first order axioms and G is a first order 1 Note that Manna and Waldinger [12] use this term for ....

A. Hansson and S.- A. Tarnlund. A natural programming calculus. In Proc. IJCAI-79, pages 348--355, 1979.

....given in the form of a set of axioms, and the synthesis process systematically derives a set of clauses which are logical consequences of these axioms. 1 Examples of deductive synthesis 1 Note that Manna and Waldinger [10] use deductive synthesis to mean proofs as programs. methods include [4, 5, 6]. In Section 2 we give an informal overview of our terminology and our proposed distinction. In Section 3 we summarise the formal terminology for our formal framework described in Section 4. Then we give a formalisation of deductive synthesis in Section 5, which provides a basis for our accounts ....

A. Hansson and S.- A. Tarnlund. A natural programming calculus. In Proc. IJCAI-79 , pages 348--355, 1979.

....sublist(X; Y ) subset(fXg; fY g) 4) in (3) A and B are sets, whereas in (4) X and Y are lists. In the isoinitial model of SET , subset and sublist have a unique interpretation each. If and only if specifications are the most widely used forms of specifications in logic program synthesis, e.g. [8, 4, 11, 16, 17]. In these papers, 4 various techniques are described for systematically deriving standard logic programs ( 8, 4, 11, 16] or constraint logic programs ( 17] However, it should be noted that in e.g. 8, 4, 11] there is no (explicit) use of frameworks, or model theoretic semantics of ....

....SET , subset and sublist have a unique interpretation each. If and only if specifications are the most widely used forms of specifications in logic program synthesis, e.g. 8, 4, 11, 16, 17] In these papers, 4 various techniques are described for systematically deriving standard logic programs ([8, 4, 11, 16]) or constraint logic programs ( 17] However, it should be noted that in e.g. 8, 4, 11] there is no (explicit) use of frameworks, or model theoretic semantics of if and only if specifications as described here. If and only if specifications do provide a starting point for program synthesis. ....

[Article contains additional citation context not shown here]

A. Hansson and S.- A. Tarnlund. A natural programming calculus. In Proc. IJCAI 79 , pages 348--355, 1979.

....wide variety of algorithms, including a large family of recursive sorting procedures. In this paper we describe the synthesis of this family of procedures. 1 Introduction Although much theoretical work has been done in logic program derivation, most notably by Clark, Hansson, Hogger, and Tarnlund [3, 4, 7, 9], there has been relatively little work in mechanising logic program synthesis. The recent work of Sato and Tamaki [15, 14] is one of the few examples. Independently, we worked on designing and implementing a practical system for mechanised program synthesis. The result is a method for top down ....

A. Hansson and S.- A. Tarnlund. A natural programming calculus. In Proc. IJCAI-79, pages 348--355, 1979.

....sublist by: sublist(X; Y ) fXg fY g (4) in (3) A and B are sets, whereas in (4) X and Y are lists. In the isoinitial model of SET , subset and sublist have a unique interpretation each. Iff specifications are the most widely used form of specifications in logic program synthesis, e.g. [9, 5, 12, 17, 18]. In these papers, 8 various techniques are described for systematically deriving standard logic programs ( 9, 5, 12, 8 More details of these, and related papers, can be found in [6] 17] or constraint logic programs ( 18] However, it should be noted that in e.g. 9, 5, 12] there is no ....

.... e.g. 9, 5, 12, 17, 18] In these papers, 8 various techniques are described for systematically deriving standard logic programs ( 9, 5, 12, 8 More details of these, and related papers, can be found in [6] 17] or constraint logic programs ( 18] However, it should be noted that in e.g. [9, 5, 12], there is no (explicit) use of frameworks, or of model theoretic semantics of iff specifications as described here, but they do make use of recursive iff specifications. Iff specifications provide a starting point for program synthesis. For example in SET it is easy to see how we can derive the ....

[Article contains additional citation context not shown here]

A. Hansson and S.- A. Tarnlund. A natural programming calculus. In Proc. IJCAI 79 , pages 348--355, 1979.

....framework for specifications, programs and program synthesis. It is small wonder that in the early days of logic programming, program synthesis was one of the first topics that received attention. Most notable among this early work is that of Clark [2] Hansson [4] Hogger [6] and Tarnlund [5]. Although Hansson and Tarnlund and their colleagues at Uppsala implemented a derivation editor, the early work was not particularly geared towards automated synthesis. For some reason, work on logic program synthesis dwindled considerably in the Eighties. However, at the beginning of the ....

A. Hansson and S.- A. Tarnlund. A natural programming calculus. In Proc. IJCAI-79 , pages 348--355, 1979.

....Paradigms in Logic Programming From the aforementioned major paradigms, the following four have been mainly used in logic programming. 1. Formal transformations: That is, formal specifications in first order logic are transformed into logic programs by correctness preserving transformations [16] [33], 38] 54] 2. Executable specifications: First order logic itself is appropriate for expressing specifications. Such specifications need only control to become executable [51] Logic languages which have been extended with some syntactic notation in order to become more readable are used for ....

....of bugs. The other approach is to prove that a program is correct with respect to its specification by formal reasoning. Given a specification there are two main approaches to proving the correctness of a program. That is, 1. Correctness is ensured during the construction of the program [20] [33], 38] 54] 67] 68] In this case a specification is successively refined into a program. The construction process consists either of smaller predefined development steps whose correctness has been proved or of equivalence preserving transformations. 2. The program is first constructed by ....

[Article contains additional citation context not shown here]

A. Hansson, S.- A. Tarnlund, A Natural Programming Calculus, Proceedings of the Sixth IJCAI, Tokyo, Aug. 1979, Vol.1, pp.348-355.

....arithmetic, PA for short, as a model for the deductive method. We shall often use PA in our framework below. Several developments of program synthesis have taken advantage of the deductive method, for example Manna and Waldinger [13] For logic programming, Hogger [8] Hansson and Tarnlund [7], and Lau and Prestwich [10] derived correct logic programs, while Clark and Tarnlund [5] developed a Peano like theory for logic programs. More recently, Lau and Ornaghi [11] formalised deductive synthesis of logic programs and gave an incompleteness result. Clark s idea of the completion of a ....

A. Hansson and S.- A. Tarnlund. A natural programming calculus. In Proc. IJCAI-79 , pages 348--355, 1979.

No context found.

A. Hanson and Tarnlund, S- A. A natural programming calculus. In Proc. 6th IJCAI, pages 348--355, Tokyo, 1979. International Joint Conference on Artificial Intelligence.

No context found.

A. Hansson and S.- A. Tarnlund. A natural programming calculus. In Proc. IJCAI-79, pages 348--355, 1979.

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