Patricia Hill and John Lloyd. The Goedel Programming Language. MIT Press, Cambridge, MA, 1994. ISBN 0-262-08229-2.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....checking Another use of assertions is as a means of expressing properties about the program which are checked at compile time, usually by means of program analysis. These properties should hold, i.e. otherwise a bug exists in the program. An example of this are type declarations (e.g. [14, 21], functional languages, etc. which have been shown to be useful in debugging. Generally, and in order to be able to check these properties at compile time, the expressible properties are restricted to a statically decidable set. Providing information to the optimizer Assertions have also been ....

P. Hill and J. Lloyd. The Goedel Programming Language. MIT Press, Cambridge MA, 1994.

.... scenarios) In this paper we concentrate our attention on the particular issue of program validation and debugging via direct static and or dynamic checking of user provided assertions [18,19,8,6,36,2] Classical examples of assertions are the type declarations used in languages such as Godel [30] or Mercury [42] and in traditional functional languages) But here, and encouraged by the capabilities of the currently available abstract interpreters, we depart in several ways from the traditional approaches. We start by recalling some classical definitions (see, e.g. 10] in program ....

....assertions have been used in order to replace the oracle by allowing the user expressing properties of the intended behaviour of the program [18,19,6] Assertions can also be used to express properties about the program to be checked at compile time. An example of this are type declarations (e.g. [30,42], functional languages, etc. which have been shown to be useful in debugging. Assertions have also been used to provide information to an optimizer in order to perform additional optimizations during code generation (e.g. 42] which also implements checking) Assertions have also been proposed ....

P. Hill and J. Lloyd. The Goedel Programming Language. MIT Press, Cambridge MA, 1994.

....checking Another use of assertions is as a means of expressing properties about the program which are checked at compile time, usually by means of program analysis. These properties should hold, i.e. otherwise a bug exists in the program. An example of this are type declarations (e.g. [14, 21], functional languages, etc. which have been shown to be useful in debugging. Generally, and in order to be able to check these properties at compile time, the expressible properties are restricted to a statically decidable set. Providing information to the optimizer Assertions have also been ....

P. Hill and J. Lloyd. The Goedel Programming Language. MIT Press, Cambridge MA, 1994.

....via direct static and or dynamic checking of user provided assertions. We assume that a (partial) speci cation is available with the program and written in terms of assertions [5, 4, 13, 14, 23, 25] Classical examples of assertions are the type declarations used in languages such as G odel [21] or Mercury [29] and in functional languages) However, herein we are interested in supporting a more general setting in which, on one hand assertions can be of a more general nature, including properties which are statically undecidable, and, on the other, only a small number of assertions may ....

P. Hill and J. Lloyd. The Goedel Programming Language. MIT Press, Cambridge MA, 1994.

....From: Integer List(Integer) From(n) n From(n 1) A goal of First(4,From(2) reduces to the answer [2, 3, 4, 5] I am not aware of a complete implementation for Escher. 2. Curry The functional logic language Curry is an attempt to combine the best ideas of existing declarative languages [11]. This section briefly discusses and compares the functional logic language Curry and lazy functional Goedel. The emphasis of this discussion is on aspects of the operational semantics and language features. In an attempt to combine features of many languages, Curry s operational semantics are ....

P. Hill, J.W. Lloyd. The Goedel Programming Language. MIT Press, 1993.

....Programmiertechnik, von uns Datenbank Programmierung genannt, die weiterer Untersuchungen bedarf. In der funktionalen Programmierung ist sie eine wohlverstandene Standardtechnik. Es ist zu bemerken, da Programmiersprachen der Logikprogrammierung hoherer Ordnung wie Prolog [MN86] und Goedel [HL94] Modulkonzepte bieten, die solch einen Programmierstil erleichtern und fordern. Was die Effizienz betrifft, erweist sich der Stil der Datenbank Programmierung (d.h. Anwendung von asserta und retract anstatt von Akkumulationslisten) fur nichttriviale Probleme als deutlich vorteilhafter. Experimente ....

....wenigstens weniger akut machen. Eine weiterer Nachteil von Prolog ist, da die Sprache kein Modulkonzept bietet. Moduln konnten das Programmieren im Stile von Programm 1 erleichtern und formal begrunden. Es ist bemerkenswert, da zwei neue Sprache der Logikprogrammierung Prolog [MN86] und Goedel [HL94], die die Metaprogrammierung unterstutzen, Moduln anbieten. Letztlich zeigt sich die Metaprogrammierung und die Behandlung von logischen Ausdrucke in Prolog in manchen Hinsichten ziemlich umstandlich, weil die Sprache freie und gebundene Variablen nicht unterscheidet. Im Gegenteil zu Prolog ....

Pat Hill and John Lloyd. The Goedel Programming Language. The MIT Press, 1994.

....the learner model (L2) kept by the system. In the example expand is a core maintenance function which performs a change operation (system change) in the learner model. The other operations (revision and update) are also used in the same way. Finally, TAGUS is implemented using Prolog and Godel [4] programming languages. Godel was used to take advantage of the metaprogramming facilities in the reasoning system. Prolog was used in conjunction with Godel in order to provide an interface to a user. 6 Conclusions Although until recently changes in learner models have been more or less ....

Patricia Hill and John Lloyd, The Goedel ProgrammingLanguage,The MIT Press, 1993.

.... In this paper we concentrate our attention on the particular issue of program validation and debugging via direct static and or dynamic checking of user provided assertions [17, 18, 8, 6, 30, 2] Classical examples of assertions are the type declarations used in languages such as Godel [24] or Mercury [36] and in functional languages) But here, and encouraged by the capabilities of the currently available abstract interpreters, we depart in several ways from the traditional approaches. We start by recalling some classical definitions (see, e.g. 10] in program validation and ....

