|
Plankalkül ((:ˈplaːnkalkyːl), "Plan Calculus") is a programming language designed for engineering purposes by Konrad Zuse between 1943 and 1945. It was the first high-level non-von Neumann programming language to be designed for a computer. Also, notes survive with scribblings about such a plan calculation dating back to 1941. Plankalkül was not published at that time owing to a combination of factors such as conditions in wartime and postwar Germany and his efforts to commercialise the Z3 computer and its successors. In 1944 Zuse met with the German logician and philosopher Heinrich Scholz and they discussed Zuse's Plankalkül. In March 1945 Scholz personally expressed his deep appreciation for Zuse's utilization of the logical calculus.〔Hartmut Petzold,''Moderne Rechenkünstler. Die Industrialisierung der Rechentechnik in Deutschland''. München. C.H. Beck Verlag 1992〕 By 1946, Zuse had written a book on the subject〔((full text of the 1945 manuscript) )〕 but this remained unpublished. In 1948 Zuse published a paper about the Plankalkül in the "Archiv der Mathematik" but still did not attract much feedback – for a long time to come programming a computer would only be thought of as programming with machine code. The Plankalkül was eventually more comprehensively published in 1972 and the first compiler for it was implemented in 1975 in a dissertation by Joachim Hohmann.〔Joachim Hohmann: Der Plankalkül im Vergleich mit algorithmischen Sprachen. Reihe Informatik und Operations Research, S. Toeche-Mittler Verlag, Darmstadt 1979, ISBN 3-87820-028-5.〕 Other independent implementations followed in 1998 and then in 2000 by the Free University of Berlin. "''Kalkül''" means formal system – the Hilbert-style deduction system is for example originally called "''Hilbert-Kalkül''", so Plankalkül means "formal system for planning". ==Description== Plankalkül has drawn comparisons to APL and relational algebra. It includes assignment statements, subroutines, conditional statements, iteration, floating point arithmetic, arrays, hierarchical record structures, assertions, exception handling, and other advanced features such as goal-directed execution. The Plankalkül provides a data structure called ''general graph'' (''verallgemeinerter Graph''), which can be used to represent geometrical structures.〔Prof. Wolfgang Giloi: Konrad Zuses Plankalkül als Vorläufer moderner Programmiermodelle, November 1990〕 Plankalkül shared an idiosyncratic notation using multiple lines with Frege's ''Begriffsschrift'' of 1879 (dealing with mathematical logic). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Plankalkül」の詳細全文を読む スポンサード リンク
|