DOCSLIB.ORG

IFIP Information Bulletin January 2018

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
IFIP Information Bulletin January 2018 January 2018 – No.48 Information Bulletin International Federation for Information Processing ( www.ifip.org ) IFIP SECRETARIAT HOFSTRASSE 3 A-2361 LAXENBURG AUSTRIA, EUROPE General Secretary: Eduard DUNDLER Administrative Assistant s: Brigitte BRAUNEIS Marion SMITH Telephone: +43 2236 73 616 Telefax: +43 2236 73 616 9 e-mail: [email protected] Internet-URL: http://www.ifip.org 2 TABLE OF CONTENTS IFIP'S PAST PRESIDENTS ............................................................................................................................... 4 IFIP'S HONORARY MEMBERS ......................................................................................................................... 4 INTRODUCTION ............................................................................................................................................... 5 IFIP'S MISSION STATEMENT ........................................................................................................................... 5 IFIP IN PERSPECTIVE ...................................................................................................................................... 6 ORIGINS ....................................................................................................................................................... 6 MEMBERSHIP .............................................................................................................................................. 6 ORGANISATION ........................................................................................................................................... 6 CONGRESSES AND MAJOR CONFERENCES ............................................................................................ 6 TECHNICAL ACTIVITIES .............................................................................................................................. 6 PUBLICATIONS ............................................................................................................................................ 7 IFIP NEWS .................................................................................................................................................... 7 RELATIONSHIPS .......................................................................................................................................... 7 IFIP SECRETARIAT ...................................................................................................................................... 7 STANDARD INFORMATION ............................................................................................................................. 8 IFIP COUNCIL ............................................................................................................................................... 8 IFIP GENERAL ASSEMBLY .......................................................................................................................... 9 Honorary Members .................................................................................................................................... 9 Country Representative Members ............................................................................................................ 10 International Members at Large ............................................................................................................... 16 Ex-Officio Members ................................................................................................................................. 17 Associate Members ................................................................................................................................. 18 TECHNICAL COMMITTEES AND WORKING GROUPS .................................................................................. 19 TC 1 - FOUNDATIONS OF COMPUTER SCIENCE ..................................................................................... 19 TC 2 - SOFTWARE: THEORY AND PRACTICE .......................................................................................... 25 TC 3 - EDUCATION ..................................................................................................................................... 34 TC 5 - INFORMATION TECHNOLOGY APPLICATIONS ............................................................................. 38 TC 6 - COMMUNICATION SYSTEMS ......................................................................................................... 46 TC 7 - SYSTEM MODELING AND OPTIMIZATION ..................................................................................... 52 TC 8 - INFORMATION SYSTEMS ............................................................................................................... 57 TC 9 - ICT AND SOCIETY ........................................................................................................................... 67 TC 10 - COMPUTER SYSTEMS TECHNOLOGY ........................................................................................ 75 TC 11 - SECURITY AND PRIVACY PROTECTION IN INFORMATION PROCESSING SYSTEMS .............. 79 TC 12 - ARTIFICIAL INTELLIGENCE .......................................................................................................... 88 TC 13 - HUMAN-COMPUTER INTERACTION ............................................................................................. 93 TC 14 - ENTERTAINMENT COMPUTING ................................................................................................. 101 TECHNICAL COMMITTEE AND WORKING GROUP - AIMS AND SCOPES ................................................. 106 TC 1 - FOUNDATIONS OF COMPUTER SCIENCE - AIMS AND SCOPES ............................................... 106 TC 2 - SOFTWARE: THEORY AND PRACTICE - AIMS AND SCOPES ..................................................... 112 TC 3 - EDUCATION - AIMS AND SCOPES ............................................................................................... 121 TC 5 - INFORMATION TECHNOLOGY APPLICATIONS - AIMS AND SCOPES ........................................ 124 TC 6 - COMMUNICATION SYSTEMS - AIMS AND SCOPES .................................................................... 132 TC 7 - SYSTEM MODELING AND OPTIMIZATION - AIMS AND SCOPES ................................................ 138 TC 8 - INFORMATION SYSTEMS - AIMS AND SCOPES .......................................................................... 142 TC 9 – ICT AND SOCIETY - AIMS AND SCOPES ..................................................................................... 147 TC 10 - COMPUTER SYSTEMS TECHNOLOGY - AIMS AND SCOPES ................................................... 154 TC 11 - SECURITY AND PRIVACY PROTECTION IN INFORMATION PROCESSING SYSTEMS - AIMS AND SCOPES ........................................................................................................................................... 159 TC 12 - ARTIFICIAL INTELLIGENCE - AIMS AND SCOPES ..................................................................... 168 TC 13 - HUMAN-COMPUTER INTERACTION - AIMS AND SCOPES ........................................................ 174 TC 14 - ENTERTAINMENT COMPUTING - AIMS AND SCOPES .............................................................. 180 IFIP STANDING COMMITTEES (DEC-31-2017) ............................................................................................ 186 TECHNICAL ASSEMBLY (TA) ....................................................................................................................... 186 IFIP PUBLICATIONS ..................................................................................................................................... 187 NAME INDEX ................................................................................................................................................ 188 3 IFIP's PAST PRESIDENTS Isaac L. Auerbach U.S.A. 1960 - 1965 Ambros B. Speiser Switzerland 1965 - 1968 Anatol A. Dorodnicyn Russia 1968 - 1971 Heinz Zemanek Austria 1971 - 1974 Richard I. Tanaka U.S.A. 1974 - 1977 Pierre A. Bobillier Switzerland 1977 - 1983 Kaoru Ando Japan 1983 - 1986 Ashley W. Goldsworthy Australia 1986 - 1989 Blagovest H. Sendov Bulgaria 1989 - 1992 Asbjorn Rolstadas Norway 1992 - 1995 Kurt Bauknecht Switzerland 1995 - 1998 Peter Bollerslev Denmark 1998 - 2001 Robert Aiken U.S.A. 2001 Walter Grafendorfer Austria 2001 - 2002 Klaus Brunnstein Germany 2002 - 2007 Basie von Solms South Africa 2007 - 2010 Leon Strous Netherlands 2010 - 2016 IFIP's Honorary Members 1979: Dr. Richard Tanaka IFIP President 1974 - 1977 1989: Prof. Pierre A. Bobillier IFIP President 1977 - 1983 1997: Prof. Asbjorn Rolstadas IFIP President 1992 - 1995 1998: Acad. Blagovest Sendov IFIP President 1989 - 1992 1999: Prof. Ashley W. Goldsworthy IFIP President 1986 - 1989 1999: Mr Graham Morris IFIP Honorary Secretary 1996 - 1999 2001: Prof. Kurt Bauknecht IFIP President 1995 - 1998 2014: Prof. Sebastiaan von Solms IFIP President 2007 - 2010 2017: Mr Leon Strous IFIP President 2010 - 2016 4 INTRODUCTION This publication is an edited subset of a comprehensive database which is regularly updated and is accessible through international networks. In particular the “electronic Bulletin” contains detailed statements of aims and scope for every Working Group. A wide range of information is available electronically from the IFIP secretariat including the IFIP News, minutes of our General Assembly and Board meetings, IFIP documents and other valuable
Load more

