,PLANKALK;L 8PLAN CALCULUS0 IS THE FIRST HIGH-LEVEL PROGRAMMING LANGUAGE EVER DESIGNED4 ,KONRAD ,ZUSE CONCEIVED IT BETWEEN #AIDB AND #AIDE1 WHILE THE MACHINES IT WAS MEANT FOR WERE BEING BUILT IN HIS LIVING ROOM AND THEN DESTROYED IN AIR RAIDS4 ,IT HAD TYPED VARIABLES1 ARRAYS1 STRUCTURED RECORDS1 CONDITIONALS1 LOOPS1 AND SUBROUTINES IN #AIDE1 TWELVE YEARS BEFORE ,,FORTRAN1 THIRTEEN BEFORE ,,ALGOL1 IN A NOTEBOOK IN A FARMHOUSE IN THE ,ALPS4 ,NOBODY COULD RUN IT4 ,ALMOST NOBODY COULD READ IT4 ,IT IS THE GREAT LOST DESIGN OF PROGRAMMING HISTORY4 ,THE FIRST HIGH-LEVEL PROGRAMMING LANGUAGE PREDATES THE FIRST STORED-PROGRAM COMPUTER4 ,PLANKALK;L WAS "9DESIGNED"9 IN #AIDE2 A WORKING IMPLEMENTATION HAD TO WAIT UNTIL AROUND "9"9#BJJJ"9"94 ,THE LANGUAGE WAITED FIFTY-FIVE YEARS FOR THE MACHINE4 ,WHAT IT WAS FOR ,ZUSE DID NOT SET OUT TO INVENT 8A PROGRAMMING LANGUAGE0 THE PHRASE DID NOT EXIST4 ,HE WANTED A CALCULUS3 A FORMAL SYSTEM FOR WRITING DOWN COMPUTATIONAL PLANS PRECISELY1 THE WAY CIVIL ENGINEERS WROTE DOWN STATICS4 ,THE ,PLANKALK;L WAS TO BE THE UNIVERSAL NOTATION FOR DESCRIBING ANYTHING A MACHINE MIGHT DO FROM ARITHMETIC TO LOGIC TO CHESS4 ,THE MANUSCRIPT1 WRITTEN LARGELY IN #AIDE WHILE ,ZUSE SHELTERED FROM THE COLLAPSING ,REICH IN THE ,ALLG;U VILLAGE OF ,HINTERSTEIN1 DESCRIBES A LANGUAGE THAT A #AIFJ;S COMPILER ENGINEER WOULD HAVE RECOGNIZED INSTANTLY AND THAT NO ONE IN #AIDE HAD THE CONCEPTUAL VOCABULARY TO UNDERSTAND4 ,WHAT IT ALREADY HAD ,THE LIST READS LIKE A SUMMARY OF A LANGUAGE FROM TWENTY YEARS LATER3 - ,TYPED DATA FROM SINGLE YES_/NO BITS UP TO INTEGERS1 FLOATING-POINT NUMBERS1 AND USER-DEFINED COMPOSITE STRUCTURES RECORDS1 IN MODERN TERMS - ,ARRAYS ARBITRARY-DIMENSION LISTS1 INDEXED BY SUB-VARIABLES - ,ASSIGNMENT AS A DISTINCT OPERATOR THE ,ERGIBT-,ZEICHEN1 THE 8YIELDS SIGN03 A "6 ;B ;C 8A PLUS ;B YIELDS ;C40 ,THE ARROW DISTINGUISHED ASSIGNING FROM EQUALING A SUBTLETY LANGUAGES WOULD SPEND DECADES GETTING RIGHT - ,CONDITIONAL PLANS GUARDED STATEMENTS3 EXECUTE THIS PLAN ONLY IF THE CONDITION HOLDS - ,ITERATION ,WIEDERHOLUNGSPLNE1 REPETITION PLANS3 BOUNDED AND CONDITIONAL LOOPS - ,SUBROUTINES NUMBERED PLANS THAT COULD TAKE INPUTS1 RETURN RESULTS1 AND BE COMPOSED INTO LARGER PLANS3 PROCEDURAL DECOMPOSITION1 BEFORE PROCEDURES EXISTED - ,FULL ,BOOLEAN AND PREDICATE LOGIC ,ZUSE'S COMPANION ,LOGISTIKKALK;L MEANT ,PLANKALK;L PROGRAMS COULD STATE AND REASON ABOUT LOGICAL CONDITIONS1 NOT JUST ARITHMETIC PROCESS A 8DESIGNED_*N#AIDB#DE0 PROCESS ;B 8UNPUBLISHED_*NFOR DECADES0 PROCESS ;C 8FULL TEXT_*N#AIGB0 PROCESS ;D 8FIRST WORKING_*NIMPLEMENTATION_*NC4 #BJJJ0 A -@> ;B -@> ;C -@> ;D ,THE NOTATION ..> ,PLANKALK;L WAS WRITTEN IN A TWO-DIMENSIONAL NOTATION EACH STATEMENT CARRIED UP TO FOUR STACKED LINES3 - THE MAIN LINE THE OPERATION ITSELF "<"61 1 THE YIELDS SIGN"> - ;,V THE VARIABLE INDEX " - ;,K THE COMPONENT INDEX " - ;,S THE STRUCTURE INDEX " ,SO A SINGLE 8LINE0 OF ,PLANKALK;L WAS REALLY A SMALL TABLE MACHINE-PRECISE1 BUT DEMANDING TO WRITE AND MORE DEMANDING TO READ4 ,THE NOTATION IS PART OF WHY CONTEMPORARIES WHO DID ENCOUNTER IT BOUNCED OFF3 ,ZUSE HAD INVENTED NOT JUST THE IDEAS BUT AN UNCOMPROMISING FORMALISM FOR EXPRESSING THEM1 OPTIMIZED FOR THE MACHINE'S PRECISION RATHER THAN THE READER'S MERCY4 ,IN LOOSE MODERNIZED FORM1 A ,PLANKALK;L PLAN FOR 8ADD TWO NUMBERS AND STORE THE RESULT0 READS LIKE .*,V#J "6 ,V#A ,Z#J.* OPERANDS ON THE LEFT1 THE YIELDS SIGN IN THE MIDDLE1 THE DESTINATION ON THE RIGHT4 ,UNDERNEATH1 THE ,V_/,K_/,S SUB-LINES PINNED DOWN EXACTLY "9WHICH"9 VARIABLES AND "9WHAT"9 STRUCTURES WERE MEANT4 ,THE ARROW POINTS THE WAY THE DATA FLOWS AN IDEA THAT SURVIVES IN EVERY .*"7.* AND .*3"7.* EVER WRITTEN4 ,CHESS THE FIRST COMPUTER GAME ,TO PROVE THE LANGUAGE COULD HANDLE MORE THAN ARITHMETIC1 ,ZUSE WROTE ,PLANKALK;L PLANS FOR CHESS POSITION EVALUATION AND MOVE GENERATION IN #AIDE4 ,IT IS WIDELY REGARDED AS THE FIRST DESIGN FOR A COMPUTER GAME PROGRAM3 YEARS BEFORE ,SHANNON'S FAMOUS #AIEJ PAPER AND BEFORE ,TURING AND ,CHAMPERNOWNE'S ,TUROCHAMP "<#AIDH">1 A HIDDEN MANUSCRIPT IN THE ,ALPS ALREADY CONTAINED THE IDEA THAT A MACHINE COULD PLAY4 ,WHY THE WORLD NEVER SAW IT ,PLANKALKL'S INVISIBILITY WAS OVERDETERMINED3 - ,NO MACHINE COULD RUN IT4 ,THE ,Z#C HAD #FD WORDS OF MEMORY2 ,PLANKALK;L ASSUMED A MACHINE THAT EXISTED ONLY AS A GOAL4 ,IT WAS WRITTEN FOR THE COMPUTERS OF THE FUTURE WHICH IS ANOTHER WAY OF SAYING IT DESCRIBED THEM4 - ,NOTHING EXISTED TO COMPILE IT4 ,A 8COMPILER0 AS A CONCEPT WAS STILL SEVEN YEARS AWAY ,HOPPER'S ,A-#J WAS #AIEB4 ,ZUSE WAS DESIGNING THE HIGH-LEVEL LANGUAGE BEFORE THE INDUSTRY HAD INVENTED THE JOB OF TRANSLATING IT4 - ,THE MANUSCRIPT STAYED A MANUSCRIPT4 ,A SHORT ABSTRACT WAS PUBLISHED IN #AIDH#DI2 THE FULL TEXT WAITED UNTIL #AIGB1 ISSUED AS A RESEARCH REPORT BY WHICH TIME ,,FORTRAN1 ,,COBOL1 ,,ALGOL1 AND ,,LISP HAD ALREADY HAPPENED WITHOUT IT4 - ,THE NOTATION WAS FORBIDDING4 ,THE PEOPLE BEST POSITIONED TO APPRECIATE IT THE DESIGNERS OF THE #AIEJ;S LANGUAGES NEVER STUDIED A TWO-DIMENSIONAL ,GERMAN FORMALISM THEY COULD BARELY OBTAIN1 LET ALONE PARSE4 ,SO DID IT MATTER8 ,DIRECTLY1 ALMOST NOT AT ALL AND THAT IS THE HONEST ANSWER4 ,,FORTRAN'S TEAM NEVER SAW IT2 ,,ALGOL'S COMMITTEE NEVER SAW IT4 ,PROGRAMMING LANGUAGES DO NOT INHERIT THROUGH UNPUBLISHED NOTEBOOKS4 ,BUT INDIRECTLY1 ,PLANKALK;L MATTERS ENORMOUSLY AS EVIDENCE4 ,IT PROVES THAT THE HIGH-LEVEL LANGUAGE WAS NOT AN ACCIDENT OF THE TRANSISTOR ERA3 TYPED STRUCTURES1 ASSIGNMENT1 CONTROL FLOW1 SUBROUTINES THE WHOLE GRAMMAR OF PROGRAMMING WAS WORKED OUT ONCE ALREADY1 IN #AIDE1 BY AN ENGINEER WHO HAD NEVER HEARD THE WORDS 8PROGRAMMING LANGUAGE40 ,WHEN COMPUTER HISTORIANS ,KNUTH AND ,PARDO SURVEYED THE FIELD'S ORIGINS IN #AIGF1 THEY GAVE ,PLANKALK;L ITS OWN CHAPTER2 WHEN A RESEARCH TEAM FINALLY BUILT A WORKING IMPLEMENTATION AROUND #BJJJ1 THE DESIGN REMARKABLY WORKED4 ,PLANKALK;L AND .<.<,ADA,LOGIC ,,BASIC.>.> ARE BOOKENDS OF THE SAME ARGUMENT3 "9"9NOTATION BELONGS TO EVERYONE4"9"9 ,ZUSE DESIGNED A LANGUAGE FOR MACHINES THAT DIDN'T EXIST2 ,,ALB IS A LANGUAGE FOR PEOPLE WHO'VE BEEN TOLD PROGRAMMING ISN'T FOR THEM4 ,EIGHTY YEARS APART1 THE BET IS THE SAME THAT WHAT YOU CAN "9WRITE DOWN PRECISELY"91 A MACHINE CAN "9DO"94 ,SEE ALSO - ,KONRAD ,ZUSE ,Z#C - ,,FORTRAN ,,ALGOL ,,COBOL ,,LISP THE LANGUAGES THAT ARRIVED LATER AND GOT THE CREDIT - ,,BASIC THE LANGUAGE THAT FINALLY MADE EVERYONE THE AUDIENCE - ,HISTORY OF ,PROGRAMMING ,ALAN ,TURING - ,HISTORY OF ,LANGUAGE THE OLDER STORY OF DESIGNED LANGUAGES ,REFERENCES #A4 ,ZUSE1 ,KONRAD4 ,THE ,COMPUTER ,MY ,LIFE "<,SPRINGER1 #AIIC1 TR4 OF ,DER ,COMPUTER ,MEIN ,LEBENSWERK1 #AIGJ_/#AIHD">4 #B4 ,ROJAS1 ,RA;L4 8,KONRAD ,ZUSE'S ,LEGACY3 ,THE ,ARCHITECTURE OF THE ,Z#A AND ,Z#C40 ,,IEEE ,ANNALS OF THE ,HISTORY OF ,COMPUTING #AI"<#B">1 #AIIG4 #C4 ,ROJAS1 ,RA;L1 AND ,ULF ,HASHAGEN1 EDS4 ,THE ,FIRST ,COMPUTERS3 ,HISTORY AND ,ARCHITECTURES "<,,MIT ,PRESS1 #BJJJ">4 #D4 ,BAUER1 ,FRIEDRICH ;,L41 AND ,HANS ;,WSSNER4 8,THE ',PLANKALKL' OF ,KONRAD ,ZUSE3 ,A ,FORERUNNER OF ,TODAY'S ,PROGRAMMING ,LANGUAGES40 ,COMMUNICATIONS OF THE ,,ACM #AE"<#G">1 #AIGB4