Adriaan Van Wijngaarden and the Start of Computer Science in the Netherlands

Total Page：16

File Type：pdf, Size：1020Kb

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 Nederlands Genootschap voor Informatica 1959 started International Federation for Information Processing 1961 - 1980 Director of Mathematical Centre 1952 - 1981 Professor Numerical Mathematics at UvA PhD students 1956 Willem van der Poel 1958 Nicolaas de Troye 1959 Edsger Dijkstra 1960 Guus Zoutendijk 1964 Jacob Zonneveld 1967 Jaco de Bakker 1968 Reinder van de Riet 1968 Barry Mailloux 1969 Jacobus Verhoeff 1970 Hugo Brandt Corstius 1971 Maarten van Emden 1974 Peter van Emde Boas 1976 Herman te Riele 1982 Dick Grune PhD students 1956 Willem van der Poel 1958 Nicolaas de Troye 1959 Edsger Dijkstra 1960 Guus Zoutendijk 1964 Jacob Zonneveld 1967 Jaco de Bakker 1968 Reinder van de Riet 1968 Barry Mailloux 1969 Jacobus Verhoeff 1970 Hugo Brandt Corstius 1971 Maarten van Emden 1974 Peter van Emde Boas 1976 Herman te Riele 1982 Dick Grune PhD students 1956 Willem van der Poel 1958 Nicolaas de Troye 1959 Edsger Dijkstra 1960 Guus Zoutendijk 1964 Jacob Zonneveld 1967 Jaco de Bakker 1968 Reinder van de Riet 1968 Barry Mailloux 1969 Jacobus Verhoeff 1970 Hugo Brandt Corstius 1971 Maarten van Emden 1974 Peter van Emde Boas 1976 Herman te Riele 1982 Dick Grune PhD students 1956 Willem van der Poel 1958 Nicolaas de Troye 1959 Edsger Dijkstra 1960 Guus Zoutendijk 1964 Jacob Zonneveld 1967 Jaco de Bakker 1968 Reinder van de Riet 1968 Barry Mailloux 1969 Jacobus Verhoeff 1970 Hugo Brandt Corstius 1971 Maarten van Emden 1974 Peter van Emde Boas 1976 Herman te Riele 1982 Dick Grune @ .

