DOCSLIB.ORG

Iliiiiiiiiiiiiwi1

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Iliiiiiiiiiiiiwi1 tt ¦ »:¦/ " : ^" : ¦ ¦ ' ¦¦ ¦ ¦ : WATERFORD STEAMSHIP COMPANY ¦ ¦ ¦ ' • : - ;; (LIMITED). "4^ ' ¦ - " C¦ rdrity arid :C ty i -[q f>i-: ^ ' t?^'fe w ¦¦;:|:!.r|: - Wdteiifor<M ^ ^ITA Mpi! , r!l ,: i !i) -|^i:U}, ^p; .!-J;. ' .:{ INTENDED ORDER OF SAILING. VISITORS to DUBLIN j QENERA.L QUABTEn : ; HLts)tTAlilA'f,ond ^i^M.: l &E$SI0FS} ' FEBRUARY, l<110 TRy THE ^TOECANiA"- j isJ'SiiD 0Nos of itHE d6cryirt,i are . the XlaisasS ' and , .Fti£teEA!hnx &els xn tiqOKfrfpRFHEy ¦ 1 Y8JU&f t9J0fL.;-\ ST&AiMIEKS • W«w'; t5t5ni«r i^FRANiOOiNIA;M ' FOUR ; ¦ ¦ ,i Swinr ¦ CLODAGH. DtlNBRODY. REGINALD, Byilqers' ironmo^g'ery. - ' -' : - ' " i::|' -THS ;. , ¦]¦• , ;; ; ; . i , 'i ' : LAKA ; ! ; : . : ': : ;,j v j ; ; ^ . Triple -sc&w, TuiMne | \\. HILAicVS; BB38IONS. -!,-|v • ¦V. , JTKNAPIA, Ett. COURTS 1 ¦ If OAEMANIA¦ ," Iiitnore.dfliB osincOT—Totsday <th January, 1910 • ' [ ' - . ,. : • CrowS ConTentent to- M ' -ifj 20,000. abni' J^T . : BmlDCsS—Tuesday, 4U) piouirj.'9 <? V t^md an4 "VTOTICE.—Tho O Tl PI Household Ironr^on^o ; BANIC Bralllr—Wedoesdiy,5th lanbary, ' '¦ ¦ Water* r^y- CITY :a C9UWTYiiLOAM €i|. blSGQUWT Twuwfecrow- Staapi«j "GARONIA-i'' 20,000 191a , ., .- : 'i : . ¦/ i "V— _3N. ii ford Steamship Cpra» \ : ¦ ¦ ' ' ' DutuRirrisV OTU Daaineov—T»unday,«lh . |ariua»y, Can't bo boaten (or Comfort ' «^€£"^m^ci3 1 ¦ 'a jpuUbei: of yjears) ' : ' : Bg 1910^Crosm BOSISBSS—Friday, 7U1 Jnnnaf^,1910 j Lour) , Pieces^PrbIO T" - (Wli' l ch la estAbHshed for '¦ ¦ ' !lV «iul j ChChi i mhey ' - " - ' ¦ ' ' ; ¦¦ ¦ ' 'i ^6r Stoairdcr i' Bprlty—Friday,^ ¦ ' ; nr) - 7th Jao;ary, ~S-raJ Pibces^^pgl ; - 'VCAlCPAiin-A. ' ^jSf*?l5b?''!! -I' " ima ' • < rt;ey . 1 •! ^WCS, iGowfi li . , ! ' I ' . \i . , - •!• •( ~ ¦ «nd Lite Stock foe Ship. Cleaallnoss & Uoderato Charges. ' I Watcrford. " i i T cotnt on the conditions mentioned , OE^^rMs- ^noTn ^GmlDATT.T jCtyU BmlDtss—Samrii^, )'fXt xJanuary, 1910 ; 1 1 ¦¦ '!¦ ' ' ¦ : Crown BnsWu—Honjliy, 10th Jiaaary,1910 ; Laud and Jn Silling lists, Sc, to be had it coo acDnaocio Ftioa «/ iuPWARDS, in Uy part of Ireland, TO FARMERS, Eonltv—TmiJair'iitb ¦ jthelr Offices. Ranges and d. tates. ! Ii ilaiia oavanccs d4"y '»n» fi3| t<ABG B9T ; . January, 1910,. ! .' ' v . • / : . AND; PAOTW 8JTEAMJ3R8 WsierfortI dry. Crown Bislaess—Tundar, ntb ScJ; Oo early Morning Terras tor Bd&rdora from ' ipHOPKEEPERB, GOVERNJ1JENT| OFFICIAliS, ; 1 | Jaan:rj, < ¦ ' '¦¦ Sailing Cabins of the steamers ^a ^s. bd. H i . i9io \\\ \ \ \ . •1 ,. ;• .. , .- i.. will t>« open to receiTe Passenger* arriving by tin Nl£ht por woott. ; Kitchen Ute^silfi SPONBIBIVB ERSONS aaj ; j ' , -.: OACJi lOflUyASpfi • •. ¦ : ¦- : ' tiill trains. ! \j . 1 , jj iiTOALL E ; ;i :; J !; - ..) . ¦ |' ; ROim;; KPiBCIAL ' ! EASTER t3E5SSr6. HBi:'i'--;- /:f' ii : ' ;! P ••: j iir-"i -:i !BA;nBa] ': ' n-: -: ¦; ' Llraoro—ClTllBn jinea>^-io«ilay, ' Wedding Partici tpecially Catrred 'Jor ; ^ : - 5lh'April,- i9I0 ; ! WATERFORD AND BRISTOL. ' Forid ars and Kerbs, . Fi :r6 lBraaCjQ^ 5ron» jttTVEBIVX)l];; ,(Vj» Queajfitown). Ocown-BosWoJ-^tiieidaystbi >4prit loiq,; • Ltn3 .mil ' ¦ . Eanl&, Wed(ie»da7.'6th April, «9u);: ;; - - FEOU WATERFO :<1> TO- r'ROM BRISTOL TO : I TO WEW YORK ¦' ¦ .. ' .[. rj::^", -: f HENRY - GT KILBEY, ts.1 ' v ' ; ¦ ¦ ¦ | '• i i .tiraxx jiosTfciN: :¦ '' !Onbgaino: Citll Bn«JtiMa-;Tliiirt<i37ISy April, 1410 : - : UKlSTOt. WATERFOKD. I " ah"d/ R ;¦ ¦ ' ¦ Manrtti n(a> ¦: Sat. Jan. J9, Jvtnii, I I Tue« ?anaging Olroollor Dofes. .^ r ;; ' - " :- - i - .'"j -i 'I .j vwiTrioiiT pu'SuferrvJ .' ' V- \'\i' ¦: i ' • ; " , War. « . Sailing from Cumberland Te'ejnimi:—" EICSL, CB N " or ed Umbrla - ..Bjt, D U . : ¦ tw> arran .]:|| -Ff»;»i Itoiila. ^ .: jTnt^ April » UWsueri'bnU .Ci'TO Biulncwt—Saturday,5( fi Apri), 1910 ;[ Basin caUiog at MlUord- Sedding* i i j-Thia amomit borro TC<S oaQ bo ropaifl by lnsialmint^ M iriay g . - :! ' Crown HosIdess—MondjT,uti Havcn. Bpdsteads-arid ,: : ; \ ] I by TOHDIBPASSED¦ 'J [ AOt 0MAJ1ODATION ApriJ, 1910; tand and, i' q:. Ve ' wldijlfiwo not fil^en cpjora baloroj?ntt!ng -, - .! MlU- 1' . ¦¦ " Tcnnsaxe f^ren t^lpi?' tprllcnlloc, . vAfl LOW-i-ElTEg.-!- '. '!- :^:-> . t-irilfJicrt«1 r-SSi-ttB criiriS^TtfaiiyIirUl-iJldli Tuesday i.. 4 0 p-tn Friday «:. ;jo jo a.ra 'enso and will bi> foatd taj1 bottoi th&a others ^tto WtVatjce ?' .:Second} ttn«J . Tuesday « 11'. a Ri ,ni- Friday. "r"W..533 ^ Applicant |to iiQQblo ond e«;p « TASiVjci&iiSa.pa^fengers,:'^ua' .. P^" i BANK to now woll-tntwa'tor tacit cttalBhWoi^Mfiaepnas How- (¦Boric/ .'irjay' ttavet ¦ ¦wfitab'tBt i- . [ i - fj.-i*LN-iTX-BiKBaiONB ' " ; *Boiir ' 15.. « pjn Mday, i!..io 3a a-ru v ;6n Privoto Beonrlty ts fhtai ¦ . 'extra; !¦ LJ.rji r '; - > !¦ • u am' Friday, ra " - : ' itfliiajsg &' : ¦ ¦ . <«v 'CiTij ;Bialna»—VVtdneiiiay, Istijoiie, 1910; Tuesday »i.. 'i »$•• 5 J° P- DGGLEY's * J unu ouenbi;,^ ,:: .! ; ^vV ;:[; .^ .;- . -- -Ui .Q . ! i . :v .v: ,:-i .: .: -; . 'Bc&^ott oiid Pi wla)di<i!j>)jia, OBKI HOTEL ; Farm l iinplomonts ahd Ut©nsi liD; . and tnoatfv rellaM^a. ' I C3" To those rc<i ilrlng a temporary odTonoe, w« Bbovo la tto best ' ¦ ' : ;: delpSla.iI¦ ' ¦:¦ :,. ' i . • hj " l I '! ' I OUoJirTji CifU Businejjr-Krlday,j^ d junt, LIVERPOOL. WATERFORD. --- ^ollorc Scatb, Ai?ehc3. ' . ' , ¦>[' ¦ ¦; ¦ , ¦ ' . Crowa 19W ; WATERFORD AND Gardbli R@QUiSlte3 i : For tortns ami pi;rUonlaxn apply, : -|| , < - :• . | BaEfeengere booked tfcrOTighto oD portfa BusuMJs^&totday, <tt lutm, 1910; Lzuldot ; SFROM'"nVERPOOL. E*ilrj—Sati nlarvathjune, 1910. ¦ " ¦ '|;' FROM WATKRFORD. We beg to draw mention to the superior qtuCt ; ' I " if ; y of ' : , ¦ Wilertortl CW1 XJuslncss-rJIondajr, «h Jvbe, VflOt j.. —a p.rn our Ljqnon ' O'lponnoll. pt«fcqofti|WATEi4Fpi?|p. Api Iv4-The Crxmard ; Steanihfp Crown Busli c35-t-Tu«da>-; Wednesday 12 0 noon Wednesday 3.. j o Firopropf Safes. i Ootr*- 7th>jBrie, 191*¦ ; ¦ Laid ami¦ Friday 4.- u 0 noon Friday, 4.. 6 o a_m I. & S.¦ ••• . piany, I Imited;\ LiverpopT; loir ;.fo Equity—Wednesday,8thJune, 'I 910.! : • jj ' . , • • . J. WHISKEY. ' 4ibaix 1 Waicrford CltV. Ciowo' Sumta? & .. r o a.m Monday, 7.. 8 30 im JOHN POWER'S 3 SWALLOW WHISKEY. ' agieaw—iWard Brothers "and jHarrey and Busings—WWneadiy,; 8fl» Wednesday q.. a o r-.ra Wednesday g.. 9 30 a.m Brujp hes—Household ari$ Stable. ; l-Vilay * ti.. 3 o p.m Friday, u..xi 0 ajn ,1 SCOTCH—GlenliTct. and Long John"i, :^ )!i jradKAiELMASISESSIONfi.; ' diufl } Mtiteiea i U ! [' Sunday, 13.. 7 o , a in Monday 14., 1 o rxxn : the Dew of Ben Nevis. Qttfj WIO IG O EV)iI©y an<S P. Evsu^'Dun- mm. jCltU' Brainess^-Tiiesday, ajthiStptemiKTi i2 oam n Wedac*dayi6., 2 o pjn Harness -- Sllvor-platcd, Bfaob E I 1 ! Wc4aesdayio., ' swvwi.; >9io i Crown Business—Tuesday, HENNESSrs • * • BRANDY. lMi3. Kaite Bejiey^ ) Cbppoirfliia ; .soltf Seplembcr, 1910 £ Friday, iS., 12 o noon Friday 18 .. 5 o a.m L(MSS ' Land and lOilS Equity—W«lne*iay; MN IOiNS Jlatne? 21st September II S ! I Aih'euirne br 'JPos.iJGeiariTf , tgio. ; . I. Sanday, 30... o a.m Uond y it.. 9 ^o a.m HOLLAND'S & WHITE SATIN GIN. and , Ilsinore; ' Dunginao. 7 Hluptin^ Saddles Bridlec. Jajmei 'MQQTMIM CIfUBusiae<*r'7hcrtday,2>iid Sjpterabeti Wednesday JJ un Carraok-on-Bair. Wednesday}?.. 1 o jpm .. 9 30 PURE JAMAICA RUM. ;:• 191a!: Crown Business— Friday. 23rd September,' ijiffi Friday, 25.. 1 0 ip,m *' 'day 25.. it o ajn ' ¦ " Land and Equity—Saturday, Verj Best Brandt of Claret, Port and Sherry. 1 ¦ ' ' ¦ ¦ ' 2|th SeptemberJ 191a ¦; '. \ Sunday 27., a ia.u- Monday i$ ,.ia o ooon : 'I . ::• ;¦ ii| ¦;[ . I Waterford;' aril 7 Guinness's Stobt in Splendid Condition. J he WATEKFORD l p»AN 'COMPANY I ! T Business—Monday. i6Ux Septeaber; Cork Drawers. t9io|; Crown Business—Tuesday, Areragt B«a Passage, 14 to 15 Horn. * to ; NO PROM £E TO ' a7tb September, 1910 J Bass East India Pale Ale in Sparkling Condi'ioo. I Q , \ £1,000. Land and Equltj—Wednesday,s3tn September, iglo. 1 : Loadl-s Berth -Cumberland Basin, Brfite-t, , J OHN S T^BEt^WATERFORD 1 Waferfordj Q( ! Return Tickets Issued at Bristol to Cork Tobacio, Cigars, and Cigarettes, , Trac y. : Crowa Biuincss—Wednesday, HSUV per Drlttel Slidii tig Poor Hangers and ks. September ' ! ¦ ¦ Aro prepared to tro: t, vHtb the greatost conflderjod and secrecy, all appUcatlonB from £2 ; ¦ , raid.^ !' - I ¦ ' . ! " 1 !f jj ¦:/ I' HN. Cc. arc available' (or return from Dublin vrlthoat : TO •tfarrldcb^glOff ' ' «itra ehar«, or from jWaterford to Bristol by Watcrford UPWARDS, to. 1JI per,ona on their OWN AttfROVED PER80NAI. BEOURTTy JTOBLEM'BNJ ! LADIE8! AND 1 Carrick^n-Salr: Courthobje). , OlS Address—30, QUAY. CrEW O i | Basii)esa,. r^ursa3y,39tfa f8eptcmber. rgio. i : ¦ ' ' 'f Steamship Cp.'t steamer* on payment of is. 3d. extra Note In any part of jlroland. MEN, AND i Ati] | OTHERS, l^'- ; Ketum Tickets Issued at Bristol to DubUti per Briitnl 5n; &i y * waterlcrd Division Civil Bills and £lectmedubntr. BaBlneaa carriedon in 0 moat straightforward iana exact manner. |: Wt of; Great ! :Britein ipd Ire- : ' 1 • ¦ ' 8. N Co. art available for return from Waterlord to or Banks In this liaiuf oo ' thedr cswn : j.| . i| I DIVISIONS. : . I i. ; ; [1 j Bristol by Waterford 8tta:D»hlp Ox's steamers »n pay- No connection with )ny o^bor Loan Offices so-called Connly. ¦' ' fliittatrjjj^ e, ii-wtftlhotri 14 more—Tb« Baron/ ol ^MhmomuAlCoebM&l ,, THE WICKLOV7 HOTGL, flrmvtWleaecvl ' ' 'T ! ' " ' ' "~ f. toent of 6s. extra, or frorn Cork on payment of 3s. 9d. extra. sop 'I ! '¦ «na tie Ptrfin]of;A!Urje, la ih» BATCH/ oi Ueefcbi , j i] : ¦ Return Tickets issifcd at Waterford to Bristol by WALTEK WALSH* App ly-THE'\\hlhNAGER, i Wltl mot I)nn: l |; , ' - •; . > | : ¦¦ ii ; i; • : ; r ;. : Waterford Steamship £0. are available for return per WIOK LOW ST., GRA.FTON ffT : ' EABY . lREPA^iEOTS. Di nyirrsn—'rho l BaronlMof Deoles; WithiB Dram.; !j Bristol S V Co. from Bristol to Cork or to Dublin : • ' i 0. JOHN STREET, WATERFORP. Olc atieirj, »nd OobiesWithout Drum, fars 19 mosa , without p-iymenl.
Load more

