DOCSLIB.ORG

A Complete Bibliography of Publications in Science of Computer Programming

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read 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]. [193]. 0-13-021999-1 [201]. 0-13-167080-8 µ [2579, 585]. n [1354]. π [716, 574]. πZ [185]. 0-13-199936-2 [265]. 0-13-204108-1 [1467]. Z [530]. [315]. 0-13-284027-8 [219]. 0-13-444910-X [284]. 0-13-484197-2 [202]. 0-13-536047-1 -calculus [2579, 716, 574, 146]. -driven [514]. 0-13-629031-0 [195]. 0-13-629122-8 [1507]. -functors [1894]. -induction [2529]. [246]. 0-13-640491-X [285]. 0-13-640509-6 -induction-based [1890]. -protocol [1354]. [286]. 0-13-640525-8 [287]. -selected [669]. 1 2 0-13-7248-0301-7 [194]. 0-13-728866-2 2565, 2610, 2605, 19, 514, 244, 218, 172, 267, [297]. 0-13-729773-4 [155]. 0-13-729905-2 574, 201, 288, 573]. 1-57586-098-8 [573]. [67]. 0-13-730334-3 [192]. 0-13-730409 1-85058-077-4 [218]. 1-85728-362-7 [516]. [227]. 0-13-820259-1 [244]. 0-13-823279-2 10th [20, 2256]. 11 [250]. 11th [2031]. '12 [217]. 0-13-850587-X [270]. 0-13-853581-7 [1759]. 12.95 [142]. 128.00 [179]. 12th [229]. 0-19-503691-3 [169]. 0-19-851973-7 [1809, 2426]. 13 [141]. 13-729104-3 [141]. [269]. 0-19-853757-1 [209]. 0-19-853757-3 15 [2421, 2460, 2508, 2486]. 15.95/$27.95 [209]. 0-19-853814-7 [298]. 0-19-859659-6 [201]. 18th [2383]. 19.50/$32.50 [214]. [213]. 0-19-859664-2 [228]. 0-19-859667-7 19.50/$34.50 [321]. 19.95 [516]. 1981/82 [228]. 0-201-17448-0 [250]. 0-201-17536-3 [19]. 1983 [48, 49]. 1984 [79]. 1995 [2622]. [204]. 0-201-17812-5 [296]. 0-201-17825-7 1st [21]. [247]. 0-201-18053-7 [248]. 0-201-18483-4 [208]. 0-201-19240-3 [166]. 0-201-41633-6 2 [230]. 0-201-41661-1 [288]. 0-201-54364-8 [202, 265, 243, 207, 182, 321, 217, 297, 193, 67, [320]. 0-205-10450-9 [183]. 0-262-02278-8 171, 268, 266, 397, 173, 226, 2057, 516, 192]. [196]. 0-262-08171-7 [205]. 0-262-15038-7 2.0 [1237, 2271]. 2003 [1025, 837]. [295]. 0-262-54058-4 [318]. 0-262-57074-2 2004/2005 [1254]. 2006 [1058]. 2007 [266]. 0-262-6-1058-2 [243]. [1259]. 2008 [1286]. 2009 [1373, 1346]. 201 0-273-02673-9 [206]. 0-3-540-18657-3 [143]. 201-14239-9 [143]. 2010 [216]. 0-387-97064-9 [291]. 0-444-87132-2 [1702, 1858, 1392]. 2011 [1504, 1941]. 2012 [268]. 0-444-87267-1 [267]. 0-471-84899-9 [1863, 1687, 1593, 1666, 2063, 1746, 1692]. [153]. 0-471-91201-8 [145]. 0-471-91282-4 2013 [1716, 2068, 1914, 1919, 1726, 1892]. [151]. 0-471-920274 [203]. 0-471-92139-4 2014 [2058, 2024, 1954, 1960, 2018]. 2015 [231]. 0-471-92741-4 [317]. 0-471-97646-6 [2143, 2239, 2156]. 2016 [572]. 0-521-26896-6 [146]. 0-521-31839-4 [2226, 2219, 2367, 2272]. 2017 [2283, 2391]. [146]. 0-521-33429-2 [182]. 0-521-34306-2 2019 [2398, 2393, 2535, 2582, 2562]. 2020 [173]. 0-521-34632-0 [181]. 0-521-39196-2 [2438, 2472, 2522, 2416, 2421, 2409, 2448, [321]. 0-521-42036-9 [390]. 0-521-43457-2 2460, 2466, 2433, 2443, 2516, 2495, 2508, [397]. 0-521-57651-2 [510]. 0-521-58388-8 2477, 2486]. 2021 [2557, 2594, 2538, 2531, [524]. 0-521-63107-6 [575]. 0-521-63124-6 2574, 2588, 2548, 2565, 2610, 2605]. 21st [521]. 0-521-64320-1 [574]. 0-56067-5 [2562]. 22nd [2535]. 23rd [1204, 2272, 1215]. [515]. 0-674-15626-9 [316]. 0-697-06841-2 24 [471]. 24.95 [152]. 24th [1436, 1360]. [226]. 0-7167-8198-0 [245]. 0-7167-8243-X 25th [1400]. 26.95 [170]. 26th [1416]. 2nd [396]. 0-7248-0274-6 [215]. 0-8176-3530-0 [516, 151, 145, 230, 35]. [319]. 0-86341-095-2 [156]. 0-86341-096-0 [156]. 0-86341-097-9 [156]. 0-86341-098-7 3 [141, 184, 192, 154, 299, 110, 172, 168, 204, [156]. 0-86380-086-6 [289]. 0-932633-10-2 171, 216, 1967, 271, 169, 730, 166]. [207]. 0-937073-05-9 [191]. 0-937073-06-7 3-540-13721-1 [172]. 3-540-17030-8 [154]. [191]. 0-937073-18-0 [249]. 0.17 [1081]. 3-540-18008-7 [168]. 3-540-18540-2 [171]. 0.y.z [2600]. '09 [1480, 1355]. 0x [1466]. 3-540-19577-7 [299]. 3-540-43447-X [730]. 3-540-51799-5 [271]. 3-540-96539-4 [184]. 1 [2398, 2393, 2438, 2472, 2522, 2416, 2409, 3-540-97061-4 [290]. 3-7643-3530-0 [319]. 2448, 2466, 2433, 2443, 2516, 2495, 2477, 32.50 [144]. 39 [587]. 3D [1139]. 3rd 2557, 2594, 2538, 2531, 2574, 2588, 2548, [2616, 2621, 1173, 2617]. 3 4 [184, 155, 231, 151, 218, 208, 180, 317, 318]. accumulations [372, 557, 1449]. achieve 40 [600]. 41 [610]. 42 [624]. 43 [633]. 4th [959]. Achieving [1915, 803, 1361]. Achilles [1525, 56, 2618]. [1059]. ACM [1204, 1436, 1687, 1215, 1360, 1400, 1416, 320, 2018]. ACME2012 [1814]. 5 [515, 1287, 296, 271]. 52.00/DM [319]. ACP [1273]. acquisition [336, 1012]. 5th [2620, 1143]. across [1170, 1847]. ACSR [615]. ACSR-VP [615]. action 6 [572, 146, 213, 289, 286, 214, 215, 575, 230]. [677, 1497, 1596, 1032, 1183, 2352, 903]. 60.75 [389]. 61131 [1967]. 61131-3 action-semantics [677]. actions [2584, 1967]. 6th [2097, 2276]. [339, 1587]. activated [863]. active [799, 461, 2379, 1352, 2290, 1491, 1247, 1720, 7 [299, 295, 156, 229, 168, 298, 194, 269, 205, 2564]. activities [1616, 2373]. activity 247, 248]. 730409 [227]. 75 [1292]. 7th [9]. [1937, 1517, 2581, 2500]. Actor [1210, 2308, 2418, 1987, 1822, 1545, 2194, 1547]. 8 [154, 287, 219, 246, 2481, 320, 145, 185, Actor-based [1210, 2308, 2418]. actors 196, 524, 573]. 83g [19]. 8th [2178]. [1823, 1821, 152]. actual [1310]. acyclic [200, 890, 695]. Ad [1190, 1986, 772]. Ada 9 [291, 183, 206, 153, 143, 390]. 9.95 [167]. [168, 53, 2592]. Adaptability '90 [2616, 2617]. 920274 [203]. '95 [2622]. [1984, 959, 1440, 1293]. adaptable 96d [471]. [1442, 2115, 1748]. Adaptation [2034, 1562, 1706, 570, 928, 897, 2297, 1381, AADL [1907, 1906]. Aaron [320]. AATT 2254, 1798, 803, 1304]. adapters [877]. [2265]. AbC [2544]. abduction [1296]. adapting [2405, 1850]. Adaptive absences [2361]. absolute [693]. Abstract [1388, 2452, 2132, 2570, 2524, 2462, 1471, [2404, 294, 1434, 2497, 703, 1392, 1685, 1457, 1857, 1704, 2034, 2236, 2310, 1011, 748, 1379, 139, 487, 844, 684, 954, 725, 2407, 952, 569, 469, 1012, 1774, 1879]. Adaptiveness 116, 2060, 571, 535, 2401, 446, 1718, 506, [2563]. add [773]. Adding [1826, 896]. 379, 548, 486, 369, 376, 842, 370, 581, 1208, Addison [296, 208, 204, 320, 143, 288, 166, 1686, 1944, 1945, 1478, 862, 949, 1483, 654, 230, 247, 248, 250]. Addison-Wesley 1673, 489, 1240, 784, 1694, 2062, 868, 1692]. [296, 208, 204, 320, 143, 288, 166, 230, 247, Abstracting [685, 2502]. Abstraction 248, 250]. Addison-Wesley/ACM [320]. [84, 1439, 352, 2604, 2163, 2306, 1255, 1651, adequacy [2506, 2604]. Adequate 2073, 1910, 1568, 194, 162, 2355, 1769, 1281, [59, 969, 1757]. adhesive [1895]. Adjoint 840, 144]. abstractions [1500]. administration [701, 753]. Adore [1077, 1648, 1725, 2235, 2131, 2295]. [1444]. AdSiF [2298]. Advanced abstractor [409]. ABZ [575, 1071, 774]. Advances [2497, 1692, 2058, 2226, 1392]. Academic [2283, 829, 2246, 2520, 1830, 1735, 2106]. [214, 1173]. Academics [1814]. adventure [1010]. advice [941]. AErlang Accelerating [2280]. acceleration [1685]. [2305]. affect [549]. affects [2012]. affine acceptors [223, 276]. Access [1907]. after [1038]. against [953, 1189]. [1319, 1478, 2370, 1565, 992, 1458]. Agda [2475]. age [316]. age-new [316]. Access-based [1478]. accesses [1208, 1851]. agenda [590]. agent [1426, 864, 1420, 2526, accessibility [1604]. accessible [2328]. 1479, 2425, 645, 1425, 1427, 1822, 1188, 2160, accessing [1713]. accommodates [789]. 2066, 826, 1234, 1309, 1006, 2298, 1423, 930]. 4 agent-based [2526, 1309].
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]
  • 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.
    [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]
  • 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]
  • 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 ..........................................................................................................................................
    [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]
  • Profile of IFIP Working Group
    Profile of IFIP Working Group 2.1 WG2.1 members April 2009 This information brochure is an attempt to survey knowledge and expertise represented within IFIP Working Group 2.1. • Section 1 lists the title, aim, scope and web-page of the working group. • Section 2 lists the title, aim, scope and other working groups of TC2, WG2.1's parent body within the IFIP hierarchy. • Section 3 lists the locations and dates of recent meetings of the group. • Section 4 lists all members of the Working Group together with their specific research interests. 1 WG2.1: Title, aim, scope and web-page 1.1 WG2.1 Title IFIP Working Group 2.1 | Algorithmic Languages and Calculi 1.2 WG2.1 Aim To explore and evaluate new ideas in the field of programming, possibly leading to the design of new languages. 1.3 WG2.1 Scope 1. The study of calculation of programs from specifications. 2. The design of notations for such calculation. 3. The formulation of algorithm theories, using such notations. 4. The investigation of software support for program derivation. 5. Continuing responsibility for ALGOL 60 and ALGOL 68. 1.4 WG2.1 Web-pages • http://web.comlab.ox.ac.uk/people/Jeremy.Gibbons/wg21/ • http://www.cs.uu.nl/wiki/bin/view/IFIP21/WebHome 2 TC2 context Within the IFIP hierarchy, WG2.1 is part of TC2. 1 Profile of IFIP Working Group 2.1 2 2.1 TC2 Title Software: Theory and Practice 2.2 TC2 Aim To obtain a deeper understanding of programming concepts in order to improve the quality of software by studying all aspects of the software development process, both theoretical and practical.
    [Show full text]