H. Schwichtenberg, H. Benl, U. Berger, M. Seisenberger, W. Zube, Proof theory at work: Program development in the Minlog system, in Automated Deduction, W. Bibel and P.H. Schmitt, eds., Vol. II, Kluwer 1998.

 Home/Search   Document Not in Database   Summary   Related Articles  

This paper is cited in the following contexts:
Grundlagenstreit in the Theory of Programming - Voda (2003)   (Correct)

....the programming comfort. The only feature which Trilogy uses in the implementation of CL, and CL does 3 not (yet) have is a provision (by intensional annotation of programs) for declarative in place modi cation of data structures. Another example of an ontologically minimal system is Minlog [11] which has the strength of PA . Minlog cannot be criticized from the logical point of view, after all it was designed by a logician. The only objection one can have against it is that it underestimates the pragmatical requirements laid on systems aspiring to be used in computer programming. ....

H. Schwichtenberg, H. Benl, U. Berger, M. Seisenberger, W. Zube, Proof theory at work: Program development in the Minlog system, in Automated Deduction, W. Bibel and P.H. Schmitt, eds., Vol. II, Kluwer 1998.

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