Recommended publications
  • David T. C~Ai9 736 Edgewater [M J Wichita, Kansas 67230 (USA)
    _.., ,.i.'~...< ~~ ':' ..". PASCAL US~RS GROUP Pa.scal.N ews I.. NUMlsER ,< Iq COMMUNICATIONS ABOUT THE PROGRAMMING LANGUAGE PASCAL BVPASCALERS SE PT EMbER .,1980 ~,_v., j : ;,. ~ - EX LIBRIS: David T. C~ai9 736 Edgewater [M J Wichita, Kansas 67230 (USA) ' ... '-" .- . .. .,.- ... ., '-" -'. ..,. ...- .--'- -"--"'.". '. POLICY: PASCAL NEWS (15...Sep...80) * Pascal~ is the official but informal publication of the User's Group. * Pascal Newa contains all we (the editors) kriowabout Pascal; we use it as the vetlICIe to answer all inquiries because our physical energy and resources for answering individual requests are finite. As PUG grows, we unfortunately succumb to the reality of: 1. Having to insist that people ~o need to know "about Pascal" join PUG and read Pascal News - that is why we spend lime to produce, it! 2. Refusing to return phone calls or answer letters full of questions - we will pass the questions on to the readership of Pascal News. Please understand what the collective effect of individual inquirie8lias at the "concentrators" (our phones and mailboxes). We are trying honestly to say: "We cannot promise more that we can do." ' * Pascal News is produced 3 or4 times during a year; usually in March, June, September, and December. * ALL THE NEWS THAT'S FIT, WE PRINT .Please send material (brevity is a virtue) for Pascal News single-spaced and camera-ready (use dark ribbon and 18.5 em lines!) '. - ~ * Remember : ALL LETTERS TO US WILL BE PRINTED UNLESS THEY CONTAIN A REQUEST u TO THE CONTRARY. -.- * Pascal News is divided into flexible sections: o POLICY - explains the way we do things (ALL-PURPOSE COUPON, etc.) EDITOR'S CONTRIBUTION - passes along the opinion and point of view of the D.
    [Show full text]
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • Big Data Everywhere, and No SQL in Sight Editorial: from SIGKDD Chairman Usama M
    Big Data Everywhere, and No SQL in Sight Editorial: from SIGKDD Chairman Usama M. Fayyad Chairman, SIGKDD Executive Committee Executive Chairman, Oasis500 – www.oasis500.com Chairman & CTO, Blue Kangaroo (ChoozOn Corp) [email protected] ABSTRACT traditional data storage and management state-of-the-art. Usually these limits are tested on 3 major fronts: the 3-V’s: Volume, As founding editor-in-chief of this publication, I used to Velocity, and Variety. I like to talk about the 4-V’s of data systematically address our readers via regular editorials. In mining, where the 4th V stands for Value: delivering insights and discussions with the current Editor-in-Chief, Bart Goethals, we business value from the data. More on this topic in a future decided that it may be a good idea to restore the regular editorial Editorial. For now, I would like to focus on some of the section from me as SIGKDD Chairman/director. So this is a first opportunities and threats arising from this developing situation. in what hopefully will be a regularly occurring event. This Editorial contribution discusses the issues facing the fields of data 2. BREAKDOWN IN THE RELATIONAL mining and knowledge discovery, including challenges, threats DATABASE WORLD and opportunities. In this Editorial we focus on the emerging area While most relational database researchers and practitioners are of BigData and the concerns that we are not contributing at the still living in denial about what is going on, what I am witnessing level we should to this important field. We believe we have a is nothing short of a major breakdown.
    [Show full text]
  • Organization List
    KDD’13 Conference on Knowledge Discovery & Data Mining Organization List General Co-Chairs: Robert L. Grossman, Univ. of Chicago and Open Data Group Ramasamy Uthurusamy, General Motors Corporation, Ret. Program Co-Chairs: Inderjit S. Dhillon, University of Texas Yehuda Koren, Google Industry & Government Track Co-Chairs: Rayid Ghani, University of Chicago Ted E. Senator, SAIC Industry Practice Expo Co-Chairs: Paul Bradley, MethodCare Rajesh Parekh, Groupon Workshop Co-Chairs: Jian Pei, Simon Fraser University Jie Tang, Tsinghua University Tutorial Co-Chairs: W. Scott Spangler, IBM Research Zhi-Hua Zhou, Nanjing University Local Arrangements Chair: Bamshad Mobasher, DePaul University Meira Leonard, University of Chicago Exhibit and Demo Co-Chairs: Natasha Balac, San Diego Supercomputer Center, UCSD Hui Xiong, Rutgers University SIGKDD 2013 Awards Chair: Ying Li, Concurix Corporation SIGKDD 2013 Doctoral Dissertation Awards Chair: Bamshad Mobasher, DePaul University KDD Cup Chairs: Brian Dalessandro, Media6Degrees Claudia Perlich, Media6Degrees Ben Hamner, Kaggle William Cukierski, Kaggle Media and Publicity Co-Chairs: Ankur Teredesai, Univ of Washington – Tacoma Emilia Palaveeva, Yantra PR Panel Co-Chairs: Foster Provost, New York University Geoff Webb, Monash University Publications Co-Chairs: Jingrui He, Stevens Institute of Technology Jimeng Sun, IBM TJ Watson Research Center Social Network Co-Chairs: Gabor Melli, VigLink Inc Ron Bekkerman, Carmel Ventures Sponsorship Co-Chairs: Dou Shen, Baidu Michael Zeller, Zementis xxii Treasurer:
    [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]
  • 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
    [Show full text]
  • Conference Program
    The Third International Conference on Knowledge Discovery and Data Mining August 14–17 1997, Newport Beach, California Sponsored by the American Association for Artificial Intelligence Cosponsored by General Motors Research, The National Institute for Statistical Sciences, and NCR Corporation In cooperation with The American Statistical Association Welcome to KDD-97! KDD-97 Organization General Conference Chair William Eddy, Carnegie Mellon Sally Morton, Rand Corporation University Richard Muntz, University of California Ramasamy Uthurusamy, General Motors Charles Elkan, University of California at at Los Angeles Corporation San Diego Raymond Ng, University of British Usama Fayyad, Microsoft Research Columbia Program Cochairs Ronen Feldman, Bar-Ilan University, Steve Omohundro, NEC Research David Heckerman, Microsoft Research Israel Gregory Piatetsky-Shapiro, Heikki Mannila, University of Helsinki, Jerry Friedman, Stanford University GTE Laboratories Finland Dan Geiger, Technion, Israel Daryl Pregibon, Bell Laboratories Daryl Pregibon, AT&T Laboratories Clark Glymour, Carnegie Mellon Raghu Ramakrishnan, University of University Wisconsin, Madison Publicity Chair Moises Goldszmidt, SRI International Patricia Riddle, Boeing Computer Georges Grinstein, University of Services Paul Stolorz, Jet Propulsion Laboratory Massachusetts, Lowell Ted Senator, NASD Regulation Inc. Tutorial Chair Jiawei Han, Simon Fraser University, Jude Shavlik, University of Wisconsin at Canada Madison Padhraic Smyth, University of California, David Hand, Open University,
    [Show full text]
  • A Complete Bibliography of Publications in Science of Computer Programming
    A Complete Bibliography of Publications in Science of Computer Programming Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 23 July 2021 Version 2.85 Title word cross-reference .NET [1085, 1074]. 0 [195, 291, 202, 572, 183, 515, 265, 155, 192, 231, 243, 514, 245, 1980, 295, 156, 151, 206, 1 + 118 [2359]. 10 [91]. $102.50 [267, 268]. 146, 203, 213, 289, 285, 286, 287, 219, 244, 11 [95]. 12 [101]. 13 [103]. 14 [107]. 15 [112]. 207, 246, 182, 229, 153, 321, 296, 217, 208, 16 [117]. 18 [125]. 19 [131]. 2 [43]. 20 [147]. 297, 193, 180, 298, 67, 204, 267, 268, 194, 21 [160]. 22 [178]. 23 [190]. 24 [242]. 3 [47]. 216, 320, 181, 317, 145, 214, 266, 269, 397, 3=2 [693]. $31.25 [320]. 4 [54]. 5 [61]. 6 [66]. 169, 574, 390, 215, 173, 1976, 227, 185, 575, + 2 7 [72]. $74.25 [318]. 8 [77]. [2065, 2428]. 226, 318, 270, 201, 288, 166, 205, 196, 284, 3 [466]. [1492]. 1 [944]. fun [1352]. SCR [1723]. 230, 247, 248, 249, 250, 524]. 0-06-042225-4 M jj [1894]. CSP B [1280]. ∆IC [879]. E3 [180]. 0-12-064460-6 [214]. 0-12-274060-2 [523]. j [1050, 1534]. k [1890, 2529]. λ [146].
    [Show full text]
  • ISO-7185 Standard Pascal
    Pascal ISO 7185:1990 This online copy of the unextended Pascal standard is provided only as an aid to standardization. In the case of di erences between this online version and the printed version, the printed version takes precedence. Do not mo dify this do cument. Do not include this do cumentinanothersoftware pro duct. You may print this do cument for p ersonal use only. Do not sell this do cument. Use this information only for good; never for evil. Do not exp ose to re. Do not op erate heavy equipment after reading, may cause drowsiness. Do not read under the in uence of alcohol (although there havebeen several uncon rmed rep orts that alcohol actually improves the readability). The standard is written in English. If you have trouble understanding a particular section, read it again and again and again... Sit up straight. Eat your vegatables. Do not mumble. c ISO/IEC 1991 ISO/IEC 7185:1990(E) ii ISO/IEC 7185:1990(E) Acknowledgements The e orts are acknowledged of all those who contributed to the work of the BSI and ISO Pascal working groups, and in particular: Tony Addyman Harris Hall John Reagan Albrecht Biedl Carsten Hammer Mike Rees Bob Brewer Atholl Hay Arthur Sale Co en Bron Tony Hetherington Paula Schwartz David Burnett-Hall Steve Hobbs Barry Smith David Bustard Mel Jackson John Souter Barry Byrne Scott Jameson Manfred Stadel Klaus Daessler David Jones Bob Tennent Richard De Morgan David Joslin Tom Turba Norman Diamond KatsuhikoKakehi Eiiti Wada Bob Dietrich Olivier Lecarme Willem Wakker Ken Edwards Jim Miner David Watt Jacques Farre Wes Munsil Jim Welsh Bill Findlay Bill Price Brian Wichmann The e orts are acknowledged of all those who contributed to the work of JPC, and in particular: Michael Alexander Steven Hobbs David L.
    [Show full text]
  • 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.
    [Show full text]