From My Life

Total Page:16

File Type:pdf, Size:1020Kb

From My Life Edsger W. Dijkstra Written b ecause p eople ask me for these data. Professor Edsger W. Dijkstra 1930 worked for 10 years as programmer at the Math- ematical Centre in Amsterdam, for 11 years as Full Professor of Mathematics at the Eindhoven Institute of Technology, for 11 years as ResearchFellow of Burroughs Cor- p oration, and now|i.e., 1997|for 13 years as Professor of Computer Sciences at the UniversityofTexas at Austin. Professor Dijkstra has done pioneering work in graph algorithms, programming lan- guage implementation, op erating systems, semantic theories and programming metho d- ology in the broadest sense of the word, and has invented a numb er of seminal prob- lems mutual exclusion, dining philosophers, distributed termination detection, and self-stabilization. His currentinterests fo cus on the formal derivation of pro ofs and programs, and the streamlining of the mathematical argument in general. From my Life I was the third of for children. My father was an excellent chemist, who worked in the town of Rotterdam, rst as a teacher of chemistry at a secondary scho ol, later as its sup erintendent. His knowledge was vast and he was p erfectly able and willing to teach cosmographyor physics when needed. He made a few inventions, one of which really sophisticated. Among chemists all over the country he was well-known|he had, for instance, b een President of the Dutch Chemical So ciety|but steadfastly refused all forms of scienti c promotion, ex- plaining that he would rather b e the rst among the counts than the last among the dukes, but the net e ect of adhering to this lofty principle was that he lost the colleagues that were intellectually his equals to the university campus. In the From my Life 87 vague idealism after WWI I, Dutch secondary education deteriorated to suchan extent that he forbade me to b ecome a scho olteacher. My mother was a brilliant mathematician who had no job|as was customary in those days, even for most women with a college degree. Her mind was much less encyclopaedic than that of my father but very quick; she had a great agility in manipulating formulae andawonderful gift for nding very elegant solutions, and I learned a lot from her though she had not the patience to b e a go o d teacher. During the last class of the Gymnasium|that was 1947/48|I considered going to University to study law, as I hop ed to represent my country in the United Nations. Then we did our nal exams. Before we got our grades and were told whether we had passed, I was very depressed, for I reviewed all the mistakes and stupidities I had committed and I got convinced that I would fail. My consolation was the conviction that I would get a second chance, always having b een the b est pupil in the class. My grades turned out to b e b etter than most teachers had ever seen at a nal examination, and older and wiser p eople convinced me that it was safer to base mychoice on ability than on idealism, and that it would b e a pity if I did not devote myself to science. So I wentto Leyden University to study mathematics and physics during the rst years, and theoretical physics during the latter part. On the whole I enjoyed the years a the universityvery much. Wewere very p o or, worked very hard, never slept enough and often did not eat enough, but life was incredibly exciting. Now, more than 40 years later, I still remember the rst \international" piano recital I attended: Clara Haskil playing Mozart! Another thing I rememb er|b ecause it surprised me|was that a number of my professors|Klo osterman, Haantjes, Gorter, Kramers|to ok me seriously. My father, who was a subscrib er to \Nature", had seen the announcementof a three-week course in Cambridge on programming for an electronic computer for the EDSAC, to b e precise, and when I had passed the midway exam b efore the end of my third year|whichwas relatively early|he o ered me bywayof reward the opp ortunity to attend that course. I thought it a go o d idea, b ecause I intended to b ecome an excellent theoretical physicist and I felt that in my e ort to reach that goal, the ability to use an electronic computer might come in handy. The course was in Septemb er 1951; by accident, A. van Wijngaarden, then Director of the Computation Departmentof the Mathematical Centre in Amsterdam, heard of my plans, invited me for a visit, and o ered me a job. Due to obligations in Leyden I could accept that invitation only in March 1952, when I b ecame the rst Dutchman with on the payroll the quali cation \programmer". Professor H.A. Kramers, who had accepted me as student of theoretical physics, died, I did not like his successor, and for a while I considered continuing my studies in Utrecht, but it turned out that the lab oratory work I would have to do in Utrechtwas incompatible with my half time job at the Mathematical Centre. That was the moment I had to cho ose b etween theoretical physics and computing; I chose the latter and my study of physics in Leyden b ecame a formality. I got my degree in the Spring of 1956, moved immediately from Leyden 88 Dijkstra to Amsterdam, and from that momentonI worked full time at the Mathematical Centre. My closest collab orators there were Bram J. Lo opstra and Carel S. Scholten, who had b een hired while they were still students of exp erimental physics at the Municipal University of Amsterdam to build a computer for the mathematical Centre. They were ab out ve years older than I, had b een close friends since the age of 12, and had already worked on their machinery for quite a few years when I joined them. When I came their machine did not work, but they had learned a lot; among the things they had learned was to recognise that their rst e ort contained to o many technological mistakes to be salvageable, and that they should start afresh. So, early in the game I b ecame involved in the design of \the next machine", something that would b e rep eated a numb er of times. In retrosp ect, the most noteworthy asp ect of that co op eration is that we accepted without any discussion a discipline that seems rare to day: the very rst thing we did was to write a programmer's manual for the next machine, including its complete functional description. For some reason, I was always the one that wrote that do cument. This do cument then served as a contract b etween them and me: they knew what they had to build and I knew that I could build up on. And ab out a year later, wewould b e b oth ready: they had built their machine and I had all the basic software nished. Not tested, of course, but that turned always out to be sup er uous. At the time I did not realise how valuable this training was of programming for a machine that did not exist yet; now I know. I designed my rst non trivial algorithms. The algorithm for The Shortest Path was designed for the purp ose of demonstrating the p ower of the ARMAC at its ocial inauguration in 1956, the one for the Shortest Spanning Tree was designed to minimise the amount of copp er in the backplane wiring of the X1. In retrosp ect, it is revealing that I did not rush to publish these two algorithms: at that time, discrete algorithms had not yet acquired mathematical resp ectability, and there were no suitable journal. Eventually they were o ered in 1959 to \Numerische Mathematik" in an e ort of helping that new journal to establish itself. For manyyears, and in wide circles, The Shortest Path has b een the main pillar for my name and fame, and then it is a strange thought that it was designed without p encil and pap er, while I had a cup of co ee with my wife on a sunny cafe terrace in Amsterdam, only designed for a demo... Life b ecame serious when Bram and Carel embarked on the design of the X1, which after a while they conceived with a real-time interrupt. I was frightened out of my wits, only b eing to o muchaware that this would confront me with a to all intents and purp oses non deterministic machine. For ab out three months Ihave b een able to delay the decision to include the interrupt, until eventually, they attered me out of my resistance. Their plea was along the lines \Yes, we understand that this makes your task much harder, but surely someone likeyou must b e up to it, etc.". The real-time interrupt handler b ecame my thesis topic; I earned my Do ctorate in late 1959. In the mean time, the ALGOL pro ject was underway. I had attended a few conferences outside the Netherlands, but it was ALGOL that intro duced me to From my Life 89 frequent foreign travel. Those trips were very tiring, for my English was un- trained. I am very grateful to MikeWo o dger from the National Physical Lab- oratory, who quickly started correcting my English, but in the b eginning only the errors he had heard me make more than once.
Recommended publications
  • Computer Conservation Society
    Computer Conservation Society Aims and objectives The Computer Conservation Society (CCS) is a co-operative venture between the British Computer Society, the Science Museum of London and the Museum of Science and Industry in Manchester. The CCS was constituted in September 1989 as a Specialist Group of the British Computer Society (BCS). It is thus covered by the Royal Charter and charitable status of the BCS. The aims of the CCS are to Promote the conservation of historic computers and to identify existing computers which may need to be archived in the future Develop awareness of the importance of historic computers Encourage research on historic computers and their impact on society Membership is open to anyone interested in computer conservation and the history of computing. The CCS is funded and supported by voluntary subscriptions from members, a grant from the BCS, fees from corporate membership, do- nations, and by the free use of Science Museum facilities. Some charges may be made for publications and attendance at seminars and conferences. There are a number of active Working Parties on specific computer restorations and early computer technologies and software. Younger peo- ple are especially encouraged to take part in order to achieve skills transfer. Resurrection The Bulletin of the Computer Conservation Society ISSN 0958 - 7403 Number 30 Spring 2003 Contents Generous BCS Support for Bombe Rebuild Project Ernest Morris, Chairman 2 AGM 2 News Round-Up 3 Society Activity 6 CCS Collection Policy 11 DAP snippets Brian M Russell 12 CCS Web Site Information 12 British Computer Corporation | a 1956 Venture Hugh McGregor Ross 13 Edsger Dijkstra remembered Brian Shearing 22 Deciphering Ancient Floppy Discs Kevin Murrell 26 The ICL Archive Hamish Carmichael 28 Forthcoming Events 31 Generous BCS Support for Bombe Rebuild Project Ernest Morris, Chairman CCS members will be familiar with the good progress of the Bombe re- build from the regular reports in Resurrection by John Harper, the project manager.
    [Show full text]
  • The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life: Plus the Secrets of Enigma
    The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life: Plus The Secrets of Enigma B. Jack Copeland, Editor OXFORD UNIVERSITY PRESS The Essential Turing Alan M. Turing The Essential Turing Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma Edited by B. Jack Copeland CLARENDON PRESS OXFORD Great Clarendon Street, Oxford OX2 6DP Oxford University Press is a department of the University of Oxford. It furthers the University’s objective of excellence in research, scholarship, and education by publishing worldwide in Oxford New York Auckland Cape Town Dar es Salaam Hong Kong Karachi Kuala Lumpur Madrid Melbourne Mexico City Nairobi New Delhi Taipei Toronto Shanghai With offices in Argentina Austria Brazil Chile Czech Republic France Greece Guatemala Hungary Italy Japan South Korea Poland Portugal Singapore Switzerland Thailand Turkey Ukraine Vietnam Published in the United States by Oxford University Press Inc., New York © In this volume the Estate of Alan Turing 2004 Supplementary Material © the several contributors 2004 The moral rights of the author have been asserted Database right Oxford University Press (maker) First published 2004 All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission in writing of Oxford University Press, or as expressly permitted by law, or under terms agreed with the appropriate reprographics rights organization. Enquiries concerning reproduction outside the scope of the above should be sent to the Rights Department, Oxford University Press, at the address above.
    [Show full text]
  • A Programmer's Story. the Life of a Computer Pioneer
    A PROGRAMMER’S STORY The Life of a Computer Pioneer PER BRINCH HANSEN FOR CHARLES HAYDEN Copyright c 2004 by Per Brinch Hansen. All rights reserved. Per Brinch Hansen 5070 Pine Valley Drive, Fayetteville, NY 13066, USA CONTENTS Acknowledgments v 1 Learning to Read and Write 1938–57 1 Nobody ever writes two books – My parents – Hitler occupies Denmark – Talking in kindergarten – A visionary teacher – The class newspaper – “The topic” – An elite high school – Variety of teachers – Chemical experiments – Playing tennis with a champion – Listening to jazz – “Ulysses” and other novels. 2 Choosing a Career 1957–63 17 Advice from a professor – Technical University of Denmark – rsted’s inuence – Distant professors – Easter brew – Fired for being late – International exchange student – Masers and lasers – Radio talk — Graduation trip to Yugoslavia – An attractive tourist guide – Master of Science – Professional goals. 3 Learning from the Masters 1963–66 35 Regnecentralen – Algol 60 – Peter Naur and Jrn Jensen – Dask and Gier Algol – The mysterious Cobol 61 report – I join the compiler group – Playing roulette at Marienlyst resort – Jump- starting Siemens Cobol at Mogenstrup Inn – Negotiating salary – Compiler testing in Munich – Naur and Dijkstra smile in Stock- holm – The Cobol compiler is nished – Milena and I are married in Slovenia. 4 Young Man in a Hurr 1966–70 59 Naur’s vision of datalogy – Architect of the RC 4000 computer – Programming a real-time system – Working with Henning Isaks- son, Peter Kraft, and Charles Simonyi – Edsger Dijkstra’s inu- ence – Head of software development – Risking my future at Hotel Marina – The RC 4000 multiprogramming system – I meet Edsger Dijkstra, Niklaus Wirth, and Tony Hoare – The genius of Niels Ivar Bech.
    [Show full text]
  • Assembling a Prehistory for Formal Methods: a Personal View Thomas Haigh [email protected]
    Assembling A Prehistory for Formal Methods: A Personal View Thomas Haigh [email protected] University of Wisconsin—Milwaukee & Siegen University www.tomandmaria.com This is a preprint copy. Please quote and cite the final version, which will appear in a special issue of Formal Aspects of Computing devoted to historical work. Thanks to Cliff Jones and the anonymous reviewers for their encouragement and feedback on earlier drafts of this paper. Preprint Draft Haigh – Assembling a History for Formal Methods 2 Although I was pleased to be asked to contribute something to this volume I have a confession to make: I have never studied the history of formal methods. So this is not going to be a history of formal methods as much as a reflection on how such a story might be written. My plan is to triangulate from my personal experiences as a computer science student a quarter century ago, my Ph.D. training as a historian of science and technology, and my subsequent career researching and writing about various aspects of the history of computing. The fact that, despite a general familiarity with the literature on the history of computing, I don’t have a better grasp of the history of formal methods tells us a lot about the need for this special issue. Most of the history is so far locked up in the heads of participants, which is not a convenient place for the rest of us to find it. Stories written by participants or people with a personal connection to the events described are not usually the last word on historical events, but they are a vital starting point.
    [Show full text]
  • An Emerging Domain Science a Rˆole for Stanis Law Le´Shniewski’S Mereology and Bertrand Russell’S Philosophy of Logical Atomism
    Higher-Order and Symbolic Computation, a Springer Journal An Emerging Domain Science A Rˆole for Stanis law Le´shniewski’s Mereology and Bertrand Russell’s Philosophy of Logical Atomism Dines Bjørner Compile date: July 13, 2009 / Received:July 13, 2009 / Accepted: date Abstract Domain engineers describe universes of discourse such as bookkeeping, the financial service industry, container shipping lines, logistics, oil pipelines, railways, etc. In doing so domain engineers have to decide on such issues as identification of that which is to be described; which of the describable phenomena and concepts are (to be described as) entities, operations, events, and which as behaviours; which entities are (to be described as) continuous which are (. ) discrete, which are (. ) atomic, which are (. ) composite and what are the attributes of either and the mereology of composite entities, i.e., the way in which they are put together from sub-entities. For each of these issues and their composite presentation the domain engineer has to decide on levels of abstraction, what to include and what to exclude. In doing so the domain engineer thus has to have a firm grasp on the a robust un- derstanding and practice of the very many issues of description: what can be described, identifying what is to be described, how to describe, description principles, description techniques, description tools and laws of description. This paper will outline the issues in the slanted type font. One issue, ‘mereology’, was studied, in a wider setting, by the Polish philosopher and mathematician Stanislaw Le´shniewski, in the 1920s [55,66]. We shall relate our work to that of Le´shniewski and those of his followers who have suggested axiomatisa- tions of various forms of mereology [53,23,52,24,22].
    [Show full text]
  • Was the Manchester Baby Conceived at Bletchley Park?
    Was the Manchester Baby conceived at Bletchley Park? David Anderson1 School of Computing, University of Portsmouth, Portsmouth, PO1 3HE, UK This paper is based on a talk given at the Turing 2004 conference held at the University of Manchester on the 5th June 2004. It is published by the British Computer Society on http://www.bcs.org/ewics. It was submitted in December 2005; final corrections were made and references added for publication in November 2007. Preamble In what follows, I look, in a very general way, at a particularly interesting half century, in the history of computation. The central purpose will be to throw light on how computing activity at the University of Manchester developed in the immediate post-war years and, in the context of this conference, to situate Alan Turing in the Manchester landscape. One of the main methodological premises on which I will depend is that the history of technology is, at heart, the history of people. No historically-sophisticated understanding of the development of the computer is possible in the absence of an appreciation of the background, motivation and aspirations of the principal actors. The life and work of Alan Turing is the central focus of this conference but, in the Manchester context, it is also important that attention be paid to F.C. Williams, T. Kilburn and M.H.A. Newman. The Origins of Computing in Pre-war Cambridge David Hilbert's talk at the Sorbonne on the morning of the 8th August 1900 in which he proposed twenty-three "future problems", effectively set the agenda for mathematics research in the 20th century.
    [Show full text]
  • La Conversion À Unix Un Exemple De Prophétisme Informatique?
    La conversion à Unix Un exemple de prophétisme informatique ? Laurent Bloch To cite this version: Laurent Bloch. La conversion à Unix Un exemple de prophétisme informatique ?. Cahiers d’histoire du Cnam, Cnam, 2017, La recherche sur les systèmes : des pivots dans l’histoire de l’informatique – II/II, 7-8 (7-8), pp129-144. hal-03027084 HAL Id: hal-03027084 https://hal.archives-ouvertes.fr/hal-03027084 Submitted on 27 Nov 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. 129 Enquête d'acteur La conversion à Unix Un exemple de prophétisme informatique ? Laurent Bloch Membre de l’Institut de l’Iconomie. Unix survient une vingtaine d’an- va être question ici, selon la perception nées après l’invention de l’ordinateur, et que j’en ai eue de ma position de prati- une dizaine d’années après que quelques cien. Cette perception a été élaborée de pionniers eurent compris qu’avec l’infor- façon rétrospective, aussi l’ordre chro- matique une nouvelle science naissait, nologique n’est-il pas toujours respecté qu’ils eurent tenté de la faire reconnaître dans cet exposé. Ce qui suit est le récit de comme telle, et qu’ils eurent échoué dans l’élaboration d’une vision personnelle, qui cette tentative1.
    [Show full text]
  • The Essential Turing : Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life, Plus
    The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life: Plus The Secrets of Enigma B. Jack Copeland, Editor OXFORD UNIVERSITY PRESS The Essential Turing Alan M. Turing The Essential Turing Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma Edited by B. Jack Copeland CLARENDON PRESS OXFORD Great Clarendon Street, Oxford OX2 6DP Oxford University Press is a department of the University of Oxford. It furthers the University’s objective of excellence in research, scholarship, and education by publishing worldwide in Oxford New York Auckland Cape Town Dar es Salaam Hong Kong Karachi Kuala Lumpur Madrid Melbourne Mexico City Nairobi New Delhi Taipei Toronto Shanghai With offices in Argentina Austria Brazil Chile Czech Republic France Greece Guatemala Hungary Italy Japan South Korea Poland Portugal Singapore Switzerland Thailand Turkey Ukraine Vietnam Published in the United States by Oxford University Press Inc., New York © In this volume the Estate of Alan Turing 2004 Supplementary Material © the several contributors 2004 The moral rights of the author have been asserted Database right Oxford University Press (maker) First published 2004 All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, without the prior permission in writing of Oxford University Press, or as expressly permitted by law, or under terms agreed with the appropriate reprographics rights organization. Enquiries concerning reproduction outside the scope of the above should be sent to the Rights Department, Oxford University Press, at the address above.
    [Show full text]
  • Peter Landin Semantics Seminar 2020 Algol 60 @ 60
    Peter Landin Semantics Seminar 2020 Algol 60 @ 60 Tim Denvir Troy Astarte 1 Introduction: Rationale ⚫ Algol 60 is 60 years old. ⚫ Algol 60 was defined with semantics in mind. ⚫ Peter Landin’s formal semantics of Algol 60. ⚫ An example of burgeoning new interest in formal semantics of programming languages in 60-70s ⚫ So: an apposite topic for PL Semantics Seminar. 2 Content of seminar ⚫ Short history of Algol 60. ⚫ The authors of the Revised Report. ⚫ Relationship of Algol with formal ideas, λ-calculus. ⚫ Peter Landin’s approach to formal description. ⚫ Overview of semantics zeitgeist. ⚫ Other formal descriptions. ⚫ Fascination with Algol: why? ⚫ Postscript; quote from Wittgenstein in Algol 60 Report. 3 Short History of Algol 60 ⚫ Conference in Zurich 1958 ⚫ Preliminary Report: Algol 58/IAL, Comm ACM ⚫ Informal meeting in Mainz Nov. 1958 prompted: ⚫ Algol implementation conference (40) Copenhagen Feb. 1959: “hardware group” (character sets, input eqp) ⚫ Algol Bulletin ed. Peter Naur Regnecentralen Copenhagen 1959-88, 52 issues: discussion forum ⚫ European Algol conference Paris Nov. 1959 (c50): 4 January 1960 Conference 7 European representatives ⚫ Association Française de Calcul ⚫ British Computer Society ⚫ Gesellschaft für Angewandte Mathematik und Mechanik (GAMM) ⚫ Nederlands Rekenmachine Genootschap ⚫ (Learned Societies for Computer Science in Europe) 5 USA Contributions ⚫ Algol working groups on ACM Committee on Programming Languages ⚫ 7 representatives to Jan. 1960 conference after preparatory meeting in Boston Dec.1959 ⚫ (William Turanski killed in road accident just before Jan. 60 conference) ⚫ New draft Report developed from Preliminary Report, formed basis of Revised Report at Jan. 60 conference ⚫ Finally conference in Rome April 1962 to correct, eliminate ambiguities, clarify; ed.
    [Show full text]
  • Dijkstra's Crisis
    Dijkstra’s Crisis: The End of Algol and Beginning of Software Engineering, 1968-72 Thomas Haigh, [email protected], www.tomandmaria.com/tom Draft for discussion in SOFT-EU Project Meeting, September 2010 “In SHOT meetings and in the journals, it is surprising how few and far between critical references to specific historical arguments are: there is hardly any debate or even serious substantive disagreement.” – David Edgerton, 2010. In 1968 a NATO Software Engineering Conference was held in Garmisch, Germany. Attendees represented a cross section of those involved in programming work and its management. Having never met before they were shocked to realize that identical troubles plagued many different kinds of software. Participants agreed that a “software crisis” was raging. Programming projects were chronically late and over budget, yet often failed to produce useful software. They endorsed a new discipline of software engineering, its contents yet to be defined, as the solution to this crisis. A follow up conference, held in Rome the next year, failed to reach consensus on what specific techniques might constitute the core of this new discipline. Yet software engineering soon became the dominant identity to describe the work and management of programmers. That, at least, is the composite account one would gain from the almost identical paragraphs repeated again and again in historical works both scholarly and popular. But this growing mass of consensus is, I believe, built on sand. The historical significance of the 1968 NATO Conference, the demographics of its participants, its connection to prior and subsequent events, and its relationship to the software crisis are at risk of being fundamentally misinterpreted.
    [Show full text]
  • Christopher Strachey
    Christopher Strachey Born November 16, 1916, Hampstead, London, UK- died May 18, 1975, Oxford, England; early English programmer who in 1959 proposed a form of time-sharing, illuminated the understanding of progamming languages, and developed denotational semantics. Education: Gresham's School, Norfolk, 1930-1935; lower second, natural sciences tripos, King's College, University of Cambridge, 1938. Professional Experience: physicist, Standard Telephones and Cables, 1938-1945; physics/mathematics master, St. Edmund's School, Canterbury, 1945-1949; master, Harrow School, 1949-1952; technical officer, National Research and Development Corp. (NRDC), 1952-1959; private consultant, 1959-1966; University Mathematical Laboratory, Cambridge, 1962-1966; Programming Research Group, Oxford University, 1966-1975. Honors and Awards: distinguished fellow, British Computer Society, 1972. Born in 1916 into one of England's more prominent families, Christopher Strachey was educated at Gresham's School, Norfolk, and at King's College, Cambridge. He spent the war years in radar research, after which he spent several years as a schoolmaster. His career in computing did not effectively begin until 1951 when he started to program the machines at the National Physical Laboratory and Manchester University, while still a master at Harrow School. In 1962 he also began work in the University Mathematical Laboratory, Cambridge, where, in the nominal position “part-time research assistant,” he worked on the CPL programming language. In 1965 he wound up his consultancy and resigned from Cambridge in order to form the Programming Research Group at Oxford University. Under his leadership the group quickly established an international reputation in the theory of programming. At Oxford, in collaboration with Dana Scott, he produced the work of which he was most proud, the foundation of denotational semantics; this work was just beginning to bear fruit when he died in 1975.
    [Show full text]
  • The ALGOL 68 Story a Personal Account by a Member of the Design Team Professor John E
    ACS Bulletin, November 1978, Page 4-6 The ALGOL 68 Story A personal account by a member of the design team Professor John E. Peck, University of British Colombia, Vancouver, Canada Early Years My early years were spent in South Africa. I got my B.Sc. at the University of Natal in mathematics and physics and soon after that my M.Sc. in mathematics. My first job was a daily analysis of superphosphate at a chemical factory near Durban belonging to the ICI group, and then I taught mathematics to engineers at the University of Natal. In 1946 I took up a scholarship and went to Yale University for graduate studies, where I obtained a Ph.D. in 1950 with a thesis on topological semigroups. I taught a year at Brown University and then for three years back at the University of Natal. We then decided to emigrate to Canada where I spent a year at the University of New Brunswick, four years at McGill University, ten years at Calgary and the remaining years at the University of British Columbia. Up to the year 1959 I had thought little about computing, my professional activities being in the realm of pure mathematics where the activity of greatest importance was the proving of useless theorems. In the spring of 1959 an invitation was circulated in the Mathematics department at McGill, where I was working, to learn computer programming on the Datatron. My colleagues all looked down their noses at the thought of such a mundane exercise, for wasn't it clear that all that needed to be known about computing was the mathematical theory of switching circuits.
    [Show full text]