....have been used in order to replace the oracle by allowing the user expressing properties of the intended behaviour of the program [17, 18, 6] Assertions can also be used to express properties about the program to be checked at compiletime. An example of this are type declarations (e.g. [24, 36], functional languages, etc. which have been shown to be useful in debugging. Assertions have also been used to provide information to an optimizer in order to perform additional optimizations during code generation (e.g. 36] which also implements checking) Assertions have also been proposed ....

P. Hill and J. Lloyd. The Goedel Programming Language. MIT Press, Cambridge MA, 1994.

....different formula to be proved. Because the programmer can concentrate more on what to solve and not how to solve a problem, logic programming languages are called declarative languages. Several research groups have been concentrating on fi nding other more powerful logic languages such as G odel [70], Escher [87] Multi Prolog [12] languages based on equation relational sets [77] languages based on temporal and modal logics, concurrent constraintbased languages [104] higher order languages, and so forth. However Prolog is the simplest and most effi cient logic programming language ....

P. M. H ill and J. W. Lloyd. The Goedel Programming Language. MITPress, Logic Programming Series, 1994.

....debugging via direct static and or dynamic checking of user provided assertions. We assume that a (partial) specification is available with the program and written in terms of assertions [5, 4, 12, 13, 22] Classical examples of assertions are the type declarations used in languages such as Godel [18] or Mercury [25] and in functional languages) However, herein we are interested in supporting a more general setting in which, on one hand assertions can be of a more general nature, including properties which are statically undecidable, and, on the other, only a small number of assertions may ....

P. Hill and J. Lloyd. The Goedel Programming Language. MIT Press, Cambridge MA, 1994.

....w.r.t. Q. Note that the situation of weak correctness requirements presented above is equivalent to having an incomplete but correct program which presents a correctness error using conditions of Table 2 (or vice versa) However, the experience with type checking of logic programs (see, e.g. [1,15]) shows that failure in proving local validation conditions for a clause is often a good indication that the clause is erroneous. 3.3 Declarative Diagnosis In contrast to diagnosis by proof, declarative diagnosis concerns the case when a particular (test) computation does not satisfy a ....

P. Hill and J. Lloyd. The Goedel Programming Language. MIT Press, Cambridge MA, 1994.

No context found.

Patricia Hill and John Lloyd. The Goedel Programming Language. MIT Press, Cambridge, MA, 1994. ISBN 0-262-08229-2.

No context found.

18 P. Hill and J. Lloyd. The Goedel Programming Language. MIT Press, Cambridge MA, 1994.

No context found.

P. Hill and J. Lloyd. The Goedel Programming Language. MIT Press, Cambridge MA, 1994.

No context found.

P. Hill and J. Lloyd. The Goedel Programming Language. MIT Press, 1994.

No context found.

P. Hill and J. Lloyd. The Goedel Programming Language. MIT Press, Cambridge MA, 1994.

No context found.

P. Hill and J. Lloyd. The Goedel Programming Language. MIT Press, Cambridge MA, 1994.

No context found.

P. Hill and J. Lloyd. The Goedel Programming Language. MIT Press, Cambridge MA, 1994.

No context found.

P. Hill and J. Lloyd. The Goedel Programming Language. MIT Press, Cambridge MA, 1994.

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