DOCSLIB.ORG

Literaturverzeichnis

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Literaturverzeichnis Literaturverzeichnis ABD+99. Dirk Ansorge, Klaus Bergner, Bernhard Deifel, Nicholas Hawlitzky, Christoph Maier, Barbara Paech, Andreas Rausch, Marc Sihling, Veronika Thurner, and Sascha Vogel: Managing componentware development – software reuse and the V-Modell process. In M. Jarke and A. Oberweis (editors): Advanced Information Systems Engineering, 11th International Conference CAiSE’99, Heidelberg, volume 1626 of Lecture Notes in Computer Science, pages 134–148. Springer, 1999, ISBN 3-540-66157-3. Abr05. Jean-Raymond Abrial: The B-Book. Cambridge University Press, 2005. AJ94. Samson Abramsky and Achim Jung: Domain theory. In Samson Abramsky, Dov M. Gabbay, and Thomas Stephen Edward Maibaum (editors): Handbook of Logic in Computer Science, volume 3, pages 1–168. Clarendon Press, 1994. And02. Peter Bruce Andrews: An introduction to mathematical logic and type theory: To Truth Through Proof, volume 27 of Applied Logic Series. Springer, 2nd edition, July 2002, ISBN 978-94-015-9934-4. AVWW95. Joe Armstrong, Robert Virding, Claes Wikström, and Mike Williams: Concurrent programming in Erlang. Prentice Hall, 2nd edition, 1995. Bac78. Ralph-Johan Back: On the correctness of refinement steps in program develop- ment. PhD thesis, Åbo Akademi, Department of Computer Science, Helsinki, Finland, 1978. Report A–1978–4. Bas83. Günter Baszenski: Algol 68 Preludes for Arithmetic in Z and Q. Bochum, 2nd edition, September 1983. Bau75. Friedrich Ludwig Bauer: Software engineering. In Friedrich Ludwig Bauer (editor): Advanced Course: Software Engineering, Reprint of the First Edition (February 21 – March 3, 1972), volume 30 of Lecture Notes in Computer Science, pages 522–545. Springer, 1975. Bau82. Rüdeger Baumann: Programmieren mit PASCAL. Chip-Wissen. Vogel-Verlag, Würzburg, 1982. Bau98. Friedrich Ludwig Bauer: Wer erfand den von-Neumann-Rechner? Historische Notizen. Informatik Spektrum, 21(2):84–89, 1998. BB00. Henk Pieter Barendregt and Erik Barendsen: Introduction to lambda calculus. Technical report, Department of Computer Science, Radboud University of Nijmegen, 2000. BBC86. Gilles Bernot, Michel Bidoit, and Christine Choppy: Algebraic semantics of exception handling. In Bernard Robinet and Reinhard Wilhelm (editors): European Symposium on Programming, volume 213 of Lecture Notes in Com- puter Science, pages 173–186, New York, NY, USA, March 1986. Springer, ISBN 3-540-16442-1. © Springer Fachmedien Wiesbaden GmbH, ein Teil von Springer Nature 2019 437 M. Broy, Logische und Methodische Grundlagen der Programm- und Systementwicklung, https://doi.org/10.1007/978-3-658-26302-7 438 Literaturverzeichnis BBG+60. John Warner Backus, Friedrich Ludwig Bauer, Julien Green, Charles Katz, John McCarthy, Alan Jay Perlis, Heinz Rutishauser, Klaus Samelson, Bernard Vauquois, Joseph Henry Wegstein, Adriaan van Wijngaarden, and Michael Woodger: Report on the algorithmic language ALGOL 60. Communications of the ACM, 3(5):299–314, May 1960, ISSN 0001-0782. Ber89a. Joseph Bertrand: Calcul des probabilités. Gauthier-Villars, 1889. Ber89b. Jan Aldert Bergstra: Algebraic specification. ACM Press Frontier Series. ACM Press and Addison-Wesley, 1989, ISBN 0-201-41635-2. Editors: J. Heering and P. Klint. Ber01. Jan Aldert Bergstra: Handbook of Process Algebra. Elsevier Science Inc., 2001, ISBN 0444828303. Editors: A. Ponse and S.A. Smolka. BFG+93a. Manfred Broy, Christian Facchi, Radu Grosu, Rudi Hettler, Heinrich Huss- mann, Dieter Nazareth, Franz Regensburger, Oscar Slotosch, and Ketil Stølen: The requirement and design specification language SPECTRUM. An informal introduction. Version 1.0. Part I. Technical Report TUM-I9311, Technische Universität München, Institut für Informatik, 1993. BFG+93b. Manfred Broy, Christian Facchi, Radu Grosu, Rudi Hettler, Heinrich Hussmann, Dieter Nazareth, Franz Regensburger, Oscar Slotosch, and Ketil Stølen: The requirement and design specification language SPECTRUM. An informal in- troduction. Version 1.0. Part II. Technical Report TUM-I9312, Technische Universität München, Institut für Informatik, 1993. BG77. Rod Martineau Burstall and Joseph Amadee Goguen: Putting theories together to make specifications.In5th International Joint Conference on Artificial Intelligence, pages 1045–1058, Cambridge, MA, 1977. BHS91. Ferenc Belina, Dieter Hogrefe, and Amardeo Sarma: SDL with Applications from Protocol Specification. Carl Hanser Verlag and Prentice Hall, 1991. Bir48. Garrett Birkhoff: Lattice Theory. AMS, 2nd edition, 1948. Bir95. Garrett Birkhoff: Lattice Theory, volume 25. American Mathematical Society, 3rd edition, 1995. Eighth printing, ISBN 0-8218-1025-1. Bir98. Richard Bird: Introduction to Functional Programming using Haskell. Prentice Hall, 1998. BK85. Jan Aldert Bergstra and Jan Willem Klop: Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1):77–121, 1985. Bla02. Bruno Blanchet: Introduction to abstract interpretation. Lecture script, http://prosecco.gforge.inria.fr/personal/bblanche/ absint.pdf, 2002. BM04. Michel Bidoit and Peter David Mosses: Casl User Manual, volume 2900 of Lecture Notes in Computer Science. Springer, 2004. IFIP Series. BMPW86. Manfred Broy, Bernhard Möller, Peter Pepper, and Martin Wirsing: Algeb- raic implementations preserve program correctness. Science of Computer Programming, 7:35 – 53, 1986. Bou50. Nicolas Bourbaki: Sur le théorème de Zorn. Archiv der Mathematik, 2(6) :434– 437, 1949/50. Bro87. Rodney Allen Brooks: LISP: Programmieren in Common Lisp. Oldenbourg Wissenschaftsverlag, 1987. Bro88. Manfred Broy: Views of queues. Science of Computer Programming, 11(1):65– 86, 1988. Bro91. Manfred Broy: Towards a formal foundation of the specification and description language SDL. Formal Aspects of Computing, 3(1):21–57, 1991. Bro98. Manfred Broy: Informatik. Eine grundlegende Einführung (Band 1). Springer, 2. Auflage, 1998. Bro14. Manfred Broy: Modellierung verteilter Systeme, 2014. Vorlesungsskript. BRSK05. Manfred Broy, Andreas Rausch, Marc Sihling und Marco Kuhrmann: IT-Projekte erfolgreich mit dem neuen V-Modell XT. Tagungsband TUM-I0508, Technische Universität München, Mai 2005. Literaturverzeichnis 439 BS12. Stanley Neal Burris and Hanamantagouda Pandappa Sankappanavar: A Course in Universal Algebra. Springer-Verlag, Millenium edition, Novem- ber 2012. http://www.math.uwaterloo.ca/~snburris/htdocs/ UALG/univ-algebra2012.pdf. Bur97. Rainer Burkhardt: UML: Unified Modeling Language. Addison-Wesley, 1997, ISBN 3-8273-1226-4. BW81. Friedrich Ludwig Bauer und Hans Wössner: Algorithmische Sprache und Programmentwicklung. Springer, Berlin Heidelberg New York, 1981, ISBN 978-3-662-05656-1. BW82. Manfred Broy and Martin Wirsing: Partial abstract types. Acta Informatica, 18(1):47–64, March 1982, ISSN 0001-5903. BW99. Gabriele Bannert und Martin Weitzel: Objektorientierter Softwareentwurf mit UML. Addison Wesley Longman, München, 1999. BWP87. Manfred Broy, Martin Wirsing, and Peter Pepper: On the algebraic definition of programming languages. ACM Transactions on Programming Languages and Systems (TOPLAS), 9(1):54–99, 1987. CC79. Patrick Cousot and Radhia Cousot: Constructive versions of Tarski’s fixed point theorems. Pacific Journal of Mathematics, 81(1):43–57, 1979. CEW93. Ingo Claßen, Hartmut Ehrig, and Dietmar Wolz: Algebraic Specification Tech- niques and Tools for Software Development: The ACT Approach. World Scientific, 1993. Cha04. Stephen J. Chapman: Fortran 90/95 for scientists and engineers. McGraw-Hill Higher Education, 2nd edition, 2004. CLRS09. Thomas H. Cormen, Charles Eric Leiserson, Ronald Linn Rivest, and Clif- ford Seth Stein: Introduction to Algorithms. MIT Press, 3rd edition, 2009, ISBN 978-0-262-03384-8. CM94. William F. Clocksin and Christopher Stuart Mellish: Programming in Prolog. Springer, 1994. Coh81. Paul Moritz Cohn: Universal algebra. Mathematics and its applications/6. D. Reidel Publishing Company, revised edition, 1981, ISBN 978-90-277-1254-7. Originally published in 1965 by Harper & Row in the series Harper’s series in modern mathematics. CR93. Alain Marie Albert Colmerauer and Philippe Roussel: The birth of Prolog.In The second ACM SIGPLAN conference on history of programming languages, HOPL-II, pages 37–52. ACM Press, 1993, ISBN 0-89791-570-4. CWo13. CWoo: Homomorphism between partial algebras, March 2013. http:// planetmath.org/homomorphismbetweenpartialalgebras. DDH72. Ole-Johan Dahl, Edsger Wybe Dijkstra, and Charles Antony Richard Hoare: Structured Programming. Academic Press, London New York, 1972. Den91. Ernst Denert: Software-Engineering. Springer, 1991. Dij68. Edsger Wybe Dijkstra: Letters to the editor: go-to statement con- sidered harmful. Communications of the ACM, 11(3):147–148, 1968. Original title: A Case against the GO TO statement, known as EWD 215, http://www.cs.utexas.edu/users/EWD/ transcriptions/EWD02xx/EWD215.html, last accessed on 30 July 2015. Dij75. Edsger Wybe Dijkstra: Guarded commands, non-determinacy, and formal derivation of programs. Communications of the ACM, 18:453–457, 1975. Dij76. Edsger Wybe Dijkstra: A Discipline of Programming. Englewood Cliffs: Prentice Hall, 1976. DN65. Ole-Johan Dahl and Kristen Nygaard: SIMULA: a language for programming and description of discrete event systems. Norwegian Computing Center (NCC), Oslo, May 1965. Introduction and User’s Manual. DP91. Brian Albert Davey and Hilary Ann Priestley: Introduction to lattices and order. Cambridge University Press, 1991. 440 Literaturverzeichnis DW99. Wolfgang Dröschel und Manuela Wiemers: Das V-Modell 97: Der Standard für die Entwicklung von IT-Systemen
Load more