Copy Link

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 inﬂuential 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]
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]
195907-08.Pdf
IS LEMETER \GNETICS " IPPORTS IE WEIGHT ONE ~/ ./ )UNG .EPHANT s a jaster, more reliable memory, too! LLY TEST t we hope it attracts your ention to the thorough "ee-stage inspection and testing len every TELEMETER MAGNETICS ~mory product - from core to ray to buffers and memory systems. .C·l!r~.····~ ')1 r·,1 :!~:rIGS arufac'c;re: th" :-;)em;~r)' sy:;te;' complete from core pro- du~;t i::: irin.c: t ~is':,j ... and because TElEf~ETER MAGr'lETIGS tests FlU cal ;~e tnat milch :;ur~i when you specify memory ",'!;ar 'lJ':\::~~ mernar! "y~tems to satisfy practically any :;)t)figuf?t:on. linns :-;f :1:'''-' Hl to 1,~:;;O,OOU bits are COlllmon.,. memories can be iiiuil ~,il' :i, a:j:jitic;n, n.~! offers you :\ selection of memory up:t~, ":ili! r:vr.ie tirnl?s of ;,1 microsecond:;, 6 to 8 microseconds, ilnd 3 microseconds. i::', IIII'll/un s(uclt JUT [i.':cti or:ic circu in TEU:W::n:R f,li'IGNH!GS menlOl y systems employ solid state elements a '20-lIIir'f"()s(,(,()lId "ystem 20 Jf! UfJld., ui 2'2 liI',,\ I'll!'!! ilrc on n!il;,-in (>W;'j tor com~~3ctness anti mainten'lf]ce ease, I' .7 , / (':'! .' ,I .r ) / f '/ • ,'f ,. r' t ,.' f ( ,r .... I I j • ~ ~. / i "'(" ( ,: r I .~ • I i j' I ' { i I [ • / (~ '. \ ,\fulIu/ul'lur l '/'. ,,!, 1PORTAlH JOB OPPORTUNITIES liJ\11tW,ilffii j itJit:Il": l,~ill( ,1i(~i'tllijH !~'fu.;liT:USdjll\Ji~t !!lDH tfUfjjlF~l~ !!i~'(~:iij»; TELEMETER MAGNETICS Inc.
[Show full text]
Saskia Lourens Writing His-1
UvA-DARE (Digital Academic Repository) Writing history : national identity in André Brink's post-apartheid fiction Lourens, S.T. Publication date 2009 Document Version Final published version Link to publication Citation for published version (APA): Lourens, S. T. (2009). Writing history : national identity in André Brink's post-apartheid fiction. General rights It is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), other than for strictly personal, individual use, unless the work is under an open content license (like Creative Commons). Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: https://uba.uva.nl/en/contact, or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible. UvA-DARE is a service provided by the library of the University of Amsterdam (https://dare.uva.nl) Download date:30 Sep 2021 WRITING HISTORY: NATIONAL IDENTITY IN ANDRÉ BRINK’S POST-APARTHEID FICTION ACADEMISCH PROEFSCHRIFT ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam op gezag van de Rector Magnificus prof. dr. D. C. van den Boom ten overstaan van een door het college voor promoties ingestelde commissie, in het openbaar te verdedigen in de Aula der Universiteit op woensdag 28 oktober 2009, te 10:00 uur door Saskia Theodora Lourens geboren te Port Elizabeth, Zuid Afrika 1 Promotiecommissie Promotor: prof.
[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]
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]
Gerrit Van Der Mey Met DrieËnzestig Symbolen
312 NAW 5/6 nr. 4 december 2005 Met drieënzestig symbolen Willem van der Poel Willem van der Poel Faculteit Elektrotechniek Wiskunde en Informatica Technische Universiteit Delft postbus 5, 2600 AA Delft [email protected] Geschiedenis Gerrit van der Mey Met drieënzestig symbolen Zevenentwintig jaar lang is de doof-blinde gehoorvermogen en daarmee ook het even- voel bij het spreken en het zelf voelen van de wiskundige Gerrit van der Mey een van de me- wichtsgevoel. Het kostte hem een flinke tijd trillingen. Hij noemde dat zelf het oergehoor. dewerkers van Willem van der Poel geweest. om op het spiergevoel in de voeten te leren Bij het lormen of spreken met de braillema- Hij had een cruciale rol in de ontwikkeling van lopen. Na veel oefenen slaagde hij erin om chine sprak hij zelf altijd mee wat hij hoorde, software voor de ZEBRA en latere computers. weer zelfstandig met zijn geleidehond overal waardoor een geroutineerde spreker woorden Door zijn dubbele handicap zijn zijn verrich- te komen. kon afbreken zodra ze goed ‘geraden’ waren. tingen in de publieke literatuur onderbelicht In die tijd hebben zijn ouders veel voor Dat er een inwendig eigen gehoor was bleek gebleven. Ten onrechte. hem gedaan. Zo ontstond in die tijd het brail- ook duidelijk uit het feit dat hij zijn hele ver- ledoosje, een zeer klein apparaatje met zes dere leven altijd met uitstekende dictie is blij- Gerrit van der Mey werd geboren op 5 janu- toetsen die direct de pennetjes in de vorm ven spreken. Alleen bij het spreken voor pu- ari 1914 als zoon van een bekende bollen- van een brailleletter omhoog brachten.
[Show 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 reﬁnement 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.
[Show full text]
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 Scientiﬁc 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.
[Show full text]
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 ﬁrst 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.
[Show full text]
Turing's Universal Machine
Appendix Turing’s Universal Machine This appendix gives the complete table for the universal Turing machine U. There were a number of errors in Turing’s original paper, as pointed out by Emil Post and Donald Davies.1 These errors have been corrected in the tables below. A.1 General Purpose m-functions The tape of the universal machine uses the convention of alternating F-squares and E-squares, described in Sect. 4.5, where the E-squares are used to mark, or label, symbols on the preceding F-squares. The leftmost point of the portion of the tape used in the computation is identified by means of the symbol e placed in a pair of adjacent squares. f(C, B,α): find The m-function f(C, B,α) finds the leftmost occurrence on the tape of the symbol α, and then moves to m-configuration C. If there is no occurrence of α on the tape, the machine moves to m-configuration B. m-config. symbol operations final m-config. e L f1(C, B,α) f(C, B,α) e not L f(C, B,α) ⎧ ⎨ α C f1(C, B,α) ⎩ not αR f1(C, B,α) None R f (C, B,α) ⎧ 2 ⎨ α C f2(C, B,α) ⎩ not αR f1(C, B,α) None R B 1See Post (1947) and Davies (2004). Davies describes Turing’s “impatience” when these errors were pointed out, remembering that he “made it clear that I was wasting my time and his by my worthless endeavors”. M. Priestley, A Science of Operations, History of Computing, 307 DOI 10.1007/978-1-84882-555-0, © Springer-Verlag London Limited 2011 308 Turing’s Universal Machine e(C, B,α): erase The m-function e(C, B,α)erases the leftmost occurrence on the tape of the symbol α, and then moves to m-configuration C.
[Show full text]
O Caso Da Literatura Electrónica De Pedro Barbosa
MESTRADO MULTIMÉDIA - ESPECIALIZAÇÃO EM TECNOLOGIAS EDIÇÕES CRÍTICAS DIGITAIS: O CASO DA LITERATURA ELECTRÓNICA DE PEDRO BARBOSA Carlos Filipe Lopes do Amaral M 2015 FACULDADES PARTICIPANTES: FACULDADE DE ENGENHARIA FACULDADE DE BELAS ARTES FACULDADE DE CIÊNCIAS FACULDADE DE ECONOMIA FACULDADE DE LETRAS Edições Críticas Digitais: O Caso da Literatura Electrónica de Pedro Barbosa Carlos Filipe Lopes do Amaral Mestrado em Multimédia da Universidade do Porto Orientador: Rui Torres (Professor Associado com Agregação da Faculdade de Ciências Humanas e Sociais da Universidade Fernando Pessoa) Co-orientador: João Correia Lopes (Professor Auxiliar da Faculdade de Engenharia da Universidade do Porto) 31 de Julho de 2015 c Carlos Amaral, 2015 Edições Críticas Digitais: O Caso da Literatura Electrónica de Pedro Barbosa Carlos Filipe Lopes do Amaral Mestrado em Multimédia da Universidade do Porto Aprovado em provas públicas pelo Júri: Presidente: Nuno Flores (Professor Auxiliar da Faculdade de Engenharia da Universidade do Porto) Vogal Externo: José Manuel Torres (Professor Associado da Faculdade de Ciências e Tecnologia da Universidade Fernando Pessoa) Orientador: Rui Torres (Professor Associado, com Agregação, da Faculdade de Ciências Humanas e Sociais da Universidade Fernando Pessoa) Resumo As edições críticas digitais são colecções de obras nascidas no seio digital, e operam como arquivos digitais — contemplando a interactividade e o comentário crítico. A literatura electrónica rege-se por uma multitude de práticas literárias que tira partido das capacidades e contextos proporcionados pelo computador — consequentemente, é o resultado ou produto da actividade literária realizada no computador. Pedro Barbosa, autor de literatura gerada por computador, é uma ﬁgura central no campo da literatura electrónica e na produção de obras de arte nascidas no meio digital especialmente pela sua presença remontar aos inícios da computação até às práticas de criação artística no computador vigentes na conjuntura tecnológica contemporânea.
[Show full text]