DOCSLIB.ORG

CWI Scanprofile/PDF/300

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
CWI Scanprofile/PDF/300 ADAPI'ED: ADJUSTED; widened; rowed; NINE : EIGHI' plus one. hipped; voided. NONPROC : PLAIN ; format ; procedure ADIC : PRIORITY; monadic. with PARAMETERS MOID; reference to ADJUSTED: FITI'ED; procedured; united. NONPROC; structured with FIEIDS; .ALPHA : a ; b ; c ; d ; e ; f ; g ; h ; row of NONPROC ; UNITED • i ; j ; k ; 1 ; m ; n ; o ; p ; q ; NONROW: NONSTOWED; structured with r; S; t; U; V; W; X; y; z. FIEIDS. ANY: KIND; suppressible KIND; NONSTOWED : TYPE ; UNITED. replicatable KIND; NarION: .ALPHA; NOTION .ALPHA. replicatable suppressible KIND. NUMBER : one ; 'IWO ; THREE ; FOUR ; BITS : structured with row of boolean FIVE ; SIX ; SEVEN ; EIGHI' ; NINE. field LENGTHETY letter aleph. PACK : pack ; package. BOX : IMOODSETY box. PARAMETER: MODE parameter. BYTES: structured with row of character PARAMETERS : PARAMETER ; field LENGTHETY letter aleph. PARAMETERS and PARAMETER.. CLAUSE: MOID clause. PARAMETY : with PARAMETERS ; EMPTY. CLOSED: closed; collateral; conditional. PHRASE: declaration; CLAUSE. COERCEND : MOID FORM. PLAIN: INTREAL; boolean; character. COMPLEX: structured with real field PRAM: procedure with IMODE parameter letter r letter e and real field and RMODE parameter MOID; letter i letter m. procedure with RMODE parameter MOID. DIGIT: digit FIGURE. PRIMITIVE : integral ; real ; boolean EIGHI' : SEVEN plus one. character; format. EMPTY : . PRIORITY: priority NUMBER. FEAT : finn ; weak ; soft. PROCEDURE: procedure PARAMETY MOID. FIEID : MODE field TAG. REAL: LONGSETY real. FIEIDS FIEID ; FIEIDS and FIEID. REFETY: reference to; EMPTY. FIGURE: zero; one; two; three; four; RFIEIDSETY: and FIEIDS; EMPTY. five; six; seven; eight; nine. RMODE: MODE. FITI'ED: dereferenced; deprocedured. RMOODSETY : RMOODSETY and MOOD EMPTY. FIVE : FOUR plus one. ROWS: row of; ROWS row of. FORESE: ADIC formula; cohesion; base. ROWSETY : ROWS ; EMPTY. FORM : confrontation ; FORESE. ROWWSETY : ROWSETY. FOUR : THREE plus one. SEPARATOR : LIST separator INTEGRAL : LONGSETY integral. go on symbol; completer sequencer. INTREAL : INTEGRAL ; REAL. SEVEN : SIX plus one. KIND: sign; zero; digit; point; SIX: FIVE plus one. exponent; complex; string; character. SCME: serial; unitary CLOSED LENGTH: letter 1 letter o letter n choice; THEI.SE. letter g. SORT : strong ; FEAT. LENGTHETY : LENGTH LENGTHETY ; EMPTY. SORTETY : SORI' ; EMPTY. IEITER: letter .ALPHA; letter aleph. STIRM: strong; finn. LFIEIDSETY : FIEIDS and ; EMPTY. STOWED : structured with FIEIDS LIST: list; sequence. row of MODE. IMODE : MODE. STRING: row of character; character. IMOOD : MOOD and. STRONGETY: strong; EMPTY. IMOODS : IMOOD ; IMOODS IMOOD. TAG : IEITER ; TAG IEITER TAG DIGIT. IMOODSETY : MOOD and IMOODSETY ; EMPI'"i. THELSE: then; else. nvroor: MOOD and. THREE : 'IWO plus one. LONGSETY: long LONGSETY; EMPTY. 'IWO: one plus one. LOSEl'Y : IMOODSETY. TTI'E : PLAIN ; format ; PROCEDURE ; LOWPER: lower; upper. reference to MODE. MABEL : MODE mode ; label. UNITED union of IMOODS MOOD mode. MODE MOOD UNITED. VICTAL VIRACT ; formal. MOID MODE void. VIRACT virtual ; actual. MOOD TTI'E STOWED. Th-i.J.i Repo/Lt ha-6 been. Jteviewed by Tec.hn,,lc.a.l Commi.t:tee 2 on. P1togJta.mmin.g Lan.gua.gu an.d app1toved 601t public.a.:li..on. by :the Gen.e/ta.l A.61.>embly 06 the In.teJtn.a.:li..on.al Fedelta.:li..on. 601t In.60ll.ma.:li..on. PMc.Ul.>in.g. Rep1todu.c.tion. 06 .the Repo/Lt, 601t an.y pWtpo1.>e, bu..t only 06 :the whole .teld .toge:theJt wUh the c.ove1t-le.t.te1t, ,i_l.) ex.plic.Uly peltmU.ted wUhou..t 601tmaU.ty. Repo/Lt 06 IFIP TC 2 .to :the Gen.e/ta.l A.61.>embly 06 IFIP in. :the mafteJt 06 :the AfgoltliWc. Language ALGOL 68 A.t.tac.hed w.iU be 6oun.d :the 6,i,M.t Re.po/Lt on. :the Algo/tUWc. LaY19u.age ALGOL68, 1.>ubmi.t:ted wUh a 1tec.ommen.da.:Uon. 601t public.a.:Uon. un.de1t IFIP au&p,leu by Tec.h­ n,,lc.al Commi.t:tee 2 hr. 1tupon.1.>e .to a Jtequu.t 6Mm Woll.lung GMup 2. 1 (ALGOL) • Thl6 Wolt/un.g G1toup ha!.> been. cli.Jtec..ted, by TC 2, 601t a n.u.mbeJt 06 yea/ti.> .towa.tui.6 c.on.c.eJtn. 601t the duign. 06 c.ommon. p1to9Jta.mmin.g htn.gu.agu. VUJt,i,n.g ;th,LI.) :ti.me, TC 2 ha!.> Jtealized .the magn,,i,.tu.de an.d di66,lc.u.Uy 06 ;th,LI.) .tal.>k.. In .the c.oU/tl.>e 06 pU/tl.>u.,ln.g Ul.i 1tUpon.1.>ibili:ti..u, WG 2. 1 c.omm,i,1.)1.>ion.ed an.d ha!.> gu.,i,ded .the wo1tk. 06 .the 6ouJt. w.ted au.tho/ti.> 06 :the a.t.tac.hed Re.po/Lt and ha1.> 1.>:ta,t.ed w du,LJte .to ac.k.n.owledge :the. c.on.1.>ide1table e66o1Lt devoted by :thue men. .to .thw .tal.>k.. Th-i.J.i RepolLt, howeveJt, mLJ.1.>.t be Jtegaltded a-6 c.on.1.>.tl:tu.:ti..n.g molte :than. 1.>imply :the wo1tk 06 6ou.Jt au.tho/ti.>. I.ti.> c.on.ten.t ha!.> been in6lu.enc.ed .thltoughou..t and .the 1tuu.l.tl.> Me, ,i,n .the main, a c.on.1.>equenc.e 06 fuc.LJ.1.>1.>ion.1.> wUhin .the Wo1tun.g G1toup. The Repo/Lt ,i_l.), .thM, 1.>ubmi.t:ted by TC 2 a.-6 1tep1tuen.Ung .the c.u.JtJten.:t. c.on.1.>oli­ da.ted ou..tc.ome 06 WG 2.1 ac.tivay. Th-i.J.i dou no.t imply :that any membeJt 06 :the Wo1tung GMup nec.u1.>a.Jtil.y a91teu wUh eve1ty a1.>pec..t 06 .the undelt.taung nail. gu.aJtan.teu :that aU 1televan.t a1.>pec..tl.> 06 .the pMblem have been c.on.1.>ide1ted. In.deed, 6eM ha1.> be.en ex.p1tu1.>ed, in. :the 601tm 06 a W..no/tliy Re.po/Lt 6Mm :the Woll.lung G1toup .to TC 2, :that :the cU.Jtec.tion .taken in :the a.t.tac.hed Re.po/Lt w.iU n.o.t lead .towa.tui.6 :the goal 06 p1tovidiY19 appltopua.te pMgJtamming .tool!.> oOJt :the 6u..tUJte. 1.t ha1.>, howeveJt, been deuded by .the WoJr.ung G1toup, .that .th-i.J.i wOJtk ha!.> Jte.ac.hed .the pMpeJt 1.>.tage 601t 1.>ubm,i_l.)1.>ion .to :the c.Jtu.&a.i .tu.ti.> 06 imple­ men.ta.:Uon. an.d 1.>u.b1.>equen.t Me by :the c.ompu.tlng c.ommu.n,,i,.ty. In ;th,LI.) op,i,n,,lon, TC 2 c.on.c.U/tl.>. The1te601te, .th-i.J.i Repo/Lt ,i_l.) 1.>u.bmi.t:ted 601t public.a.:Uon a1.> 1tep1te- 1.>eniln.g on.e 06 .the poMible appltoac.hu .to :the 1.>ubjec..t, Jta.theJt :than in the 1.>p,L/t,i,.t 06 a 6,lna.l an.1.>weJt. WG 2.1 will be cli.Jtec..ted .to keep c.on.Unu.ally u.ndeJt Jtev,i,ew ex.peJt,i,enc.e obruned al.> a c.on.1.>equ.en.c.e 06 ;th,LI.) public.a.:Uon., l.>O :that a may in.1.>.tau..te 1.>uc.h c.oMec.­ Uon.1.> an.d 1tev,i_l.),lon.1.> .to :the Repo/Lt a1.> bec.ome du,i,Jtable. To thl6 e.nd, TC 2 add!.> w endoMemen.t .to :the 1tequu.t 06 WG 2. 1 :that aU who W,t,6h .to c.on.,tJubu..te .to ;th,LI.) wo1tk 1.>hou.ld do 1.>o .th/tough .the u.tabfuhed med,i,u.m 06 :the ALGOL-Bu.Ue:un. In c.on.1.>on.anc.e wUh :thue dec.lalted a.hno, TC 2 1tequu.tl.> :that :the IFIP Gene.It.al A.61.>embly .take :thou ac.tion.1.> nec.eMMy and pMpelt .to -i..n.1.>u.Jte ex.pedai.oUI.> and w,i,dup1tead public.a.:Uon 06 th.lo Re.po/Lt on the Afgo/tliWc. Language ALGOL 68 .toge.theJt wUh .th-i.J.i page al.> a c.ovelt-i..Y19 1.>.ta.temen.t. PJU..n:ted. a.t .t.he. Ma.the.ma:ti.c.ai. Ce.nbte., 49, 2e. Boe/l.ha.a.vu:tJta.a.,t, Am.6.teJuf.am, The. Ne..the/Lla.n.cl6 • The. Ma.thema:ti..c.al Ce.n..ttte., 6ounde.d .t.he. 11-.t.h 06 Fe.bJt..U.a11.y 1946, Mi a. non­ PM6U -lYL6t;ltu;t;,i..on a.i.mlng a.t .t.he. p1tomouon 06 pUJte. ma.thema.tiC6 a.nd -U1, a.pp.U.c.a.t.loYL6; U-Ui .6poYL601te.d by .t.he. Ne..the/1£.a.nel6 Gove.Jtnme.n:t .t.hJtough .t.he. Ne..the/Lla.n.cl6 01tga.n-lza.uon 6oJt .t.he. Adva.nc.eme.n:t 06 PUite. Rue.a.Jtc.h (Z.W.01 a.nd the. Ce.ntlta.l OJtga.n-lza.t-lon 60Jt App.U.ed. Sue.nUQ-lc. Re1ie.a.1tc.h -ln the. Ne..the/1£.a.nd.6 (T.N.O), by the.Mun-lupa.U.ty 06 Am.6.te.Jtda.m, by the. Un-lveMUy 06 Am.6.teJuf.am, by .t.he. F1te.e. Un-lve.M.lty a.t Am.6.teJuf.am, a.nd by -lndt.Udlueli. REPORT ON THE ALGORITHMIC LANGUAGE ALGOL 68 A. VAN WIJNGAARDEN (EDITOR), 8.J. MAILLOUX, J.E.L. PECK and C.H.A. KOSTER SECOND PRINTING BY THE MATHEMATISCH CENTRUM, AMSTERDAM, MR 101, OCT. 1969 BlBUOTHHK MATHEMATISCH CENTRUM AMSTERDI\M Acknowledgements {Habe.nt .f.u.a 6tLta.
Load more

Recommended publications
  • 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]
  • CWI Scanprofile/PDF/300
    STICHTING MATHEMATISCH CENTRUM ,,n 2e BOERHAAVESTRAAT 49 AMSTERDAM REKENAFDELING MR 100 FINAL DRAFT REPORT ON THE ALGORITHMIC LANGUAGE ALGOL 68 A. van Wijngaarden ·(editor), B • J. Mailloux, J. E. L. Peck I , and C. H.A.Koster · Commissioned by Worldng Group 2 .1 on ALGOL of the International Federation .for Information Processing December 1968 MATHEMATISCH Contents P. Prologue P.1. History of the Report . P. 2. Membership of the Working Group::· · P.3. Maintenance P.4. References o. Introduction 0.1. Aims and principles of design 0.1.1. Completeness and clarity of description. 0.1.2. Orthogonal design.- 0.1.3. Security. 0.1.4. Efficiency. 0.1.4.1. Static mode checking. 0.1.4.2. Static scope checking. 0.1.4.3. Mode independent parsing. 0 • 1 • 4. 4. Independent compila·tion. 0 • 1 • 4. 5 • Loop optimization. 0. 1 • 4. 6. Representations 0.2. Comparison with ALGOL 60 0.2.1. Values in ALGOL 68. 0.2.2. Declarations in ALGOL 68. 0.2.3. Dy­ namic storage allocation in ALGOL 68. 0.2.4. Collateral elaboration in ALGOL 68. 0.2.5. Standard declarations in ALGOL 68. 0.2.6. Some particu­ lar constructions in ALGOL 68 1 • Language and metalanguage ":· ,,.. 1.1. The method of description . 1 • 1 • 1 • 'I'he strict, extended and representation languages. 1 • 1 • 2. The syntax of the strict language. 1.1.3. The·syntax of the metalanguage. 1.1.4. The production rules of the metalanguage. 1.1.5. The production rules of the strict language. 1.1.6.
    [Show full text]
  • Castalia, the Game of Ends and Means | 2016
    JOURNAL > SITE 0: CASTALIA, THE GAME OF ENDS AND MEANS | 2016 Castalia, the Game of Ends and Means Glass Bead The first issue of this journal, as well as Glass Bead‘s project at large, is directed towards rethinking art as a mode of rational thought. This engagement stems from a shared discontent with art’s ongoing exclusion from reason, its positioning at the peripheries of knowledge, and its resulting political inconsequentiality. Our project departs from the assumption that any claim concerning the efficacy of art—its capacity, beyond either its representational function or its affectivity, to make changes in the way we think of the world and act on it—first demands a renewed understanding of reason itself. It might come as a surprise to our readers that while it is an art journal, Glass Bead offers no critical reviews, no art-historical texts on specific works, artists, or exhibitions. None of the discursive practices that commonly surround and legitimize art are present in this journal. This absence is determined by Glass Bead’s methodological decision not to address art from a pre-constituted identity, but rather to dynamically define its role through the exploration of other forms of reasoning (science, philosophy, politics, art, etc.). While it foregrounds transits between disciplines, Glass Bead is not an interdisciplinary journal. In all its scholarly enthusiasm and benevolence, interdisciplinarity has now become some kind of empty motto. Starting from already constituted disciplinary identities, interdisciplinarity seeks connections whose broader impact on the forms of knowledge they connect are consequently silenced. As such, it appears unable to move beyond the implicit equivalence posited between the things it connects.
    [Show full text]
  • Thesis (PDF, 2Mb)
    On the Formal Flexibility of Syntactic Categories Chenchen Song Supervisors: Prof. Ian Roberts Dr. Theresa Biberauer Theoretical and Applied Linguistics Faculty of Modern and Medieval Languages University of Cambridge This thesis is submitted for the degree of Doctor of Philosophy Gonville & Caius College July 2019 Declaration This thesis is the result of my own work and includes nothing which is the outcome of work done in collaboration except as declared in the Preface and specified in the text. It is not substantially the same as any that I have submitted, or, is being concurrently submitted for a degree or diploma or other qualification at the University of Cambridge or any other University or similar institution except as declared in the Preface and specified in the text. I further state that no substantial part of my thesis has already been submitted, or, is being concurrently submitted for any such degree, diploma or other qualification at the University of Cambridge or any other University or similar institution except as declared in the Preface and specified in the text. It does not exceed the prescribed word limit for the relevant Degree Committee. Chenchen Song July 2019 On the Formal Flexibility of Syntactic Categories Chenchen Song This dissertation explores the formal flexibility of syntactic categories. The main proposal isthat Universal Grammar (UG) only provides templatic guidance for syntactic category formation and organization but leaves many other issues open, including issues internal to a single category and issues at the intercategorial, system level: these points that UG “does not care about” turn out to enrich the categorial ontology of human language in important ways.
    [Show full text]
  • Revised Report on the Algorithmic Language ALGOL 68 Edited By: A
    Revised Report on the Algorithmic Language ALGOL 68 Edited by: A. van Wijngaarden, B.J. Mailloux, J.E.L. Peck, C.H.A. Koster, M. Sintzoff, C.H. Lindsey, L.G.T. Meertens and R.G. Fisker. This Report has been accepted by Working Group 2.1, reviewed by Technical Committee 2 on Programming and approved for publication by the General Assembly of The International Federation for Information Processing. Re- production of the Report, for any purpose, but only of the whole text, is explicitly permitted without formality. The translation 1.1.5 of the Report to TEX source language was created by: f W.g B. Kloke, mailto:[email protected] . Remarks on this edition are collected into a separated document, http://vestein.arb-phys.uni-dortmund.de/~ wb/RR/vorwort.tex. Further versions will be found also in http://vestein.arb-phys.uni- dortmund.de/~ wb/RR/. The table of contents had to be removed, because page numbers are not a valid concept in TEX source language. Known errata, as published in Algol Bulletin No. 41 and ::: , are cor- rected. Syntactic errors in the standard-prelude, as mentioned in Commen- tary AB 43 p.7f, are corrected also. The Partial Parametrization Proposal (AB39.3.1) has been appended to the text. Layout of examples may still be improved. 1 Section ALGOL 68 Revised Report Acknowledgements Habent sua fata libelli. f De litteris Terentianus Maurus g Working Group 2.1 on ALGOL of the International Federation for Infor- mation Processing has discussed the development of \ALGOL X", a succes- sor to ALGOL 60 [3] since 1963.
    [Show full text]
  • Revised Report on the Algorithmic Language Algol 68
    Revised Report on the Algorithmic Language Algol 68 Edited by A. van Wijngaarden, B. J. Mailloux, J. E. L. Peck, C.H. A. Koster, M. Sintzoff, C.H. Lindsey, L. G. L. T. Maertens and R. G. Fisker This Edition, which is issued as a Supplement to ALGOL Bulletin number 47, includes all errata authorised by the ALGOL 68 Support subcommittee of IFIP WG2.l up to the end of 1978. This Report has been accepted by Working Group 2.1, reviewed by Technical Committee 2 on Programming and approved for publication by the General Assembly of the International Federation for Information Processing. Reproduction of the Report, for any purpose, but only of the whole text, is explicitly permitted without formality. CONTENTS Acknowledgements . ... 6 0. Introduction . ..... ... ... .. .. ... ... ... ... .. .. ... .... ... .. ... ... 8 0.1. Aims and principles of design....................................................... 8 0.1.l. Completeness and clarity of description................................. 9 0.1.2. Orthogonal design.................................................................. 9 0.1.3. Security................................................................................. 9 0.1.4. Efficiency.............................................................................. 9 0.2. Comparison with ALGOL 60 .. ... .. .. ... .. .. ... .. ... ... .. .. .. 10 0.3. Comparison with the language defined in 1968............................... 13 0.4. Changes in the method of description............................................ 15 PART I Preliminary definitions
    [Show full text]
  • Yoneda Lemma 2
    What You Needa Know About Yoneda Jeremy Gibbons S-REPLS #12, July 2019 The Yoneda Lemma 2 1. Nobuo Yoneda 1930–1996 • Professor of Theoretical • Foundations of Information Science, University of Tokyo member of IFIP WG2.1, • contributor to discussions about Algol 68, major role in Algol N but primarily an algebraist • The Yoneda Lemma 3 2. The Yoneda Lemma “Arguably the most important result in category theory” (Emily Riehl). The Yoneda Lemma, formally: For C a locally small category, [C, Set](C(A, ), F) F(A), − ' naturally in A C and F [C, Set]. 2 2 . From left to right, take nt φ : C(A, ) F to φA(idA) F(A). − ! 2 From right to left, take element x F(A) to nt φ such that φB(f ) F(f )(x). 2 = As a special case, the Yoneda Embedding: The functor Y : Cop [C, Set] is full and faithful, and injective on ! objects. [C, Set](C(A, ), C(B, )) C(B, A) − − ' Quite fearsomely terse! The Yoneda Lemma 4 3. The Yoneda Lemma, philosophically roughly, “a thing is determined by its relationships with other things” • in English, you can tell a lot about a person by the company they keep • in Japanese, (‘ningen’, human being) constructed from • (‘nin’, person) and (‘gen’, between), in Euclidean geometry, a point ‘is’ just the lines that meet there • in poetry, c’est l’ex´ecution du po`eme qui est le po`eme (Val´ery) • in music, die Idee der Interpretation gehort¨ zur Musik selber und ist ihr nicht • akzidentiell (Adorno) in sculpture, need to see a work from all angles • in order to understand it (Mazzola) The Yoneda Lemma 5 4.
    [Show full text]
  • Professor Nobuo Yoneda (28 March 1930-22 April 1996)
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Science of Computer Programming ELSEVIER Science of Computer Programming 27 (1996) 2 15-2 16 Obituary Professor Nobuo Yoneda (28 March 1930-22 April 1996) Dr. Nobuo Yoneda, professor emeritus at the University of Tokyo passed away on the 22nd of April 1996. He was 66 years old. Immediately after Dr. Yoneda graduated the Department of Mathematics, the Faculty of Science, the University of Tokyo in 1952, he was appointed as an assistant professor in the department. While on the faculty, he stayed at the Institute for Advanced Study of Princeton University from 1956 to 1959 and also made research trips to UK and France. In 1962, he was appointed as an associate professor of the Faculty of Science, Gakushuuin University, and was promoted to the rank of professor in 1966. After the Department of Information Science was created in the Faculty of Science, the University of Tokyo in 1971, he became a professor of Theoretical Foundation of Information Science in 1972. In education and research he made many contributions to the department and also to the university. On retirement from the University of Tokyo in 1990, he moved to Tokyo Denki Daigaku University and taught there until March 1996. During his tenureship at the University of Tokyo. Dr Yoneda’s activities were not confined to research and education. He contributed much to the development of Information Science at the university by serving as chairman of many committees including the program library committee of the Computer Centre.
    [Show full text]
  • CURRICULUM VITÆ February 10, 2021
    CURRICULUM VITÆ February 10, 2021 1. Biographical and Personal Information Donald E. Knuth, born January 10, 1938, Milwaukee, Wisconsin; U. S. citizen. Chinese name (pronounced G¯ao D´en`a or Ko Tokuno or Go Deoknab). ] (b. July 15, 1939), June 24, 1961. Married to Nancy Jill Carter [ Children: John Martin (b. July 21, 1965), Jennifer Sierra (b. December 12, 1966). 2. Academic History Case Institute of Technology, September 1956–June 1960; B.S., summa cum laude, June, 1960; M.S. (by special vote of the faculty), June 1960. California Institute of Technology, September 1960–June 1963; Ph.D. in Mathematics, June 1963. Thesis: “Finite Semifields and Projective Planes.” 3. Employment Record Consultant, Burroughs Corp., Pasadena, California, 1960–1968. Assistant Professor of Mathematics, California Institute of Technology, 1963–1966. Associate Professor of Mathematics, California Institute of Technology, 1966–1968. Professor of Computer Science, Stanford University, 1968–. Staff Mathematician, Institute for Defense Analyses—Communications Research Division, 1968–1969. Guest Professor of Mathematics, University of Oslo, 1972–1973. Professor of Electrical Engineering (by courtesy), Stanford University, 1977–. Fletcher Jones Professor of Computer Science, Stanford University, 1977–1989. Professor of The Art of Computer Programming, Stanford University, 1990–1992. Professor of The Art of Computer Programming, Emeritus, Stanford University, 1993–. Visiting Professor in Computer Science, University of Oxford, 2002–2006, 2011–2017. Honorary Distinguished Professor, Cardiff School of Computer Science and Informatics, 2011–2016. Theta Chi Hall of Honor, 2016–. 4. Professional Societies American Guild of Organists, 1965–. American Mathematical Society, 1961–. Committee on Composition Technology, 1978–1981. Association for Computing Machinery, 1959–.
    [Show full text]
  • AB26.5 CIRCULATION LIST Dipl. Math. Reiner Durchholz, 7755
    AB26 p AB26.5 CIRCULATION LIST AB26.5,1. Changes of address Dipl. Math. Reiner Durchholz, 7755 ALLENSBACH, Kapplerbergstrasse 27, W. Germany. lAB21 p 80 Dr Manfred Paul, Leibniz-Rechenzentrum der Bayerischen Akademie der Wissenschaften, 8 MUENQIEN 2, Richard Wagnerstrasse 18, W. Germany. lAB17 p 20 Professor Dr Ir W.L. van der Poel, Technische ltogeschool, Delft, The Netherlands. lAB17 p 22 Professor Niklaus Wirth, Rechenzentrum UniversitKt ZUrich, Sumatrastrasse 30, ZUrich 8006, Switzerland. lAB/7 p 27 A. d'Agapeyeff, Computer Analysts and Programmers Ltd., CAP }louse, 14-15 Great James Street, London WC 1, UK lAB17 p 23 Arthur S. Radford, Leicester College of Technolo~;b', Department of Mathematics, The Newarke, Leicester, UK. lAB20 p 51 P.G. Smith, MRC Clinical Effects of Radiation Research Unit, Western General Ilospital, Crewe Road, Edinburgh 4, UK lAB25 p 30 R.W.L. Trundle, 100 l~yron Way, Northolt, Middlesex, UK. [AB2/ p 79 D.H. Vellacott, I Bradstock Road, Stoneleigh, Ewell, Surrey, UK [AB25 p 30 M. Woodger, Auto,omics Division, National Physical Laboratory, Teddington, Middlesex, UK. [ABI7 p 25 James M. Boyle, Applxed ~lathemat,cs D,v,sxon, Argonne National Laboratory, Argonne, Illinois 604.39, USA. lAB2/ p 83 Robert T. Braden, SLAC Facxlxty of the Stanford Computatxon Center, Stanford Unlverslty, Stanford, California 94.505, USA. lAB20 p 51 lloward Bromberg, Information Management Inc., 4.32 Clay Street, San Francisco, Calxfornia 94111, USA. [ABI7 p 26 Jacques Cohen, P.O. Box 157, MIT Branch Post Office, Cambridge, ~lassachusetts 02159, USA. lAB17 p 20 R.E. Keirstead, Stanford Research Instxtute, Menlo Park, California 94025, USA.
    [Show full text]
  • Report,Rapport
    J A-53163 l j '2.- '1....- Library CW/ Am sterdam e Ceotrum voor Wiskunde en lnformatica REPORT,RAPPORT I Conference on the history of ALGOL 68 ] G. Alberts (ed.) J Department of Analysis, Algebra and Geometry ] Historical Note AM-HN9301 January 1993 E> ~ Centrum voor Wiskunde en lnfor~a~~ \ REPORT RAPPORT Conference on the history of ALGOL 68 G. Alberts (ed.) CWI BIBLIOTHEEK ll ll lllllll l l~ ll llll l lllll llll 1 ~ 1 111 1 1 1 11111 1 1111 1 11 1 11 1 11111 1 Department of Analysis, Algebra and Geometry 3 0054 00113 1078 Historical Note AM·HN9301 January 1993 I; j f] i ) ! ii -·.... \ ~ r··-:. ,.:./~J~:itr·u·:i' · ',· r ·"'. 1,r.{ic:'k •1r·, ·:,-. :..1', ·,·,·1, !q r,'1iniltJ ' '<::.. •..>:J" l.. •,..,,,,., , j 1p ~ • I . • , _ \., , " 1 \,,1 I \J ·~"-... Amsf!]td a m · ~;- = ::'. ~_ _: :_ · · - CWI is the National Research Institute for Mathematics and Computer Science. CWI is part of the Stichting Mathematisch Centrum (SMC), the Dutch foundation for promotion of mathematics and computer science and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of ERCIM, the European Research Consortium for Informatics and Mathematics. Copyright © Stichting Mathematisch Centrum P.O. Box 4079, 1009 AB Amsterdam (NL) Kruislaan 413, 1098 SJ Amsterdam (NL) Telephone +31 20 592 9333 Telefax +31 20 592 4199 Contents Introduction to the Conference 5 Gerard Alberts History of Programming Languages, a Survey 9 Friedrich L. Bauer The History of ALGOL 68 (Extended Abstract) 23 Charles Lindsey The Making of Algal 68 27 Gees Koster An orthogonal first programming language 41 Sietse van der M eulen Algal 68 - 25 Years in the USSR 45 Mikhail A.
    [Show full text]
  • (Artificial Intelligence in Education). PUB DATE 2000-11-00 NOTE 229P.; In: Learning Societies in the New Millennium: Creativity, Caring & Commitments
    DOCUMENT RESUME ED 454 816 IR 020 795 TITLE ICCE/ICCAI 2000 Full & Short Papers (Artificial Intelligence in Education). PUB DATE 2000-11-00 NOTE 229p.; In: Learning Societies in the New Millennium: Creativity, Caring & Commitments. International Conference on Computers in Education/International Conference on Computer-Assisted Instruction (Taipei, Taiwan, November 21-24, 2000); see IR 020 792. Some figures contain very small and illegible type. PUB TYPE Collected Works - General (020) Speeches/Meeting Papers (150) EDRS PRICE MF01/PC10 Plus Postage. DESCRIPTORS *Artificial Intelligence; *Computer Uses in Education; *Educational Technology; Elementary Secondary Education; Higher Education; Instructional Design; Internet; Systems Development IDENTIFIERS Learning Environments ABSTRACT This document contains the full and short papers on artificial intelligence in education from ICCE/ICCAI 2000 (International Conference on Computers in Education/International Conference on Computer-Assisted Instruction) covering the following topics: a computational model for learners' motivation states in individualized tutoring system; a fuzzy-based assessment for Perl tutoring system; a genetic approach to parallel test construction; a learning environment for problem posing in simple arithmetical word problems; a method of creating counterexamples by using error-based simulation; a study of a networked constructive CAI (Computer Assisted Instruction) system using multiplication; adaptive programming language tutoring system on the World Wide Web; an agent-based
    [Show full text]