Recommended publications
  • Kathleen Fisher Question: Interesting Answer in Algol
    10/21/08 cs242! Lisp! Algol 60! Algol 68! Pascal! Kathleen Fisher! ML! Modula! Reading: “Concepts in Programming Languages” Chapter 5 except 5.4.5! Haskell! “Real World Haskell”, Chapter 0 and Chapter 1! (http://book.realworldhaskell.org/)! Many other languages:! Algol 58, Algol W, Euclid, EL1, Mesa (PARC), …! Thanks to John Mitchell and Simon Peyton Jones for some of these slides. ! Modula-2, Oberon, Modula-3 (DEC)! Basic Language of 1960! Simple imperative language + functions! Successful syntax, BNF -- used by many successors! real procedure average(A,n); statement oriented! real array A; integer n; No array bounds.! begin … end blocks (like C { … } )! begin if … then … else ! real sum; sum := 0; Recursive functions and stack storage allocation! for i = 1 step 1 until n Fewer ad hoc restrictions than Fortran! do General array references: A[ x + B[3] * y ] sum := sum + A[i]; Type discipline was improved by later languages! average := sum/n No “;” here.! Very influential but not widely used in US! end; Tony Hoare: “Here is a language so far ahead of its time that it was not only an improvement on its predecessors Set procedure return value by assignment.! but also on nearly all of its successors.”! Question:! Holes in type discipline! Is x := x equivalent to doing nothing?! Parameter types can be arrays, but! No array bounds! Interesting answer in Algol:! Parameter types can be procedures, but! No argument or return types for procedure parameters! integer procedure p; begin Problems with parameter passing mechanisms!
    [Show full text]
  • Thomas Ströhlein's Endgame Tables: a 50Th Anniversary
    Thomas Ströhlein's Endgame Tables: a 50th Anniversary Article Supplemental Material The Festschrift on the 40th Anniversary of the Munich Faculty of Informatics Haworth, G. (2020) Thomas Ströhlein's Endgame Tables: a 50th Anniversary. ICGA Journal, 42 (2-3). pp. 165-170. ISSN 1389-6911 doi: https://doi.org/10.3233/ICG-200151 Available at http://centaur.reading.ac.uk/90000/ It is advisable to refer to the publisher’s version if you intend to cite from the work. See Guidance on citing . Published version at: https://content.iospress.com/articles/icga-journal/icg200151 To link to this article DOI: http://dx.doi.org/10.3233/ICG-200151 Publisher: The International Computer Games Association All outputs in CentAUR are protected by Intellectual Property Rights law, including copyright law. Copyright and IPR is retained by the creators or other copyright holders. Terms and conditions for use of this material are defined in the End User Agreement . www.reading.ac.uk/centaur CentAUR Central Archive at the University of Reading Reading’s research outputs online 40 Jahre Informatik in Munchen:¨ 1967 – 2007 Festschrift Herausgegeben von Friedrich L. Bauer unter Mitwirkung von Helmut Angstl, Uwe Baumgarten, Rudolf Bayer, Hedwig Berghofer, Arndt Bode, Wilfried Brauer, Stephan Braun, Manfred Broy, Roland Bulirsch, Hans-Joachim Bungartz, Herbert Ehler, Jurgen¨ Eickel, Ursula Eschbach, Anton Gerold, Rupert Gnatz, Ulrich Guntzer,¨ Hellmuth Haag, Winfried Hahn (†), Heinz-Gerd Hegering, Ursula Hill-Samelson, Peter Hubwieser, Eike Jessen, Fred Kroger,¨ Hans Kuß, Klaus Lagally, Hans Langmaack, Heinrich Mayer, Ernst Mayr, Gerhard Muller,¨ Heinrich Noth,¨ Manfred Paul, Ulrich Peters, Hartmut Petzold, Walter Proebster, Bernd Radig, Angelika Reiser, Werner Rub,¨ Gerd Sapper, Gunther Schmidt, Fred B.
    [Show full text]
  • Edsger Dijkstra: the Man Who Carried Computer Science on His Shoulders
    INFERENCE / Vol. 5, No. 3 Edsger Dijkstra The Man Who Carried Computer Science on His Shoulders Krzysztof Apt s it turned out, the train I had taken from dsger dijkstra was born in Rotterdam in 1930. Nijmegen to Eindhoven arrived late. To make He described his father, at one time the president matters worse, I was then unable to find the right of the Dutch Chemical Society, as “an excellent Aoffice in the university building. When I eventually arrived Echemist,” and his mother as “a brilliant mathematician for my appointment, I was more than half an hour behind who had no job.”1 In 1948, Dijkstra achieved remarkable schedule. The professor completely ignored my profuse results when he completed secondary school at the famous apologies and proceeded to take a full hour for the meet- Erasmiaans Gymnasium in Rotterdam. His school diploma ing. It was the first time I met Edsger Wybe Dijkstra. shows that he earned the highest possible grade in no less At the time of our meeting in 1975, Dijkstra was 45 than six out of thirteen subjects. He then enrolled at the years old. The most prestigious award in computer sci- University of Leiden to study physics. ence, the ACM Turing Award, had been conferred on In September 1951, Dijkstra’s father suggested he attend him three years earlier. Almost twenty years his junior, I a three-week course on programming in Cambridge. It knew very little about the field—I had only learned what turned out to be an idea with far-reaching consequences. a flowchart was a couple of weeks earlier.
    [Show full text]
  • The Advent of Recursion & Logic in Computer Science
    The Advent of Recursion & Logic in Computer Science MSc Thesis (Afstudeerscriptie) written by Karel Van Oudheusden –alias Edgar G. Daylight (born October 21st, 1977 in Antwerpen, Belgium) under the supervision of Dr Gerard Alberts, and submitted to the Board of Examiners in partial fulfillment of the requirements for the degree of MSc in Logic at the Universiteit van Amsterdam. Date of the public defense: Members of the Thesis Committee: November 17, 2009 Dr Gerard Alberts Prof Dr Krzysztof Apt Prof Dr Dick de Jongh Prof Dr Benedikt Löwe Dr Elizabeth de Mol Dr Leen Torenvliet 1 “We are reaching the stage of development where each new gener- ation of participants is unaware both of their overall technological ancestry and the history of the development of their speciality, and have no past to build upon.” J.A.N. Lee in 1996 [73, p.54] “To many of our colleagues, history is only the study of an irrele- vant past, with no redeeming modern value –a subject without useful scholarship.” J.A.N. Lee [73, p.55] “[E]ven when we can't know the answers, it is important to see the questions. They too form part of our understanding. If you cannot answer them now, you can alert future historians to them.” M.S. Mahoney [76, p.832] “Only do what only you can do.” E.W. Dijkstra [103, p.9] 2 Abstract The history of computer science can be viewed from a number of disciplinary perspectives, ranging from electrical engineering to linguistics. As stressed by the historian Michael Mahoney, different `communities of computing' had their own views towards what could be accomplished with a programmable comput- ing machine.
    [Show full text]
  • Edsger W. Dijkstra: a Commemoration
    Edsger W. Dijkstra: a Commemoration Krzysztof R. Apt1 and Tony Hoare2 (editors) 1 CWI, Amsterdam, The Netherlands and MIMUW, University of Warsaw, Poland 2 Department of Computer Science and Technology, University of Cambridge and Microsoft Research Ltd, Cambridge, UK Abstract This article is a multiauthored portrait of Edsger Wybe Dijkstra that consists of testimo- nials written by several friends, colleagues, and students of his. It provides unique insights into his personality, working style and habits, and his influence on other computer scientists, as a researcher, teacher, and mentor. Contents Preface 3 Tony Hoare 4 Donald Knuth 9 Christian Lengauer 11 K. Mani Chandy 13 Eric C.R. Hehner 15 Mark Scheevel 17 Krzysztof R. Apt 18 arXiv:2104.03392v1 [cs.GL] 7 Apr 2021 Niklaus Wirth 20 Lex Bijlsma 23 Manfred Broy 24 David Gries 26 Ted Herman 28 Alain J. Martin 29 J Strother Moore 31 Vladimir Lifschitz 33 Wim H. Hesselink 34 1 Hamilton Richards 36 Ken Calvert 38 David Naumann 40 David Turner 42 J.R. Rao 44 Jayadev Misra 47 Rajeev Joshi 50 Maarten van Emden 52 Two Tuesday Afternoon Clubs 54 2 Preface Edsger Dijkstra was perhaps the best known, and certainly the most discussed, computer scientist of the seventies and eighties. We both knew Dijkstra |though each of us in different ways| and we both were aware that his influence on computer science was not limited to his pioneering software projects and research articles. He interacted with his colleagues by way of numerous discussions, extensive letter correspondence, and hundreds of so-called EWD reports that he used to send to a select group of researchers.
    [Show full text]
  • Early Life: 1924–1945
    An interview with FRITZ BAUER Conducted by Ulf Hashagen on 21 and 26 July, 2004, at the Technische Universität München. Interview conducted by the Society for Industrial and Applied Mathematics, as part of grant # DE-FG02-01ER25547 awarded by the US Department of Energy. Transcript and original tapes donated to the Computer History Museum by the Society for Industrial and Applied Mathematics © Computer History Museum Mountain View, California ABSTRACT: Professor Friedrich L. Bauer describes his career in physics, computing, and numerical analysis. Professor Bauer was born in Thaldorf, Germany near Kelheim. After his schooling in Thaldorf and Pfarrkirchen, he received his baccalaureate at the Albertinium, a boarding school in Munich. He then faced the draft into the German Army, serving first in the German labor service. After training in France and a deployment to the Eastern Front in Kursk, he was sent to officer's school. His reserve unit was captured in the Ruhr Valley in 1945 during the American advance. He returned to Pfarrkirchen in September 1945 and in spring of 1946 enrolled in mathematics and physics at the Ludwig-Maximilians-Universitäat, München. He studied mathematics with Oscar Perron and Heinrich Tietze and physics with Arnold Sommerfeld and Paul August Mann. He was offered a full assistantship with Fritz Bopp and finished his Ph.D. in 1951 writing on group representations in particle physics. He then joined a group in Munich led by a professor of mathematics Robert Sauer and the electrical engineer Hans Piloty, working with a colleague Klaus Samelson on the design of the PERM, a computer based in part on the Whirlwind concept.
    [Show full text]
  • Oral History Interview with Friedrich L. Bauer
    An Interview with FRIEDRICH L. BAUER OH 128 Conducted by William Aspray on 17 February 1987 Munich, West Germany Charles Babbage Institute The Center for the History of Information Processing University of Minnesota, Minneapolis Copyright, Charles Babbage Institute 1 Friedrich L. Bauer Interview 17 February 1987 Abstract Bauer briefly reviews his early life and education in Bavaria through his years in the German army during World War II. He discusses his education in mathematics and theoretical physics at the University of Munich through the completion of his Ph.D. in 1952. He explains how he first came in contact with work on modern computers through a seminar in graduate school and how he and Klaus Samelson were led to join the PERM group in 1952. Work on the hardware design and on compilers is mentioned. Bauer then discusses the origins and design of the logic computer STANISLAUS, and his role in its development. The next section of the interview describes the European side of the development of ALGOL, including his work and that of Rutishauser, Samelson, and Bottenbrach. The interview concludes with a brief discussion of Bauer's work in numerical analysis in the 1950s and 1960s and his subsequent investigations of programming methodology. 2 FRIEDRICH L. BAUER INTERVIEW DATE: 17 February 1987 INTERVIEWER: William Aspray LOCATION: Deutsches Museum, Munich, West Germany ASPRAY: This is an interview on the 17th of February, 1987 at the Deutsches Museum in Munich. The interviewer is William Aspray of the Charles Babbage Institute. The interview subject is Dr. F. L. Bauer. Let's begin by having you discuss very briefly your early career in education, say up until World War II.
    [Show full text]
  • A Static Analysis Framework for Security Properties in Mobile and Cryptographic Systems
    A Static Analysis Framework for Security Properties in Mobile and Cryptographic Systems Benyamin Y. Y. Aziz, M.Sc. School of Computing, Dublin City University A thesis presented in fulfillment of the requirements for the degree of Doctor of Philosophy Supervisor: Dr Geoff Hamilton September 2003 “Start by doing what’s necessary; then do what’s possible; and suddenly you are doing the impossible” St. Francis of Assisi To Yowell, Olivia and Clotilde Declaration I hereby certify that this material, which I now submit for assessment on the programme of study leading to the award of the degree of Doctor of Philosophy (Ph.D.) is entirely my own work and has not been taken from the work of others save and to the extent that such work has been cited and acknowledged within the text of my work. Signed: I.D. No.: Date: Acknowledgements I would like to thank all those people who were true sources of inspiration, knowledge, guidance and help to myself throughout the period of my doctoral research. In particular, I would like to thank my supervisor, Dr. Geoff Hamilton, without whom this work would not have seen the light. I would also like to thank Dr. David Gray, with whom I had many informative conversations, and my colleagues, Thomas Hack and Fr´ed´ericOehl, for their advice and guidance. Finally, I would like to mention that the work of this thesis was partially funded by project IMPROVE (Enterprise Ireland Strategic Grant ST/2000/94). Benyamin Aziz Abstract We introduce a static analysis framework for detecting instances of security breaches in infinite mobile and cryptographic systems specified using the languages of the π-calculus and its cryptographic extension, the spi calculus.
    [Show full text]
  • Die Gruncllehren Cler Mathematischen Wissenschaften
    Die Gruncllehren cler mathematischen Wissenschaften in Einzeldarstellungen mit besonderer Beriicksichtigung der Anwendungsgebiete Band 135 Herausgegeben von J. L. Doob . E. Heinz· F. Hirzebruch . E. Hopf . H. Hopf W. Maak . S. Mac Lane • W. Magnus. D. Mumford M. M. Postnikov . F. K. Schmidt· D. S. Scott· K. Stein Geschiiftsfiihrende Herausgeber B. Eckmann und B. L. van der Waerden Handbook for Automatic Computation Edited by F. L. Bauer· A. S. Householder· F. W. J. Olver H. Rutishauser . K. Samelson· E. Stiefel Volume I . Part a Heinz Rutishauser Description of ALGOL 60 Springer-Verlag New York Inc. 1967 Prof. Dr. H. Rutishauser Eidgenossische Technische Hochschule Zurich Geschaftsfuhrende Herausgeber: Prof. Dr. B. Eckmann Eidgenossische Tecbnische Hocbscbule Zurich Prof. Dr. B. L. van der Waerden Matbematisches Institut der Universitat ZUrich Aile Rechte, insbesondere das der Obersetzung in fremde Spracben, vorbebalten Ohne ausdriickliche Genehmigung des Verlages ist es auch nicht gestattet, dieses Buch oder Teile daraus auf photomechaniscbem Wege (Photokopie, Mikrokopie) oder auf andere Art zu vervielfaltigen ISBN-13: 978-3-642-86936-5 e-ISBN-13: 978-3-642-86934-1 DOl: 10.1007/978-3-642-86934-1 © by Springer-Verlag Berlin· Heidelberg 1967 Softcover reprint of the hardcover 1st edition 1%7 Library of Congress Catalog Card Number 67-13537 Titel-Nr. 5l1B Preface Automatic computing has undergone drastic changes since the pioneering days of the early Fifties, one of the most obvious being that today the majority of computer programs are no longer written in machine code but in some programming language like FORTRAN or ALGOL. However, as desirable as the time-saving achieved in this way may be, still a high proportion of the preparatory work must be attributed to activities such as error estimates, stability investigations and the like, and for these no programming aid whatsoever can be of help.
    [Show full text]
  • Publiek Domein Laat Bedrijven Te Veel Invullen
    Steven Pemberton, software-uitvinder en bouwer aan het World wide web Publiek domein laat bedrijven te veel invullen De Brit Steven Pemberton is al sinds 1982 verbonden aan het Centrum voor Wiskunde Informatica (CWI) in Amsterdam. Ook hij is een aartsvader van het internet. Specifiek van het World wide web, waarvan hij destijds dicht bij de uitvinding zat. Steven blijft naar de toekomst kijken, nog met dezelfde fraaie idealen. C.V. 19 februari 1953 geboren te Ash, Surrey, Engeland 1972-1975 Programmeur Research Support Unit Sussex University 1975-1977 Research Programmer Manchester University 1977-1982 Docent Computerwetenschap Brighton University 1982-heden Onderzoeker aan het Centrum voor Wiskunde & Informatica (CWI) Verder: 1993–1999 Hoofdredacteur SIGCHI Bulletin en ACM Interactions 1999–2009 Voorzitter HTML en XHTML2 werkgroepen van W3C 2008-heden Voorzitter XForms werkgroep W3C The Internet Guide to Amsterdam Homepage bij het CWI Op Wikipedia 1 Foto’s: Frank Groeliken Tekst: Peter Olsthoorn Steven Pemberton laat zich thuis interviewen, op een typisch Amsterdamse plek aan de Bloemgracht, op de 6e etage van een pakhuis uit 1625 met uitzicht op de Westertoren. Hij schrijft aan een boek, een voortzetting van zijn jaarlijkse lezing in Pakhuis de Zwijger, met in 2011 The Computer as Extended Phenotype (Computers, Genes and You) als titel. Wat is je thema? “De invloed van hard- en software op de maatschappij, vanuit de nieuwe technologie bezien. ‘Fenotype’ gaat over computers als product van onze genen, als een onderdeel van de evolutie. Je kunt de aanwas van succesvolle genen zien als een vorm van leren, of een vorm van geheugen.
    [Show full text]
  • Police Response to Gangs: a Multi-Site Study
    The author(s) shown below used Federal funds provided by the U.S. Department of Justice and prepared the following final report: Document Title: Police Response to Gangs: A Multi-Site Study Author(s): Charles M. Katz; Vincent J. Webb Document No.: 205003 Date Received: April 2004 Award Number: 98-IJ-CX-0078 This report has not been published by the U.S. Department of Justice. To provide better customer service, NCJRS has made this Federally- funded grant final report available electronically in addition to traditional paper copies. Opinions or points of view expressed are those of the author(s) and do not necessarily reflect the official position or policies of the U.S. Department of Justice. Police Response to Gangs: A Multi-Site Study 1 Prepared for the National Institute of Justice by Charles M. Katz Vincent J. Webb Department of Criminal Justice and Criminology December 2003 Phoenix, Arizona 1 This research report was funded by the National Institute of Justice, Grant No. 1998-IJ-CX-0078. The opinions expressed in the report are those of the authors and are not necessarily those of the National Institute of Justice. Table of Contents Abstract ................................................................................................................................ i Research Goals and Objectives ........................................................................................ i Research Design and Methodology.................................................................................. i Research Results and Conclusions..................................................................................ii
    [Show full text]
  • An Interview with Tony Hoare ACM 1980 A.M. Turing Award Recipient
    1 An Interview with 2 Tony Hoare 3 ACM 1980 A.M. Turing Award Recipient 4 (Interviewer: Cliff Jones, Newcastle University) 5 At Tony’s home in Cambridge 6 November 24, 2015 7 8 9 10 CJ = Cliff Jones (Interviewer) 11 12 TH = Tony Hoare, 1980 A.M. Turing Award Recipient 13 14 CJ: This is a video interview of Tony Hoare for the ACM Turing Award Winners project. 15 Tony received the award in 1980. My name is Cliff Jones and my aim is to suggest 16 an order that might help the audience understand Tony’s long, varied, and influential 17 career. The date today is November 24th, 2015, and we’re sitting in Tony and Jill’s 18 house in Cambridge, UK. 19 20 Tony, I wonder if we could just start by clarifying your name. Initials ‘C. A. R.’, but 21 always ‘Tony’. 22 23 TH: My original name with which I was baptised was Charles Antony Richard Hoare. 24 And originally my parents called me ‘Charles Antony’, but they abbreviated that 25 quite quickly to ‘Antony’. My family always called me ‘Antony’, but when I went to 26 school, I think I moved informally to ‘Tony’. And I didn’t move officially to ‘Tony’ 27 until I retired and I thought ‘Sir Tony’ would sound better than ‘Sir Antony’. 28 29 CJ: Right. If you agree, I’d like to structure the discussion around the year 1980 when 30 you got the Turing Award. I think it would be useful for the audience to understand 31 just how much you’ve done since that award.
    [Show full text]