Recommended publications
  • The Evolution of Lisp
    1 The Evolution of Lisp Guy L. Steele Jr. Richard P. Gabriel Thinking Machines Corporation Lucid, Inc. 245 First Street 707 Laurel Street Cambridge, Massachusetts 02142 Menlo Park, California 94025 Phone: (617) 234-2860 Phone: (415) 329-8400 FAX: (617) 243-4444 FAX: (415) 329-8480 E-mail: [email protected] E-mail: [email protected] Abstract Lisp is the world’s greatest programming language—or so its proponents think. The structure of Lisp makes it easy to extend the language or even to implement entirely new dialects without starting from scratch. Overall, the evolution of Lisp has been guided more by institutional rivalry, one-upsmanship, and the glee born of technical cleverness that is characteristic of the “hacker culture” than by sober assessments of technical requirements. Nevertheless this process has eventually produced both an industrial- strength programming language, messy but powerful, and a technically pure dialect, small but powerful, that is suitable for use by programming-language theoreticians. We pick up where McCarthy’s paper in the first HOPL conference left off. We trace the development chronologically from the era of the PDP-6, through the heyday of Interlisp and MacLisp, past the ascension and decline of special purpose Lisp machines, to the present era of standardization activities. We then examine the technical evolution of a few representative language features, including both some notable successes and some notable failures, that illuminate design issues that distinguish Lisp from other programming languages. We also discuss the use of Lisp as a laboratory for designing other programming languages. We conclude with some reflections on the forces that have driven the evolution of Lisp.
    [Show full text]
  • Lisp: Program Is Data
    LISP: PROGRAM IS DATA A HISTORICAL PERSPECTIVE ON MACLISP Jon L White Laboratory for Computer Science, M.I.T.* ABSTRACT For over 10 years, MACLISP has supported a variety of projects at M.I.T.'s Artificial Intelligence Laboratory, and the Laboratory for Computer Science (formerly Project MAC). During this time, there has been a continuing development of the MACLISP system, spurred in great measure by the needs of MACSYMAdevelopment. Herein are reported, in amosiac, historical style, the major features of the system. For each feature discussed, an attempt will be made to mention the year of initial development, andthe names of persons or projectsprimarily responsible for requiring, needing, or suggestingsuch features. INTRODUCTION In 1964,Greenblatt and others participated in thecheck-out phase of DigitalEquipment Corporation's new computer, the PDP-6. This machine had a number of innovative features that were thought to be ideal for the development of a list processing system, and thus it was very appropriate that thefirst working program actually run on thePDP-6 was anancestor of thecurrent MACLISP. This earlyLISP was patterned after the existing PDP-1 LISP (see reference l), and was produced by using the text editor and a mini-assembler on the PDP-1. That first PDP-6 finally found its way into M.I.T.'s ProjectMAC for use by theArtificial lntelligence group (the A.1. grouplater became the M.I.T. Artificial Intelligence Laboratory, and Project MAC became the Laboratory for Computer Science). By 1968, the PDP-6 wasrunning the Incompatible Time-sharing system, and was soon supplanted by the PDP-IO.Today, the KL-I 0, anadvanced version of thePDP-10, supports a variety of time sharing systems, most of which are capable of running a MACLISP.
    [Show full text]
  • ' MACSYMA Users' Conference
    ' MACSYMA Users'Conference Held at University of California Berkeley, California July 27-29, 1977 I TECH LIBRARY KAFB, NY NASA CP-2012 Proceedings of the 1977 MACSYMA Users’ Conference Sponsored by Massachusetts Institute of Technology, University of California at Berkeley, NASA Langley Research Center and held at Berkeley, California July 27-29, 1977 Scientific and TechnicalInformation Office 1977 NATIONALAERONAUTICS AND SPACE ADMINISTRATION NA5A Washington, D.C. FOREWORD The technical programof the 1977 MACSPMA Users' Conference, held at Berkeley,California, from July 27 to July 29, 1977, consisted of the 45 contributedpapers reported in.this publicationand of a workshop.The work- shop was designed to promote an exchange of information between implementers and users of the MACSYMA computersystem and to help guide future developments. I The response to the call for papers has well exceeded the early estimates of the conference organizers; and the high quality and broad ra.ngeof topics of thepapers submitted has been most satisfying. A bibliography of papers concerned with the MACSYMA system is included at the endof this publication. We would like to thank the members of the programcommittee, the many referees, and the secretarial and technical staffs at the University of California at Berkeley and at the Laboratory for Computer Science, Massachusetts Instituteof Technology, for shepherding the many papersthrough the submission- to-publicationprocess. We are especiallyappreciative of theburden. carried by .V. Ellen Lewis of M. I. T. for serving as expert in document preparation from computer-readableto camera-ready copy for several papers. This conference originated as the result of an organizing session called by Joel Moses of M.I.T.
    [Show full text]
  • A Lisp Machine with Very Compact Programs
    Session 25 Hardware and Software for Artificial Intelligence A LISP MACHINE WITH VERY COMPACT PROGRAMS L. Peter Deutsch Xerox corporation, Palo Alto Research center (PARC) Palo Alto, California 94304 Abstract Data Types This paper presents a machine designed for LISP has many data types (e.g. list, compact representation and rapid execution symbolic atom, integer) but no declarations. of LISP programs. The machine language is a The usual implementation of languages with factor of 2 to 5 more compact than this property affixes a tag to each datum to S-expressions or conventional compiled code, indicate its type, in LISP, however, the , and the.compiler is extremely simple. The vast majority of data are pointers to lists encoding scheme is potentially applicable to or atoms, and it would be wasteful to leave data as well as program. The machine also room for a full word plus tag (the space provides for user-defined data structures. needed for an integer datum, for example) in every place where a datum can appear such as Introduction the CAR and CDR of list cells. Consequently, in BBN-LISP every datum is a Pew existing computers permit convenient or pointer; integers, strings, etc. are all efficient implementation of dynamic storage referenced indirectly. Storage is allocated in quanta, and each quantum holds data of allocation, recursive procedures, or only one type, so what type of object a operations on data whose type is represented given pointer references is just a function explicitly at run time rather than of the object's address, i.e. the pointer determined at compile time.
    [Show full text]
  • USENIX Winter Conference
    February ! 990 The Australian UNIX* systems User Group Newsletter Volume 11 Number 1 February 1990 CONTENTS AUUG General Information ..................... 4 Editorial ........................... 5 Secretary’s Letter ......................... 7 AUUG Inc 1990 Annual Elections -- Nomination Form ............. 8 Western Australian UNIX systems Group Information ............. 9 SESSPOOLE Information ...................... 10 AUUG Book Club Reviews ...................... 11 AUUG Book Club Order Form .................... 18 X Technical Bibliography ...................... 19 Commonly Asked X Questions ..................... 25 AUUG Institutional Members ..................... 42 From the EUUG Newsletter - Volume 9 Number 4 .............. 44 Editorial ......................... 45 How To Protect Your Software .................. 46 The EUUG Conference Mailing System ................ 54 UNIX in Czechoslovakia .................... 57 EUUG Munich Conference, Spring 1990 ................ 60 USING -- UNIX Systems Information Networking Group .......... 64 EUUG Executive Report .................... 67 Report From ICEUUG ..................... 69 News From The Netherlands ................... 71 UKUUG Report ....................... 74 USENIX Association News For EUUG Members ............. 76 USENIX Winter Conference ................... 78 EUnet Growing Up In Spain ................... 81 EUUG Software Distribution ................... 88 ISO/IEC JTC1/SC22AVG15 (POSIX) Meeting October, 1989 ......... 92 The OPEN LOOKTM Graphical User Interface .............. 98
    [Show full text]
  • 1 Introduction
    C7|Lisp Programming Russell Bradford 1 Introduction This course is about Lisp. Or rather this course is about how to program in Lisp. The distinction is a great one: Lisp, as a language to use, to program with, to learn, is one of the simplest of all languages. There is no difficult syntax, and every piece of code or data is treated in exactly the same way, with only very few (but important) exceptions. On the other hand, some of the hardest language semantic questions can be posed and written using Lisp, involving subtle or complex ideas, readily adapting to accommodate every new fad and paradigm. We shall concentrate on the programming aspect, and perhaps give the merest hint of the semantic under- pinning. 1.1 What is Lisp? The name \Lisp" means \List Processor." The basic object that we manipulate is the list. A list is an ordered collection of objects, each of which may be other lists, or things which are not lists, called \atoms." An atom is any object that does not have a list structure. Thus (the cat sat (on the) mat) is a list of 5 objects, the 4th being a list of 2 objects. The symbols the, cat, etc., are atoms. Here is another example of a list ((one 1) (two 2) (three 3)) which associates a symbol with a numeral (each of which are atoms). Lists come in all shapes and sizes, for example (((x 10) 2) ((x 5) ((y 2) 1) 1) ((x 2) 3) 2) is a more complicated list, which some people like to think of as a representation for the polynomial 2x10 + (y2 + 1)x5 + 3x2 + 2.
    [Show full text]
  • Ci the Interlisp Virtual Machine
    C.I THE INTERLISP VIRTUAL MACHINE: A STUDY OF ITS DESIGN AND ITS IMPLEMENTATION AS MULTILISP by OHANNES A.G.M. KOOMEN B.Sc. THE UNIVERSITY OF BRITISH COLUMBIA 1978 A THESIS SUBMITTED IN PARTIAL FULFILMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE in THE FACULTY OF GRADUATE STUDIES (Department of Computer Science) We accept this thesis as conforming to the required standard. THE UNIVERSITY OF BRITISH COLUMBIA July, 1980 (c) Johannes A.G.M. Koomen, 1980 In presenting this thesis in partial fulfilment of the requirements for an advanced degree at the University of British Columbia, I agree that the Library shall make it freely available for reference and study. I further agree that permission for extensive copying of this thesis for scholarly purposes may be granted by the Head of my Department or by his representatives. It is understood that copying or publication of this thesis for financial gain shall not be allowed without my written permission. Department of Computer Science The University of British Columbia 2075 Wesbrook Place Vancouver, Canada V6T 1W5 Date July 22, 1980 ABSTRACT Abstract machine definitions have been recognized as convenient and powerful tools for enhancing software portability. One such machine, the Inter lisp Virtual Machine, is examined in this thesis. We present the Multilisp System as an implementation of the Virtual Machine and discuss some of the design criteria and difficulties encountered in mapping the Virtual Machine onto a particular environment. On the basis of our experience with Multilisp we indicate several weaknesses of the Virtual Machine which impair its adequacy as a basis for a portable Interlisp System.
    [Show full text]
  • Guide to the Herbert Stoyan Collection on LISP Programming, 2011
    Guide to the Herbert Stoyan collection on LISP programming Creator: Herbert Stoyan 1943- Dates: 1955-2001, bulk 1957-1990 Extent: 105 linear feet, 160 boxes Collection number: X5687.2010 Accession number: 102703236 Processed by: Paul McJones with the aid of fellow volunteers John Dobyns and Randall Neff, 2010 XML encoded by: Sara Chabino Lott, 2011 Abstract The Herbert Stoyan collection on LISP programming contains materials documenting the origins, evolution, and use of the LISP programming language and many of its applications in artificial intelligence. Stoyan collected these materials during his career as a researcher and professor, beginning in the former German Democratic Republic (Deutsche Demokratische Republik) and moving to the Federal Republic of Germany (Bundesrepublik Deutschland) in 1981. Types of material collected by Stoyan include memoranda, manuals, technical reports, published and unpublished papers, source program listings, computer media (tapes and flexible diskettes), promotional material, and correspondence. The collection also includes manuscripts of several books written by Stoyan and a small quantity of his personal papers. Administrative Information Access Restrictions The collection is open for research. Publication Rights The Computer History Museum (CHM) can only claim physical ownership of the collection. Users are responsible for satisfying any claims of the copyright holder. Permission to copy or publish any portion of the Computer History Museum’s collection must be given by the Computer History Museum. Preferred Citation [Identification of Item], [Date], Herbert Stoyan collection on LISP programming, Lot X5687.2010, Box [#], Folder [#], Computer History Museum Provenance The Herbert Stoyan collection on LISP programming was donated by Herbert Stoyan to the Computer History Museum in 2010.
    [Show full text]
  • Guide to the Herbert Stoyan Collection on LISP Programming
    http://oac.cdlib.org/findaid/ark:/13030/kt038nf156 No online items Guide to the Herbert Stoyan collection on LISP programming Paul McJones with the aid of fellow volunteers John Dobyns and Randall Neff Computer History Museum 1401 N. Shoreline Blvd. Mountain View, California 94043 Phone: (650) 810-1010 Email: [email protected] URL: http://www.computerhistory.org © 2011 Computer History Museum. All rights reserved. Guide to the Herbert Stoyan X5687.2010 1 collection on LISP programming Guide to the Herbert Stoyan collection on LISP programming Collection number: X5687.2010 Computer History Museum Processed by: Paul McJones with the aid of fellow volunteers John Dobyns and Randall Neff Date Completed: 2010 Encoded by: Sara Chabino Lott © 2011 Computer History Museum. All rights reserved. Descriptive Summary Title: Guide to the Herbert Stoyan collection on LISP programming Dates: 1955-2001 Bulk Dates: 1957-1990 Collection number: X5687.2010 Collector: Stoyan, Herbert Collection Size: 105 linear feet160 boxes Repository: Computer History Museum Mountain View, CA 94043 Abstract: The Herbert Stoyan collection on LISP programming contains materials documenting the origins, evolution, and use of the LISP programming language and many of its applications in artificial intelligence. Stoyan collected these materials during his career as a researcher and professor, beginning in the former German Democratic Republic (Deutsche Demokratische Republik) and moving to the Federal Republic of Germany (Bundesrepublik Deutschland) in 1981. Types of material collected by Stoyan include memoranda, manuals, technical reports, published and unpublished papers, source program listings, computer media (tapes and flexible diskettes), promotional material, and correspondence. The collection also includes manuscripts of several books written by Stoyan and a small quantity of his personal papers.
    [Show full text]
  • The Evolution of Lisp
    1 The Evolution of Lisp Guy L. Steele Jr. Richard P. Gabriel Thinking Machines Corporation Lucid, Inc. 245 First Street 707 Laurel Street Cambridge, Massachusetts 02142 Menlo Park, California 94025 Phone: (617) 234-2860 Phone: (415) 329-8400 FAX: (617) 243-4444 FAX: (415) 329-8480 E-mail: [email protected] E-mail: [email protected] Abstract Lisp is the world’s greatest programming language—or so its proponents think. The structure of Lisp makes it easy to extend the language or even to implement entirely new dialects without starting from scratch. Overall, the evolution of Lisp has been guided more by institutional rivalry, one-upsmanship, and the glee born of technical cleverness that is characteristic of the “hacker culture” than by sober assessments of technical requirements. Nevertheless this process has eventually produced both an industrial- strength programming language, messy but powerful, and a technically pure dialect, small but powerful, that is suitable for use by programming-language theoreticians. We pick up where McCarthy’s paper in the first HOPL conference left off. We trace the development chronologically from the era of the PDP-6, through the heyday of Interlisp and MacLisp, past the ascension and decline of special purpose Lisp machines, to the present era of standardization activities. We then examine the technical evolution of a few representative language features, including both some notable successes and some notable failures, that illuminate design issues that distinguish Lisp from other programming languages. We also discuss the use of Lisp as a laboratory for designing other programming languages. We conclude with some reflections on the forces that have driven the evolution of Lisp.
    [Show full text]
  • CAL Lisp: Preliminary Description
    ., CAL Lisp: Preliminary Description (Bill Bridge) Gene McDaniel Paul McJones A project for CS 220 and CS 199. / -1---' c> j . ,j.) '~;'4)':j ( ~.' . /1 , I . ! . ".--(-- ,,\--1.::> INTRODUCTION Lisp has been in the forefront of symbol manipulation programming languages for more than a decade and interactive implem~entations on timeshared computer systems have kept it up-to-date. In particular BBN Lisp for the SDS 940 and, more recently, the PDP-10 provide a very large address space and powerful primitive'; ) .. / operations allowing interactive debugging and editting ext~sions, among others, -t to be written in Lisp itself. (1,2). CAL Lisp is an attempt to coninue this line t of development and hopefully harness a fast computer, the CDC 6400, and a not-so­ r fast operating system, the CA~Timesharing system • ..; BBN has diverged from Lisp 1.S (3) in several ways which increase efficiency without, it is felt, detracting from the language. First, a linear pushdown stack replaces the association list scheme for variable bindings and allows compiled functions to reference their arguments directly. (These compiled functions still place the variable names with the values to facilitate debugging and maintain compatibility with interpreted functions.) Second, the property list of an atom is no longer used by Lisp to hold function definitions and constant values. Each atom has three settable attributes: a definition cell, referenced when the atom is used as a function name; a "zero-level value" cell, used when the atom occurs as a free variable bound nowhere in the stack; and a property list cell, purely for use by the user (including the Lisp-coded extensions) as a hatrack.
    [Show full text]
  • Stanford Artificial Tnteliigence Laboratory Memo AIM-228
    Stanford Artificial tnteliigence Laboratory July 1973 Memo AIM-228 Computer Science Department Report No. STAN-CS-74-409 The First Ten Years of Artificial Intelligence Research at Stanford Edited by Lester Earnest ARTIFICIAL INTELLIGENCE PROJECT John McCarthy, Principal Investigator HEURISTIC PROGRAMMING PROJECT Edward Feigenbaum and Joshua Lederberg, Co-principal Investigators Sponsored by ADVANCED RESEARCH PROJECTS AGENCY ARPA Order No. 457 COMPUTER SCIENCE DEPARTMENT Stanford University Stanford Artificial Intelligence Laboratory July 1973 tYlerno AIM-228 Computer Science Department Report No. STAN-CS-74-409 The First Ten Years of Artificial Intelligence Research at Stanford Edited by - Lester Earnest ARTIFICIAL INTELLIGENCE PROJECT John McCarthy, Principal Investigator HEURISTIC PROGRAMMING PROJECT Edward Feigenbaum and Joshua Lederberg, CoAprincipal Investigators ABSTRACT The first ten years of research in artificial intelligence and related fields at Stanford University have yielded significant results in computer vision and control of manipulators, speech recognition, heuristic programming, representation theory, mathematical theory of computation, and modeling of organic chemical processes. This report summarizes the accomplishments and provides bibliographies in each research area. This research runs supported by the Advanced Research Projects Agency of the Department of Defense under Contract SD-153. The views and conclusions contained in this document are those of the authors and should not be interpreted as necessarily representing
    [Show full text]