Bohm, C. and Jacopini, G. (1966), "Flow Diagrams, Turing Machines and Languages with only Two Formation Rules," Communications of the ACM, 9(5), 366-371.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....2. solve( Goalj L1] Goalj L3] L1jList of Rules] solve(L3, append( Lapp1,Lapp1)j L] L, append( XjLapp2] Lapp3, Xj Lapp4] append(Lapp2,Lapp3,Lapp4)jLL] LL] 3. solve(List of Goals, RulejList of Rules] solve(List of Goals,List of Rules) For the initial goal append( 1] [2,3],L) the corresponding goal in the meta program will be : solve( append( 1] 2,3] L1) append( Lapp1,Lapp1)jL] L, append( Xj Lapp2] Lapp3, XjLapp4] append(Lapp2,Lapp3,Lapp4)jLL] LL] Pi For the encoding of an arbitrary program Pi , both the first binary clause and the goal ....

....L] L, append( XjLapp2] Lapp3, Xj Lapp4] append(Lapp2,Lapp3,Lapp4)jLL] LL] 3. solve(List of Goals, RulejList of Rules] solve(List of Goals,List of Rules) For the initial goal append( 1] 2,3] L) the corresponding goal in the meta program will be : solve( append( 1] [2,3],L1) append( Lapp1,Lapp1)jL] L, append( Xj Lapp2] Lapp3, XjLapp4] append(Lapp2,Lapp3,Lapp4)jLL] LL] Pi For the encoding of an arbitrary program Pi , both the first binary clause and the goal have to be adapted in an appropriate way. Now, assume that Pi is a meta interpreter. ....

[Article contains additional citation context not shown here]

Bohm C., Jacopini G. "Flow diagrams, Turing machines and languages with only two formation rules." Communications of the ACM, Vol.9, pp. 366--371. 1966.

.... the halting and emptiness problems and a lot of other properties (boudedness, Recently, using this codification (and some other results) we have proved that the append like programs have the same computational power as Turing machines [8] This result can be seen as the Bohm Jacopini [1] theorem to Logic Programming. Endly, our problem seems to be closed to implication of clause. Considering the program : 8 : p(fact) p(lef t) p(right 1 ) p(right 2 ) p(goal) where fact and goal are ground. The existence of solutions for this program is equivalent to the ....

Bohm C., Jacopini G. "Flow diagrams, Turing machines and languages with only two formation rules." Communications of the Association for Computing Machinery, Vol.9, pp. 366--371. 1966.

.... DFKI, Stuhlsatzenhausweg 3, 66123 Saarbrucken 11, Germany wuertz dfki.uni sb.de Topics : Logic in Computer Science, Theory of Programming Languages. Abstract. This paper proposes an equivalent form of the famous BohmJacopini theorem for declarative languages. C. Bohm and G. Jacopini [1] proved that all programming can be done with at most one single whiledo. That result is cited as a mathematical justification for structured programming. A similar result can be shown for declarative programming. Indeed the simplest class of recursive programs in Horn clause languages can be ....

....this theorem is that, as Lewis conjuctered in 1973, the consistency of the class of formulas containing 4 subformulas is undecidable too, even for conjuctive formulas of Horn clauses with prefixes of the form 8 Delta Delta Delta 8. The second consequence is that like in imperative languages [1], the simplest non trivial program scheme can express any partial recursive function. Like in the Bohm Jacopini proof, the transformation can be done automatically. A meta interpretation of the academic append predicate has been implemented and its space complexity was so important that it can ....

Bohm C., Jacopini G. "Flow diagrams, Turing machines and languages with only two formation rules." Communications of the Association for Computing Machinery, Vol.9, pp. 366--371. 1966.

.... [Jackson,75] and Warnier Orr [Warnier,76] Jackson s Structured Programming (JSP) provides a structuring framework where all processing is reduced to one of three basic control structures: a sequence, an iteration, and aselection which have been shown to be capable of modelling any complex system [Bohm,66] Data driven design has been successfully applied to many complex projects, and in particular to data processing and information management systems where a direct relationship existed between the inputs and outputs of the system. Jackson s method acceptance was further enhanced with the release ....

Bohm, C. and Jacopini, G., "Flow Diagrams, Turing Machines and Language with only Two Formation Rules," Communications of the ACM, 9(5), pp. 366-371, (May 1966).

....of statements that lie on a same dynamic path of the procedure) The horizontal isolation may be founded on primes [8, 60] and assumes the original procedure to be structured. Although methodologies and tools are available for restructuring software with respect to a set of one in one out primes [6, 14, 36, 111], very often horizontal decomposition is not suitable for isolating functions because of the interleaving of code fragments responsible for accomplishing more than one purpose in the same section [118] This can arise either intentionally (for example, in optimising a program, a programmer may use ....

C. Bohm and G. Jacopini, "Flow diagrams, Turing machines and languages with only two formation rules", Communications of the ACM, vol. 9, 1966, pp. 366-371.

....by J.H. Conway within number theory. Let us note that these new undecidability results are proved w.r.t. any type of resolution (bottom up or top down, depth first or breadth first, unification with or without occur check) 1 Introduction For imperative languages, C. Bohm and G. Jacopini [BJ66] proved that all programming can be done with at most one while loop. A corollary was that the control structures goto and while have the same expressive power. For term rewriting system (using pattern matching) Max Dauchet [Dau92] proved that it is possible with only one left linear rewriting ....

.... has been obtained using quasi iterative programs (that is, each clause contains at most one occurrence of a recursive predicate) GM87] For Horn Clause languages, it has been established that all programming can be done with one recursive clause and three facts [PDL91] The proof, like that of [BJ66], is simple and direct, that is, by an immediate translation of any Horn clause program directly into such a Horn clause program verifying the above form. The right linear binary clauses, p(t) p(tt) may induce infinite computation that W. Bibel, S. Holldobler and J. Wurtz [BHW92] call cycle ....

Bohm C., Jacopini G. "Flow diagrams, Turing machines and languages with only two formation rules." Communications of the Association for Computing Machinery, Vol.9, pp. 366--371. 1966.

No context found.

Bohm, C. and Jacopini, G. (1966), "Flow Diagrams, Turing Machines and Languages with only Two Formation Rules," Communications of the ACM, 9(5), 366-371.

No context found.

C. Bohm, G. Jacopini, "Flow diagrams, Turing machines and languages with only two formation rules", Communications of the ACM, 1966

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