Publiek Domein Laat Bedrijven Te Veel Invullen
Total Page:16
File Type:pdf, Size:1020Kb
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! -
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. -
AB42.4.8 REMARKS on ABSTRACTO Leo Geurts Lambert
AB42 p. 56 AB42.4.8 REMARKS ON ABSTRACTO Leo Geurts Lambert Meertens Mathematlsch Centrum, Amsterdam I. ABSTRACTO LIVES If an author wants to describe an algorithm, he has to choose a vehicle to express himself. The "traditional" way is to give a description in some natural language, such as English. This vehicle has some obvious drawbacks. The most striking one is that of the sloppyness of natural languages. Hill [|] gives a convincing (and hilarious) exposition of ambiguities in ordinary English, quoting many examples from actual texts for instructional or similar purposes. The problem is often not so much that of syntactical ambiguities ("You would not recognise little Johnny now. He has grown another foot.") as that of unintended possible interpretations ("How many times can you take 6 away from a million? [...] I can do this as many times as you like."). A precise and unambiguous description may require lengthy and repetitious phrases. The more precise the description, the more difficult it is to understand for many, if not most, people. Another drawback of natural languages is the inadequacy of referencing or grouping methods (the latter for lack of non-parenthetical parentheses). This tends to give rise to GOTO-like instructions. With the advent of modern computing automata, programming languages have been invented to communicate algorithms to these computers. Programming languages are almost by definition precise and unambiguous. Nevertheless, they do not provide an ideal vehicle for presenting algorithms to human beings. The reason for this is that programming languages require the specification of many details which are relevant for the computing equipment but not for the algorithm proper. -
301669474.Pdf
Centrum voor Wiskunde en Informatica Centre for Mathematics and Computer Science L.G.L.T. Meertens Paramorphisms Computer Science/ Department of Algorithmics & Architecture Report CS-R9005 February Dib'I( I, 1fle.'1 Cootrumvoor ~', ;""'" ,,., tn!o.-1 Y.,'~• Am.,t,..-(,';if'! The Centre for Mathematics and Computer Science is a research institute of the Stichting Mathematisch Centrum, which was founded on February 11, 1946, as a nonprofit institution aiming at the promotion of mathematics, com puter science, and their applications. It is sponsored by the Dutch Govern ment through the Netherlands Organization for the Advancement of Research (N.W.O.). Copyright © Stichting Mathematisch Centrum, Amsterdam Paramorphisms Lambert Meertens CWI, Amsterdam, & University of Utrecht 0 Context This paper is a small contribution in the context of an ongoing effort directed towards the design of a calculus for constructing programs. Typically, the development of a program contains many parts that are quite standard, re quiring no invention and posing no intellectual challenge of any kind. If, as is indeed the aim, this calculus is to be usable for constructing programs by completely formal manipulation, a major concern is the amount of labour currently required for such non-challenging parts. On one level this concern can be addressed by building more or less spe cialised higher-level theories that can be drawn upon in a derivation, as is usual in almost all branches of mathematics, and good progress is being made here. This leaves us still with much low-level laboriousness, like admin istrative steps with little or no algorithmic content. Until now, the efforts in reducing the overhead in low-level formal labour have concentrated on using equational reasoning together with specialised notations to avoid the introduction of dummy variables, in particular for "canned induction" in the form of promotion properties for homomorphisms- which have turned out to be ubiquitous. -
CWI Scanprofile/PDF/300
Centrum voor Wiskunde en lnformatica Centre for Mathematics and Computer Science L.G.L.T. Meertens, S. Pemberton An implementation of the B programming language Department of Computer Science Note CS-N8406 June Biblioiiie.:;I( ~'~'l'i't'Hm.n<' Wi~f.i;r;de- c11 !nform;:,;i:i.C<a - Ams1errJar11 AN IMPLEMENTATION OF THE B PROGRAMMING LANGUAGE L.G.L.T. MEERTENS, S. PEMBERTON CentPe foP Mathematics and ComputeP Science~ AmstePdam Bis a new programming language designed for personal computing. We describe some of the decisions taken in implementing the language, and the problems involved. Note: B is a working title until the language is finally frozen. Then it will acquire its definitive name. The language is entirely unrelated to the predecessor of C. A version of this paper will appear in the proceedings of the Washington USENIX Conference (January 1984). 1982 CR CATEGORIES: 69D44. KEY WORDS & PHRASES: programming language implementation, progrannning envi ronments, B. Note CS-N8406 Centre f~r Mathematics and Computer Science P.O. Box 4079, 1009 AB Amsterdam, The Netherlands I The programming language B B is a programming language being designed and implemented at the CWI. It was originally started in 1975 in an attempt to design a language for beginners as a suitable replacement for BASIC. While the emphasis of the project has in the intervening years shifted from "beginners" to "personal computing", the main design objectives have remained the same: · • simplicity; • suitability for conversational use; • availability of tools for structured programming. The design of the language has proceeded iteratively, and the language as it now stands is the third iteration of this process. -
Ezért Érdemes Pythonban Fejleszteni Dr.Guta Gábor
Ezért érdemes Pythonban fejleszteni Dr.Guta Gábor http://axonmatics.com Mennyire népszerű? index/ (7) - Forrás: https://www.tiobe.com/tiobe Forrás: 2019 (C) Axonmatics Ltd. - Air Quality Monitoring and Control for a Confidential Healthier City http://axonmatics.com 2019.11.27. – Dr. Guta Gábor Miért népszerű? Az ABC nyelv elveinek a továbbgondolása: • Egyszerű, python • Kompakt, - • Strukturált, • Kifejező, • Egységes, • Magas-szintű, https://freesvg.org/happy : • Egyértelmű, Forrás • Interaktív (Adaptálva: Leo Geurts, Lambert Meertens, and Steven Pemberton: The ABC Programmer's Handbook) http://axonmatics.com 2019.11.27. – Dr. Guta Gábor Miért népszerű? (folyt.) Hatékonyság: • Megvalósítandó feladat/ráfordított idő python - • Átlagos commit méret (KLOC-ban) Elérhetőség: https://freesvg.org/happy • Eszköz támogatás : • Oktató anyag/dokumentáció Forrás • Képzett emberek http://axonmatics.com 2019.11.27. – Dr. Guta Gábor Miért lehet utálni? mouth • Formázás (tabulálás) - • Nincs típusosság (de, van) • Nem olyan mint a megszokott/kedvenc programozási nyelv http://www.peakpx.com/5335/python • Lassú (általában ez nem gond, Forrás: de orvosolható) (Környezetemben hangzottak el) http://axonmatics.com 2019.11.27. – Dr. Guta Gábor Kik használják a nagyvilágban? • Web oldalak: Instagram, YouTube, Printest, Prezi… “Python where we • Cégek: Dropbox, Google, can, C++ where Bloomberg, Spotify… we must.” • Alkalmazások: Gedit, yum, Home Assistant, Cura… http://axonmatics.com 2019.11.27. – Dr. Guta Gábor Mire használják a nagyvilágban? 2019/python/ Fejlesztők -
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. -
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. -
Final Version
Centrum Wiskunde & Informatica Software Engineering Software ENgineering A comparison between the ALGOL 60 implementations on the Electrologica X1 and the Electrologica X8 F.E.J. Kruseman Aretz REPORT SEN-E0801 SEPTEMBER 2008 Centrum Wiskunde & Informatica (CWI) is the national research institute for Mathematics and Computer Science. It is sponsored by the Netherlands Organisation for Scientific Research (NWO). CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI's research has a theme-oriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms. Probability, Networks and Algorithms (PNA) Software Engineering (SEN) Modelling, Analysis and Simulation (MAS) Information Systems (INS) Copyright © 2008, Centrum Wiskunde & Informatica P.O. Box 94079, 1090 GB Amsterdam (NL) Kruislaan 413, 1098 SJ Amsterdam (NL) Telephone +31 20 592 9333 Telefax +31 20 592 4199 ISSN 1386-369X A comparison between the ALGOL 60 implementations on the Electrologica X1 and the Electrologica X8 ABSTRACT We compare two ALGOL 60 implementations, both developed at the Mathematical Centre in Amsterdam, forerunner of the CWI. They were designed for Electrologica hardware, the EL X1 from 1958 and the EL X8 from 1965. The X1 did not support ALGOL 60 implementation at all. Its ALGOl 60 system was designed by Dijkstra and Zonneveld and completed in 1960. Although developed as an academic exercise it soon was heavily used and appreciated. The X8, successor of the X1 and (almost) upwards compatible to it, had a number of extensions chosen specifically to support ALGOL 60 implementation. The ALGOL 60 system, developed by Nederkoorn and Kruseman Aretz, was completed even before the first delivery of an X8. -
Bibliography 161
160 Biblio graphy [1] C. J. Aarts, R. C. Backhouse, P. Ho ogendijk, T. S. Vo ermans, and J. van der Woude, ARelational Theory of Datatypes. Available via anonymous ftp from ftp.win.tue.nl in directory pub/math.prog.construction, Eindhoven University of Technology 1992. [2] H. Abrahamson and V. Dahl, Logic Grammars. Springer-Verlag 1989. [3] Peter Aczel, An introduction to Inductive De nitions. In: Handb o ok of Mathematical Logic (ed. Jon Barwise), North Holland 1977, pp. 739{782. [4] Peter Aczel, Non-wel l-founded Sets. CSLI Lecture Notes no. 14, Stanford 1988. [5] Roland Backhouse, Paul Chisholm, Grant Malcolm, and Erik Saaman, Do-it-yourself type theory. Formal Asp ects of Computing 1 (1989), pp. 19{84. [6] R.C. Backhouse, On a Relation on Functions. In: Beauty Is Our Business|A Birthday Salute to Edsger W. Dijkstra (ed. W.H.J. Feijen e.a.), Springer Verlag 1990, pp. 7{18. [7] R.C. Backhouse, P.J. de Bruin, G.R. Malcolm, T.S. Vo ermans, and J.C.S.P. van der Woude, Relational catamorphisms. In: Constructing Programs From Sp eci cations, North Holland 1991, pp. 287{318. [8] Roland Backhouse and Henk Do ornb os, Mathematical Induction Made Calculational. CS- rep ort 94-16, Eindhoven University of Technology 1994. [9] E.S. Bainbridge, P.J. Freyd, A. Scedrov, and P.J. Scott, Functorial Polymorphism. Theo- retical Computer Science 70 (1990), pp. 35{64. [10] Erik Barendsen and Marc Bezem, Bar Recursion versus Polymorphism.Technical Rep ort 81, Utrecht Research Institute for Philosophy, Utrecht University 1991. -
Adriaan Van Wijngaarden and the Start of Computer Science in the Netherlands
Adriaan van Wijngaarden and the start of computer science in the Netherlands Jos Baeten, Centrum Wiskunde & Informatica and Institute for Logic, Language and Computation, UvA Adriaan van Wijngaarden and the start of computer science in the Netherlands Jos Baeten, Centrum Wiskunde & Informatica and Institute for Logic, Language and Computation, UvA Adriaan van Wijngaarden 2 November 1916 – 7 February 1987 Graduated TH Delft Mechanical Engineering 1939 PhD TH Delft on calculations for a ship propellor 1945 London February 1946: look at mathematical machines Stichting Mathematisch Centrum 11 February 1946 Mathematics as a service Pure mathematics department Statistics department Computing department (1947) Applied mathematics department (1948) 1 January 1947 head of computing department 1 January 1947 head of computing department ‘Girls of Van Wijngaarden’ 1947: in the UK, also USA Met Turing, Von Neumann, others Plantage Muidergracht 6 Automatische Relais Rekenmachine Amsterdam Tweede Boerhaavestraat 49 ARRA II N.V. Elektrologica, 1957 Algol 60 • In 1955, committee started on unified notation of computer programs • Friedrich Bauer, 1958, International Algebraic Language • 1959, Algorithmic Language, Van Wijngaarden and Dijkstra join • 1960 editor of Algol 60 report • Separation of hardware and software Algol 68 IFIP Working Group 2.1 taking the lead Starts formal language theory (Chomsky’s universal grammar) Van Wijngaarden grammars Reasoning about language and programs Some achievements 1958 started Nederlands RekenMachine Genootschap -
Scaling Functional Synthesis and Repair
Scaling Functional Synthesis and Repair Thèse N° 8716 Présentée le 11 janvier 2019 à la Faculté informatique et communications Laboratoire d’analyse et de raisonnement automatisés Programme doctoral en informatique et communications pour l’obtention du grade de Docteur ès Sciences par EMMANOUIL KOUKOUTOS Acceptée sur proposition du jury Prof. C. Koch, président du jury Prof. V. Kuncak, directeur de thèse Prof. S. Khurshid, rapporteur Prof. D. Marinov, rapporteur Prof. M. Odersky, rapporteur 2019 Acknowledgements First and foremost, I would like to thank my advisor Viktor Kuncak, for accepting me into his lab, and generously providing his guidance, knowledge, encouragement and support during my PhD studies. This thesis would not have been possible without him. Second, I would like to thank my thesis committee members Christoph Koch, Martin Odersky, Darko Marinov and Sarfraz Khurshid, for taking the time to evaluate my thesis, and for their valuable and extensive comments on it, which helped it improve greatly to its current form. Third, I would like to thank my colleagues Etienne Kneuss, Mukund Ragothaman, Ravishadran Kandhadai Madhavan, Régis Blanc, Mikael Mayer, Nicolas Voirol, Romain Edelmann, Eva Darulova, Andreas Pavlogiannis, Georg Schmid, Jad Hamsa, Romain Ruetschi, and Sarah Sallinger, for our collaboration, exchange of ideas, and the welcoming and creative atmosphere they maintained in the lab. A special thanks goes to Etienne for our great collaboration, and his guidance and patience when he was helping me acclimate during my first months in the lab. Also, I would like to thank Fabien Salvi, Yvette Gallay and Sylvie Jankow, for helping all of us to work unobstructed with their technical and administrative support.