return { ["benjamin-pierce/923.5.pdf"] = "AGENDA\ Harvard Board of Overseers\ Visiting Committee\ Division of Engineering and Applied Sciences\ -9 Oxford Street\ Cambridge, MA 0-138\ October 10­11, -001\ Wednesday, October 10\ 8:30­9:00 a.m. Executive Session (Brooks Room, Pierce -13)\ ", ["popl/data/00001630.pdf"] = "Practical\ Program\ Verification\ Automatic\ Program\ Proving\ for Real-Time\ John Nagle Scott Johnson\ Embedded Software\ Ford Aerospace and Communications\ Corporation", ["bob-harper/hom-tr.ps"] = "A Type System for Higher­Order Modules\ (Expanded Version)\ Derek Dreyer Karl Crary Robert Harper\ December -00-\ CMU­CS­0-­1--R\ School of Computer Science\ Carnegie Mellon University\ Pittsburgh, PA 1--13\ This report refines and supersedes the original version published in July -00- as CMU Technical Report\ ", ["sarita-adve/models_tutorial-tr.ps"] = "Shared Memory Consistency Models: A Tutorial -Lambda\ Sarita V. Adve y and Kourosh Gharachorloo z\ y Department of Electrical and Computer Engineering\ Rice University\ Houston, Texas 77--1­189-\ z Western Research Laboratory\ Digital Equipment Corporation\ Palo Alto, California 94301­1616\ Rice University ECE Technical Report 9-1-\ ", ["sigplan/2003/pdfs/proceeding/604131/p106-carter.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Folklore Confirmed: Reducible Flow Graphs are Exponentially Larger\ Larry Carter\ Jeanne Ferrante\ Computer Sci. & Eng. Dept. UC San Diego 9500 Gilman Drive La Jolla, CA 92093-0114 USA\ Clark Thomborson\ Dept. of Computer Science University of Auckland Private Bag 92019, Auckland New Zealand", ["sigplan/2003/pdfs/proceeding/781131/p220-lerner.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Automatically Proving the Correctness of Compiler Optimizations\ Sorin Lerner Todd Millstein Craig Chambers\ Department of Computer Science and Engineering University of Washington\ {lerns,todd,chambers}@cs.washington.edu", ["sigplan/2003/pdfs/proceeding/604131/p185-hofmann.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Static Prediction of Heap Space Usage for First-Order Functional Programs\ Martin Hofmann\ LMU Munchen, Institut fur Informatik ¨ ¨ Oettingenstraße © 80538 Munchen, Germany 67, ¨ ¨ mhofmann, jost @informatik.uni-muenchen.de\ Steffen Jost", ["don-knuth/primes.dvi"] = "\ x1 PRINTING PRIMES: AN EXAMPLE OF WEB 1\ \ \ 1. Printing primes: An example of WEB. The\ following program is essentially the same as Edsger\ Dijkstra's \"first example of step-wise program composi-\ tion,\" found on pages 26-39 of his Notes on Structured\ Programming,2 but it has been translated into the WEB\ language.", ["popl/data/00001538.pdf"] = "Eliminating\ Redundant\ Object Codel\ Jack\ W. Davidson$ W. Fraser Science\ Christopher Department\ of Computer of Arizona AZ 85721\ University Tucson,", ["lori-pollock/debugopt.ps.gz"] = "Debugging Optimized Code via Tailoring\ Lori Pollock Mary Bivens Mary Lou Soffa\ University of Delaware Allegheny College University of Pittsburgh\ Newark, DE 19716 Meadville, PA 1633- Pittsburgh, PA 1--60\ pollock@udel.edu mbivens@alleg.edu soffa@pitt.edu\ 30- 831­19-3 814 33-­-880 41- 6-4­84--\ ", ["erik-meijer/dsec.ps"] = "Domain Specific Embedded Compilers\ Daan Leijen and Erik Meijer\ University of Utrecht\ Department of Computer Science\ POBox 80.089, 3-08 TB Utrecht, The Netherlands\ fdaan, erikg@cs.uu.nl, http://www.cs.uu.nl/~fdaan, erikg\ ", ["john-levine/linker09.ps.gz"] = "Shared libraries 1\ Shared libraries\ $Revision: 1.1 $\ $Date: 1998/1-/30 03:00:06 $\ Program libraries date back to the earliest days of computing, but with the\ advent of compiled languages including Fortran and COBOL, libraries be­\ came an integral part of programming since compiled languages need li­\ braries to work. They use libraries explictly when a program calls a stan­\ dard procedure such as sqrt(), and they use libraries implicitly for I/O,\ ", ["popl/data/00001640.pdf"] = "INCREMENTAL\ DATA\ FLOW\ ANALYSIS\ Barbara\ G. Ryder\ Department of Computer Science Rutgers University 08903 New Brunswick, New Jersey", ["popl/data/00001502.pdf"] = "CARRIER\ ARRAYS:\ AN IDIOM-PRESERVING\ EXTENSION\ TO APL\ P.\ Geoffrey\ Lowney Science 06520\ Department of Computer Yale University New Haven, Connecticut\ The idiomatic APL programming style is limited by the constraints of a rectangular, homogeneous array as a data structure. Non-scalar data is difficult to represent and manipulate, and the non-scalar APL functions have no uniform extension to higher rank arrays. The carrier array is an extension to APL which addressea these limitations while preserving the economical APL style. A carrier array is a ragged array with an associated partition which allows functions to be applied to subarrays in parallel. The primitive functions are given base definitions on scalara and vectors, and they are higher by uniform extended to rank arrays application mechanisms. Carrier arrays the laat dimensions of an array to be single datum; the primitive functions extended non-scalar definitions data. defines changes functions. on scalars and alao treated are of allow as a given this", ["popl/abstract/00001624.pdf"] = "", ["luca-cardelli/TypeSystems.ps.bz2"] = "CRC Handbook of Computer Science and Engineering, Ch. 140, Sunday, September -9, 1996, 9:19 am. © CRC Press. 1\ 1 Introduction\ The fundamental purpose of a type system is to prevent the occurrence of execution er­\ rors during the running of a program. This informal statement motivates the study of\ type systems, but requires clarification. Its accuracy depends, first of all, on the rather\ subtle issue of what constitutes an execution error, which we will discuss in detail.\ Even when that is settled, the absence of execution errors is a nontrivial property.\ When such a property holds for all of the program runs that can be expressed within a\ programming language, we say that the language is type sound. It turns out that a fair\ ", ["norman-ramsey/mld.ps"] = "burg\ BURS\ rewrite\ engine\ Hand­\ written\ code\ generator\ optimization\ ", ["popl/abstract/00001421.pdf"] = "", ["popl/data/00001528.pdf"] = "MESSAGES AS ACTIVE David Computer The W. Wall\ AGENTS>+\ Science\ Department\ Pennsylvania University\ State University 16802 Park, PA", ["neal-glew/mcrt/Fortress/p109-allen.pdf"] = "Object­Oriented Units of Measurement\ Eric Allen David Chase Victor Luchangco Jan­Willem Maessen Guy L. Steele Jr.\ Sun Microsystems Laboratories\ Burlington MA 01803\ .@sun.com", ["george-luger/LambdaCalculus.pdf"] = "A Stochastic l­Calculus\ Content Areas: probabilistic reasoning, knowledge representation, causality\ Tracking Number: 77-\ ", ["sigplan/2003/pdfs/proceeding/940880/frontmatter.pdf"] = "Main TOC\ Proceedings TOC\ Search\ ACM SIGPLAN Erlang Workshop '03 A Satellite Event of PLI 2003\ August 29, 2003 Uppsala, Sweden\ Sponsored by\ ACM SIGPLAN\ The Association for Computing Machinery, Inc. 1515 Broadway New York, New York 10036", ["neal-glew/mcrt/AliceML/alice-looking-glass-extended.pdf"] = "Alice ML Through the Looking Glass (Draft)\ Andreas Rossberg Didier Le Botlan Guido Tack\ Thorsten Brunklaus Gert Smolka\ December 21, 2004\ intellect tm", ["popl/abstract/00001638.pdf"] = "", ["sigplan/2003/pdfs/proceeding/780732/p69-dhurjati.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Memory Safety Without Runtime Checks or Garbage Collection\ Dinakar Dhurjati\ Sumant Kowshik Vikram Adve University of Illinois at Urbana-Champaign\ {dhurjati,kowshik,vadve,lattner}@cs.uiuc.edu\ Chris Lattner", ["nancy-leveson/leveson-steam-engines.pdf"] = "\ 999 9999 9999 9999 9999  \r!\" #%$'&(\r )$* ,+-. \r./\ 013246587:9;=,, Reader Help. Press F1.", ["cormac-flanagan/type-effect.ps"] = "A Type and Effect System for Atomicity\ Cormac Flanagan Shaz Qadeer\ HP Systems Research Center Microsoft Research\ 1-01 Page Mill Road One Microsoft Way\ Palo Alto, CA 94304 Redmond, WA 980--\ ", ["sigplan/2003/pdfs/proceeding/774833/p151-gansner.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Visualizing Software for Telecommunication Services\ Emden R. Gansner AT&T Labs­Research 180 Park Avenue Florham Park, NJ 07932", ["popl/data/00001448.pdf"] = "The\ Equivalence with\ Problem Nonintersecting Harry R. in\ for\ Program Loops\ Schemata\ Lewist Computing Technology\ Center\ for\ Research Harvard", ["john-reppy/cml-pldi.pdf"] = "CML: A Higher-order\ Concurrent\ Language*\ John H. Reppy Cornell\ jhr@cs.\ University\ cornell. eciu\ 1\ Introduction\ inherits values,", ["peter-sestoft/match.ps.gz"] = "ML pattern match compilation\ and partial evaluation ?\ Peter Sestoft\ (sestoft@dina.kvl.dk)\ Department of Mathematics and Physics\ Royal Veterinary and Agricultural University\ Thorvaldsensvej 40, DK­1871 Frederiksberg C, Denmark\ Abstract: We derive a compiler for ML­style pattern matches. It is conceptu­\ ally simple and produces reasonably good compiled matches. The derivation is\ ", ["sigplan/2003/pdfs/proceeding/781498/p1-prabhu.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Using Thread-Level Speculation to Simplify Manual Parallelization\ Manohar K. Prabhu\ Stanford University Computer Systems Laboratory Stanford, California 94305\ Kunle Olukotun\ Stanford University Computer Systems Laboratory Stanford, California 94305\ mkprabhu@stanford.edu", ["arvind/memo-421a.ps.gz"] = "Hardware Synthesis from Term Rewriting Systems\ Computation Structures Group Memo 4-1A\ August -0, 1999\ James C. Hoe and Arvind\ MIT Laboratory for Computer Science\ Cambridge, MA 0-139\ fjhoe,arvindg@lcs.mit.edu\ To appear in Proceedings of VLSI'99.\ This paper describes research done at the MIT Laboratory for Computer Science. Funding\ ", ["sigplan/2003/pdfs/proceeding/888251/p32-garciadelabanda.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Finding All Minimal Unsatisfiable Subsets\ Maria Garcia de la Banda\ School of Comp. Sci and Soft. Eng Monash University, 3800 Australia\ Peter J. Stuckey, Jeremy Wazny\ Dept of Comp. Sci and Soft. Eng University of Melbourne, 3010 Australia\ {pjs,jeremyrw}@cs.mu.oz.au\ mbanda@csse.monash.edu.au", ["seth-goldstein/Lazy Threads Implementing a Fast Parallel Call.pdf"] = "stacks, called a cactus stack. Unfortunately, a parallel call\ or thread fork is fundamentally more expensive than a\ sequential call because of the thread and storage manage­\ ment, data transfer, scheduling, and synchronization in­\ volved. Previous work has sought to reduce this cost by\ using a combination of compiler techniques and clever run­\ time representations [9, 21, 26, 29, 30, 33, 35, 37, 39], and\ by supporting fine­grained parallel execution directly in\ hardware [3, 19, 31]. In many cases, the cost of the fork is\ reduced by severely restricting what can be done in a", ["popl/data/00001507.pdf"] = "Paging\ as a \"Language\ Processing\"\ Task\ Michael W. Condryl Department of Electrical Engineering and Computer Princeton University Science", ["popl/data/00001478.pdf"] = "Data\ Types,\ Parameters\ and\ Type\ Checking\ Alan James Department Cornell Ithaca, of\ J.\ Demers\ 1%. Donahue Computer Science", ["phil-wadler/classhask.dvi"] = "\ \ \ \ TYPE CLASSES IN HASKELL\ \ \ \ CORDELIA HALL, KEVIN HAMMOND, SIMON PEYTON JONES, PHILIP WADLER\ UNIVERSITY OF GLASGOW", ["james-stichnoth/p118-stichnoth.pdf"] = "Support\ f\ o\ r\ G\ a\ r\ ba\ g\ ", ["neal-glew/mcrt/Parallel functional languages/strategies.ps"] = "J. Functional Programming 1 (1): 1--000, January 1993 c\ fl 1993 Cambridge University Press 1\ Algorithm + Strategy = Parallelism\ P.W. TRINDER\ Department of Computing Science, University of Glasgow, Glasgow, UK\ K. HAMMOND\ Division of Computing Science, University of St Andrews, St Andrews, UK\ H.­W. LOIDL AND S.L. PEYTON JONES y\ Department of Computing Science, University of Glasgow, Glasgow, UK", ["sigplan/2003/pdfs/sigp/966051/p76-biddle.pdf"] = "Main TOC\ Newsletter TOC\ Search\ No Name: Just Notes on Software Reuse\ Robert Biddle, Angela Martin, James Noble Victoria University of Wellington, New Zealand. {robert,angela,kjx}@mcs.vuw.ac.nz", ["john-levine/linker06.ps.gz"] = "Libraries 1\ Libraries\ $Revision: 1.1 $\ $Date: 1999/01/0- 09:38:11 $\ Every modern linker handles libraries, collections of object files that are\ included as needed in a linked program. In this chapter we cover tradi­\ tional statically linked libraries, leaving the more complex shared libraries\ to Chapters 9 and 10.\ Purpose of libraries\ ", ["popl/data/00001700.pdf"] = "Process Logic: V.\ Preliminary R. Pratt M. LT.\ Report", ["sigplan/2003/pdfs/proceeding/781498/p216-taura.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Phoenix : a Parallel Programming Model for Accommodating Dynamically Joining/Leaving Resources\ Kenjiro Taura\ University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo, 113-0033, Japan\ Kenji Kaneda\ University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo, 113-0033 Japan\ tau@logos.t.u-tokyo.ac.jp Toshio Endo", ["richard-bird/jfphaste.dvi"] = "\ \ \ More haste, less speed:\ \ \ lazy versus eager evaluation\ \ \ ", ["john-gough/gough94interpretive.ps.gz"] = "Interpretive Debugging of Optimised Code\ John Gough, Jeff Ledermann and Kim Elms -Lambda\ ", ["sigplan/2003/pdfs/sigp/944579/p29-costanza.pdf"] = "Main TOC\ Newsletter TOC\ Search\ Dynamically Scoped Functions as the Essence of AOP\ Pascal Costanza University of Bonn, Institute of Computer Science III R¨merstr. 164, D-53117 Bonn, Germany o costanza@web.de, http://www.pascalcostanza.de June 17, 2003", ["steven-lavalle/AtrLav02.ps"] = "E#cient Nearest Neighbor Searching for Motion Planning\ Anna Atramentov Steven M. LaValle\ Dept. of Computer Science Dept. of Computer Science\ Iowa State University University of Illinois\ Ames, IA -0011 USA Urbana, IL 61801 USA\ anjuta@cs.iastate.edu lavalle@cs.uiuc.edu\ ", ["sigplan/2003/pdfs/proceeding/781131/p115-praun.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Static Conflict Analysis for Multi-Threaded Object-Oriented Programs\ Christoph von Praun and Thomas R. Gross\ Laboratory for Software Technology ETH Zurich ¨ 8092 Zurich, Switzerland ¨", ["popl/data/00001712.pdf"] = "STRING\ PATTERN\ MATCHING\ IN\ POLYNOMIAL\ TIME*\ (Extended K. University of C. Liu", ["bernecky.ps"] = "APEX:\ THE APL PARALLEL EXECUTOR\ by\ Robert Bernecky\ A thesis submitted in conformity with the requirements\ for the degree of Master of Science\ Graduate Department of Computer Science\ University of Toronto\ Copyright c\ # 1997 by Robert Bernecky", ["sigplan/2003/pdfs/proceeding/781131/p1-gay.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ The nesC Language: A Holistic Approach to Networked Embedded Systems\ http://nescc.sourceforge.net\ David Gay dgay@intel-research.net Matt Welsh mdw@intel-research.net\ Philip Levis pal@cs.berkeley.edu Eric Brewer brewer@cs.berkeley.edu\ Robert von Behren jrvb@cs.berkeley.edu David Culler culler@cs.berkeley.edu\ EECS Department University of California, Berkeley Berkeley, CA 94720", ["neal-glew/mcrt/Fortress/fortress0707.pdf"] = "The Fortress Language Specification\ Version 0.707\ Eric Allen\ David Chase\ Victor Luchangco\ Jan­Willem Maessen\ Sukyoung Ryu\ Guy L. Steele Jr.\ Sam Tobin­Hochstadt\ Additional contributors:", ["john-regehr/hoist.pdf"] = "HOIST: A System for Automatically Deriving\ Static Analyzers for Embedded Systems\ John Regehr Alastair Reid\ School of Computing, University of Utah\ ", ["neal-glew/mcrt/X10/x10-concur.pdf"] = "Concurrent Clustered Programming #", ["norman-ramsey/team.ps"] = "Literate Programming on a Team Project -Lambda\ Norman Ramsey y and Carla Marceau\ Odyssey Research Associates\ 301A Harris B. Dates Drive\ Ithaca, New York 148-0\ February 4, 1991\ ", ["norman-ramsey/sync.ps"] = "Reprinted from Foundations of Software Engineering -001\ An Algebraic Approach to File Synchronization\ Norman Ramsey\ Division of Engineering and Applied Sciences\ Harvard University\ Cambridge, USA\ nr@eecs.harvard.edu\ El}od Csirmaz\ Mihaly Fazekas Secondary Grammar School\ ", ["john-reynolds/defintintro.ps.gz"] = ", , 1--8 ()\ c\ fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.\ Definitional Interpreters Revisited\ JOHN C. REYNOLDS john.reynolds@cs.cmu.edu\ School of Computer Science, Carnegie Mellon University\ Abstract. To introduce the republication of ``Definitional Interpreters for Higher­Order Pro­\ gramming Languages'', the author recounts the circumstances of its creation, clarifies several\ obscurities, corrects a few mistakes, and briefly summarizes some more recent developments.\ ", ["sigplan/2003/pdfs/proceeding/780732/p133-deniz.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Time Weaver: A Software-Through-Models Framework for Embedded Real-Time Systems\ Dionisio de Niz and Raj Rajkumar Real-Time and Multimedia Systems Laboratory Departments of Electrical and Computer Engineering, and Computer Science Carnegie Mellon University\ dionisio@cs.cmu.edu, raj@ece.cmu.edu", ["neal-glew/mcrt/AliceML/vmservices.pdf"] = "Open Programming Services for Virtual Machines\ The Design of Mozart and SEAM\ Thorsten Brunklaus\ Programming Systems Lab\ Saarland University\ Postfach 15 11 50\ 66041 Saarbrücken, Germany\ brunklaus@ps.uni­sb.de\ Leif Kornstaedt\ Programming Systems Lab", ["popl/data/00001421.pdf"] = "MATHEMATICAL\ SEMANTICS\ and\ DATA\ FLOW\ PROGRAMMING\ Paul Massachusetts Cambridge,\ R.\ Kosinski Technology 02139\ Project MAC Institute of Massachusetts and IBM Research ??ew York", ["norman-ramsey/xtoplas.ps"] = "A Transformational Approach to\ Binary Translation of Delayed Branches\ NORMAN RAMSEY\ Division of Engineering and Applied Sciences\ Harvard University, Cambridge, MA 01-38 USA\ nr@eecs.harvard.edu\ and\ CRISTINA CIFUENTES\ Department of Computer Science and Electrical Engineering\ ", ["mark-jones/fp-ovl-hop.ps.gz"] = "Functional Programming with Overloading and\ Higher-Order Polymorphism\ Mark P. Jones\ Department of Computer Science, University of Nottingham, University Park,\ Nottingham NG7 2RD, UK.", ["sigplan/2003/pdfs/proceeding/949305/p187-ishizaki.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Effectiveness of Cross-Platform Optimizations for a Java Just-In-Time Compiler\ Kazuaki Ishizaki, Mikio Takeuchi, Kiyokuni Kawachiya, Toshio Suganuma, Osamu Gohda, Tatsushi Inagaki, Akira Koseki, Kazunori Ogata, Motohiro Kawahito, Toshiaki Yasue, Takeshi Ogasawara, Tamiya Onodera, Hideaki Komatsu, and Toshio Nakatani\ IBM Research, Tokyo Research Laboratory 1623-14 Shimotsuruma, Yamato, Kanagawa, 242-8502, Japan ishizaki@trl.ibm.com", ["dagstuhl/00451.ps.gz"] = "Eective Implementation of Object-Oriented\ Programming Languages\ Dagstuhl-Seminar-Report: 004-1\ 0-.11.-000-10.11.-000\ Organized by\ Uwe Aÿmann, Linköping University\ Laurie Hendren, McGill University\ Barbara Ryder, Rutgers University (on sabbatical\ leave -000--001 at IBM T.J. Watson Research Center)\ ", ["sigplan/2003/pdfs/sigp/944579/p60-kumar.pdf"] = "Main TOC\ Newsletter TOC\ Search\ Value Reuse Optimization: Reuse of Evaluated Math Library Function Calls Through Compiler Generated Cache.", ["bryan-loyall/thesis.ps"] = "Believable Agents:\ Building Interactive Personalities\ A. Bryan Loyall\ May 1997\ CMU­CS­97­1-3\ School of Computer Science\ Computer Science Department\ Carnegie Mellon University\ Pittsburgh, PA 1--13\ ", ["modules/p214-stone.pdf"] = "A\ b\ s\ t\ r\ a\ c\ t\ 1\ ", ["norman-ramsey/lpsimp.djvu"] = "Literate. programming \ tøo, ls let you'arrange.:the \ pods' of'a.program' in \ any order and extract \ documentotio:n \"and'c o de \ from the same source \ file. The author argues \ that. language-depen- \ lence 'and feature com- \ plexity' hove\" 'hampered ", ["peter-thiemann/embedded-toit.pdf"] = "An Embedded Domain-Specific Language for Type-Safe Server-Side Web Scripting\ PETER THIEMANN Universitat Freiburg, Germany ¨", ["frank-pfenning/mscs00.pdf"] = "Under consideration for publication in Math. Struct. in Comp. Science\ A Judgmental Reconstruction of Modal\ Logic\ FRANK PFENN I NG + and ROWAN DAV I ES\ Department of Computer Science\ Carnegie Mellon University\ Received May -000\ We reconsider the foundations of modal logic, following Martin­L˜of 's methodology of\ distinguishing judgments from propositions. We give constructive meaning explanations\ ", ["popl/data/00001704.pdf"] = "SPACE-TIME\ TRADEOFFS\ FOR\ LINEAR\ RECURSION\ ;t\ Sowmitri\ Coordinated Department University Urbana,\ Swamy Science of of Illinois Electrical Illinois 61801, USA Laboratory and Engineering\ John Division Brown", ["lutz-prechelt/comparison.pdf"] = "0018­916-/00/$10.00 © -000 IEEE October -000 -3\ C O M P U T I N G P R A C T I C E S\ PLOTS AND STATISTICAL METHODS\ My study used the multiple boxplot display shown in\ Figure 1 for its main evaluation tool. Each of the lines\ represents one subset of data, with its name appearing\ to the left. Each small circle stands for an individual\ data value. The rest of the plot provides visual aids for\ the comparison of two or more such data subsets. The\ ", ["sigplan/2003/pdfs/proceeding/780732/p42-schultz.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Compiling Java for Low-End Embedded Systems\ Ulrik Pagh Schultz\ Center for Pervasive Computing, Univ. of Aarhus Aabogade 34 DK-8200 Aarhus N, Denmark\ Kim Burgaard\ Systematic Software Engineering A/S Søren Frichs Vej 39 DK-8000 Aarhus C, Denmark\ Flemming Gram Christensen Jørgen Lindskov Knudsen", ["benjamin-pierce/lenses-full.pdf"] = "A Language for Bi­Directional Tree Transformations\ Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce,\ Alan Schmitt, and Nate Foster\ Technical Report MS­CIS­03­08\ Department of Computer and Information Science\ University of Pennsylvania\ August -, -003\ Revised May 1-, -004\ ", ["popl/data/00001468.pdf"] = "Conference\ Record\ of\ the\ Fifth\ Annual\ ACM\ Symposium\ on\ Principles", ["kevin-sullivan/dsmtool.pdf"] = "Software Design as Meta­Space Construction and Search:\ The Hierarchical Environment and Design Structure Matrix\ Kevin Sullivan Yuanfang Cai\ University of Virginia University of Virginia\ Department of Computer Science Department of Computer Science\ Charlottesville, VA --904­4740 USA Charlottesville, VA --904­4740 USA\ Tel: +1 804 98- --06 Tel: +1 804 98- --9-\ sullivan@virginia.edu yc7a@virginia.edu\ ", ["sigplan/2003/pdfs/proceeding/604131/backmatter.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Author Index\ Acar, U. A. .......................................................14 Bacon, D. F.....................................................285 Ball, T...............................................................97 Barthe, G. .......................................................250 Blelloch, G. E. ..................................................14 Boehm, H.-J....................................................262 Bouajjani, A......................................................62 Boyapati, C.....................................................213 Carter, L. ........................................................106 Chakaravarthy, V. T. ......................................115 Chen, C...........................................................224 Chen, G...................................................150, 224 Cheng, P. ........................................................285 Cirstea, H........................................................250 Considine, J. ...................................................160 Crary, K.......................................... 172, 198, 236 Dreyer, D. .......................................................236 Esparza, J..........................................................62 Ferrante, J. ......................................................106 Gheorghioiu, O...............................................273 Gil, J. (Y.)...............................................126, 160 Gulwani, S. .......................................................74 Gupta, R. ..........................................................85 Harper, R. ......................................... 14, 172, 236 Hofmann, M. ..................................................185 Jensen, O. H......................................................38 Jost, S..............................................................185 Kirchner, C. ....................................................250 Liquori, L........................................................250 Liskov, B. .......................................................213 Milner, R...........................................................38 Naik, M.............................................................97 Necula, G. C. ....................................................74 Nielsen, M. F. ...................................................26 Petersen, L. .....................................................172 Pfenning, F. ....................................................172 Rajamani, S. K..................................................97 Rajan, V. T. ....................................................285 Rinard, M........................................................273 Slcianu, A. ....................................................273 Schmitt, A.........................................................50 Shrira, L..........................................................213 Siméon, J. ...........................................................1 Stefani, J.-B. .....................................................50 Taha, W. ...........................................................26 Tallam, S...........................................................85 Thielecke, H. ..................................................139 Thomborson, C. ..............................................106 Touili, T............................................................62 Wadler, P. ...........................................................1 Xi, H. ..............................................................224 Zibin, Y...................................................126, 160\ 299", ["neal-glew/mcrt/X10/Vivek_Sarkar_LaR_04_Paper_V1.pdf"] = "X10: Programming for Hierarchical Parallelism and\ Non­Uniform Data Access", ["david-patterson/science-2005.pdf"] = "EDITORIAL\ www.sciencemag.org SCIENCE VOL 308 6 MAY -00- 7-7\ N ext month, U.S. scientists Vinton G. Cerf and Robert E. Kahn will receive computing's highest prize,\ the A. M.TuringAward, from the Association for Computing Machinery. Their Transmission Control\ Protocol (TCP), created in 1973, became the language of the Internet. Twenty years later, the Mosaic\ Web browser gave the Internet its public face. TCP and Mosaic illustrate the nature of computer\ science research, combining a quest for fundamental understanding with considerations of use. They\ also illustrate the essential role of government­sponsored university­based research in producing the\ ideas and people that drive innovation in information technology (IT).\ ", ["paul-hudak/modular-interpreters.ps.gz"] = "MonadTransformersand Modular Interpreters -Lambda\ Sheng Liang Paul Hudak Mark Jones y\ Yale University\ Department of Computer Science\ New Haven, CT 06--0­8-8-\ fliang,hudak,jones­markg@cs.yale.edu\ ", ["norman-ramsey/els.dvi"] = "", ["sigplan/2003/pdfs/proceeding/949305/p1-lafferty.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Language-Independent Aspect-Oriented Programming\ Donal Lafferty Donal.Lafferty@cs.tcd.ie\ Distributed Systems Group Department of Computer Science Trinity College Dublin\ Vinny Cahill Vinny.Cahill@cs.tcd.ie", ["david-hanson/lcc-asdl.ps.gz"] = "Early Experience with ASDL in lcc\ David R. Hanson\ Microsoft Research\ drh@microsoft.com\ September 1998\ Technical Report\ MSR­TR­98­-0\ Microsoft Research\ Microsoft Corporation\ ", ["modules/p123-harper.pdf"] = "A Type-Theoretic\ Approach\ Robert\ to Higher-Order\ Mark Computer Mellon PA Lillibridge$ Science University 15213-3891\ Modules\ with\ Sharing*\ Harpert School Carnegie Pittsbwgh, of", ["sigplan/2003/pdfs/proceeding/949305/p403-boyapati.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Lazy Modular Upgrades in Persistent Object Stores\ Chandrasekhar Boyapati, Barbara Liskov, Liuba Shrira , Chuang-Hue Moh, Steven Richman\ MIT Computer Science and Artificial Intelligence Laboratory 200 Technology Square, Cambridge, MA 02139\ {chandra,liskov,liuba,chmoh,richman}@lcs.mit.edu", ["sigplan/2003/pdfs/proceeding/780732/p232-corliss.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ A DISE Implementation of Dynamic Code Decompression\ Marc L. Corliss E Christopher Lewis Amir Roth\ Department of Computer and Information Science University of Pennsylvania Philadelphia, Pennsylvania USA\ {mcorliss,lewis,amir}@cis.upenn.edu", ["ethan-munson/proteus.ps.gz"] = "Proteus: An Adaptable Presentation System for a\ Software Development and Multimedia Document\ Environment\ Ethan Vincent Munson\ Report No. UCB/CSD­94­833\ September 1994\ Computer Science Division (EECS)\ University of California\ Berkeley, California 947-0\ ", ["kathleen-fisher/pldi99.ps"] = "The design of a class mechanism for MOBY\ Kathleen Fisher\ AT&T Labs, Research\ kfisher@research.att.com\ John Reppy\ Bell Labs, Lucent Technologies\ jhr@research.bell­labs.com\ ", ["bill-aitken/92-tr-aitken.ps.gz"] = "Abstract Value Constructors\ Symbolic Constants for Standard ML\ William E. Aitken -Lambda\ John H. Reppy y\ TR 9-­1-90\ June 199-\ Department of Computer Science\ Cornell University\ Ithaca, NY 148-3\ ", ["views/ActivePatterns_IFL96.pdf"] = "\ 999 9999 9999 9999 9999 9999 9999 9999 9999 9999 \ ÷§p ú§Hú§T¸ òèõDBчDåDê‰I\ LNMPOAQRTSVUXWYOZOCSY-&^\ _a`4b.c.d\ UXWYOZOCSY\ jlk8mn>opqsr,k-mntqsuv\ w uyx wz k87{|m w%} uqstn~.kY€‚,mnƒ\ w uq\ ", ["popl/abstract/00001438.pdf"] = "", ["mixins/mixins-mm.pdf"] = "A Reduction Semantics for Call­by­value Mixin Modules\ Tom Hirschowitz\ INRIA Rocquencourt\ Tom.Hirschowitz@inria.fr\ Xavier Leroy\ INRIA Rocquencourt\ Xavier.Leroy@inria.fr\ J. B. Wells\ Heriot­Watt University\ ", ["tony-hoare/emperor.pdf"] = "The 1980 ACM Turing Award Lecture\ Delivered at ACM '80, Nashville, Tennessee, October 27, 1980\ The 1980 A C M Turing Award was presented to Charles Antony Richard Hoare, Professor of Computation at the University of Oxford, England, by Walter Carlson, Chairman of the Awards committee, at the A C M Annual Conference in Nashville, Tennessee, October 27, 1980. Professor Hoare was selected by the General Technical Achievement Award Committee for his fundamental contributions to the definition and design of programming languages. His work is characterized by an unusual combination of insight, originality, elegance, and impact. He is best known for his work on axiomatic definitions of programming languages through the use of techniques popularly referred to as axiomatic semantics. He developed ingenious algorithms such as Quicksort and was responsible for inventing and promulgating advanced data structuring techniques in scientific programming languages. He has also made important contributions to operating systems through the study of monitors. His most recent work is on communicating sequential processes. C.A.R. I-Ioare Prior to his appointment to the University of Oxford in 1977, Professor Hoare was Professor of Computer Science at The Queen's University in Belfast, Ireland from 1968 to 1977 and was a Visiting Professor at Stanford University in 1973. From 1960 to 1968 he held a number of positions with Elliot Brothers, Ltd., England. Professor Hoare has published extensively and is on the editorial boards of a n u m b e r of the world's foremost computer science journals. In 1973 he received the A C M Programming Systems and Languages Paper Award. Professor Hoare became a Distinguished Fellow of the British Computer Society in 1978 and was awarded the degree of Doctor of Science Honoris Causa by the University of Southern California in 1979. The Turing Award is the Association for Computing Machinery's highest award for technical contributions to the computing community. It is presented each year in commemoration of Dr. A. M. Turing, an English mathematician who made m a n y important contributions to the computing sciences.\ The Emperor's Old Clothes\ Charles Antony Richard Hoare Oxford University, England\ The author recounts his experiences in the implementation, design, and standardization of computer programruing languages, and issues a warning for the future. Key Words and Phrases: programming languages, history of programming languages, lessons for the future CR Categories: 1.2, 2.11, 4.2 Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. Author's present address: C. A. R. Hoare, 45 Banbury Road, Oxford OX2 6PE, England. © 1981 ACM 0001-0782/81/0200-0075 $00.75.\ 75 My first and most pleasant duty in this lecture is to express m y profound gratitude to the Association for Computing Machinery for the great honor which they have bestowed on me and for this opportunity to address you on a topic of m y choice. What a difficult choice it is! My scientific achievements, so amply recognized by this award, have already been amply described in the scientific literature. Instead o f repeating the abstruse technicalities of m y trade, I would like to talk informally about myself, m y personal experiences, my hopes and fears, my modest successes, and m y rather less modest failures. I have learned more from m y failures than can ever be revealed in the cold print of a scientific article and now I would like you to learn from them, too. Besides, failures Communications of the ACM February 1981 Volume 24 Number 2\ are much more fun to hear about afterwards; they are not so funny at the time. I start my story in August 1960, when I became a programmer with a small computer manufacturer, a division of Elliott Brothers (London) Ltd., where in the next eight years I was to receive my primary education in computer science. My first task was to implement for the new Elliot 803 computer, a library subroutine for a new fast method of internal sorting just invented by Shell. I greatly enjoyed the challenge of maximizing efficiency in the simple decimal-addressed machine code of those days. My boss and tutor, Pat Shackleton, was very pleased with my completed program. I then said timidly that I thought I had invented a sorting method that would usually run faster than SHELLSORX,without taking much extra store. He bet me sixpence that I had not. Although my method was very difficult to explain, he finally agreed that I had won my bet. I wrote several other tightly coded library subroutines but after six months I was given a much more important task--that of designing a new advanced high level programming language for the company's next computer, the Elliott 503, which was to have the same instruction code as the existing 803 but run sixty times faster. In spite of my education in classical languages, this was a task for which I was even less qualified than those who undertake it today. By great good fortune there came into my hands a copy of the Report on the International Algorithmic Language ALGOL 60. Of course, this language was obviously too complicated for our customers. How could they ever understand all those begins and ends when even our salesmen couldn't? Around Easter 1961, a course on ALGOL 60 was offered in Brighton, England, with Peter Naur, Edsger W. Dijkstra, and Peter Landin as tutors. I attended this course with my colleague in the language project, Jill Pym, our divisional Technical Manager, Roger Cook, and our Sales Manager, Paul King. It was there that I first learned about recursive procedures and saw how to program the sorting method which I had earlier found such difficulty in explaining. It was there that I wrote the procedure, immodestly named QUICKSORX, on which my career as a computer scientist is founded. Due credit must be paid to the genius of the designers of ALGOL 60 who included recursion in their language and enabled me to describe my invention so elegantly to the world. I have regarded it as the highest goal of programming language design to enable good ideas to be elegantly expressed. After the ALGOLcourse in Brighton, Roger Cook was driving me and my colleagues back to London when he suddenly asked, \"Instead of designing a new language, why don't we just implement ALGOL60?\" We all instantly agreed--in retrospect, a very lucky decision for me. But we knew we did not have the skill or experience at that time to implement the whole language, so I was commissioned to design a modest subset. In that design I\ 76\ adopted certain basic principles which I believe to be as valid today as they were then. (1) The first principle was security: The principle that every syntactically incorrect program should be rejected by the compiler and that every syntactically correct program should give a result or an error message that was predictable and comprehensible in terms of the source language program itself. Thus no core dumps should ever be necessary. It was logically impossible for any source language program to cause the computer to run wild, either at compile time or at run time. A consequence of this principle is that every occurrence of every subscript of every subscripted variable was on every occasion checked at run time against both the upper and the lower declared bounds of the array. Many years later we asked our customers whether they wished us to provide an option to switch off these checks in the interests of efficiency on production runs. Unanimously, they urged us not t o - - t h e y already knew how frequently subscript errors occur on production runs where failure to detect them could be disastrous. I note with fear and horror that even in 1980, language designers and users have not learned this lesson. In any respectable branch of engineering, failure to observe such elementary precautions would have long been against the law. (2) The second principle in the design of the implementation was brevity of the object code produced by the compiler and compactness of run time working data. There was a clear reason for this: The size of main storage on any computer is limited and its extension involves delay and expense. A program exceeding the limit, even by one word, is impossible to run, especially since many of our customers did not intend to purchase backing stores. This principle of compactness of object code is even more valid today, when processors are trivially cheap in comparison with the amounts of main store they can address, and backing stores are comparatively even more expensive and slower by many orders of magnitude. If as a result of care taken in implementation the available hardware remains more powerful than may seem necessary for a particular application, the applications programmer can nearly always take advantage of the extra capacity to increase the quality of his program, its simplicity, its ruggedness, and its reliability. (3) The third principle of our design was that the entry and exit conventions for procedures and functions should be as compact and efficient as for tightly coded machinecode subroutines. I reasoned that procedures are one of the most powerful features of a high level language, in that they both simplify the programming task and shorten the object code. Thus there must be no impediment to their frequent use. (4) The fourth principle was that the compiler should use only a single pass. The compiler was structured as a collection of mutually recursive procedures, each capable", ["david-goldberg/floating.pdf"] = "What Every Computer Scientist Floating-Point Arithmetic\ DAVID GOLDBERG\ Xerox Palo\ Should\ Know About\ Alto\ Research\ Center,\ 3333 Coyote Hill\ Road,", ["popl/data/00001546.pdf"] = "Building\ Friendly\ Parsers\ Fahimeh Department\ Jalili,\ Jean\ H.\ Gallier Sciences 19104\ of Computer University Philadelphia,\ and Information of Pennsylvania Pennsylvania", ["gordon-plotkin/Ad_Alg_Eff.ps.gz"] = "Adequacy for Algebraic E#ects\ Gordon Plotkin and John Power #\ Division of Informatics, University of Edinburgh, King's Buildings,\ Edinburgh EH9 3JZ, Scotland\ Abstract. Moggi proposed a monadic account of computational e#ects.\ He also presented the computational #­calculus, #c , a core call­by­value\ functional programming language for e#ects; the e#ects are obtained by\ adding appropriate operations. The question arises as to whether one\ can give a corresponding treatment of operational semantics. We do\ ", ["popl/data/00001402.pdf"] = "STRUCTURED EXCEPTION HANDLING;: John B. Goodenough SofTech, Inc. Waltham, Mass.\ Summary In conditions this paper, we define what exception discuss the requirements exception are,\ handling language features must satisfy, survey and analyze existing approaches to exception handling, and propose some new language features for dealing with exceptions in an orderly and reOur objective is not solely to put forliable way. ward a lanugage proposal. to analyze It is also exception handling is sues and principles in detail. The proposed language features serve to highlight exception handling issues by showing how defic iencies in current approaches could be remedied in a coherent and orderly way.\ In essence, exceptions permit the user of an operation to extend the operations domain (i. e. , the set of inputs for which effects are defined) or its range (the effects obtained when certain inputs Exceptions permit a user to are processed). tailor an operations results or effects to his particular purpose in using the operation. In~hort, operations, making exceptions s erve to generalize them would tions usable in otherwise are\ q\ a wider be the\ variety case.\ of contexts Specifically,\ than excep-\ used: to permit impending will", ["marc-feeley/09-germain.pdf"] = "Concurrency Oriented Programming in Termite Scheme\ Guillaume Germain Marc Feeley Stefan Monnier\ Universit´ de Montr´ al e e {germaing, feeley, monnier}@iro.umontreal.ca", ["mark-jones/springschool95.dvi"] = "\ \ Functional Programming with Overloading and\ \ Higher-Order Polymorphism\ Mark P. Jones\ \ \ Department of Computer Science, University of Nottingham, University Park,\ Nottingham NG7 2RD, UK.", ["norman-ramsey/staged.pdf"] = "Reprinted from Proceedings of the 33rd ACM Symposium on the Principles of Programming Languages (POPL'06)\ Staged Allocation: A Compositional Technique for Specifying and Implementing Procedure Calling Conventions\ Reuben Olinsky\ Division of Engineering and Applied Sciences Harvard University olinsky@post.harvard.edu\ Christian Lindig\ Division of Engineering and Applied Sciences Harvard University lindig@eecs.harvard.edu\ Norman Ramsey\ Division of Engineering and Applied Sciences Harvard University nr@eecs.harvard.edu", ["sigplan/2003/acrobat/win/Resource/ENUtxt.pdf"] = "Just keep examining every low bid quoted for zinc etchings.", ["bryan-loyall/CMU-CS-97-123.ps"] = "Believable Agents:\ Building Interactive Personalities\ A. Bryan Loyall\ May 1997\ CMU­CS­97­1-3\ School of Computer Science\ Computer Science Department\ Carnegie Mellon University\ Pittsburgh, PA 1--13\ ", ["popl/abstract/00001526.pdf"] = "", ["ben-zorn/zorn.ps"] = "The Measured Cost of\ Conservative Garbage Collection\ Benjamin Zorn\ Department of Computer Science\ Campus Box #430\ University of Colorado, Boulder 80309--0430\ CU­CS­-73­9- April 199-\ -Xi\ University of Colorado at Boulder\ ", ["popl/data/00001447.pdf"] = "", ["popl/abstract/00001361.pdf"] = "", ["tony-hosking/transactional.pdf"] = "Transactional Monitors for Concurrent Objects\ Adam Welc, Suresh Jagannathan, and Antony L. Hosking\ Department of Computer Sciences\ Purdue University\ West Lafayette, IN 47906\ {welc,suresh,hosking}@cs.purdue.edu\ ", ["norman-ramsey/pmonad.ps"] = "Reprinted from the Conference Record of the -9th Annual ACM Symposium on Principles of Programming Languages (POPL'0-)\ Stochastic Lambda Calculus and\ Monads of Probability Distributions\ Norman Ramsey Avi Pfeffer\ Division of Engineering and Applied Sciences\ Harvard University\ ", ["sigplan/2003/pdfs/topl/778559/p500-kistler.pdf"] = "Main TOC\ Transactions TOC\ Search\ Continuous Program Optimization: A Case Study\ THOMAS KISTLER and MICHAEL FRANZ University of California, Irvine\ Much of the software in everyday operation is not making optimal use of the hardware on which it actually runs. Among the reasons for this discrepancy are hardware/software mismatches, modularization overheads introduced by software engineering considerations, and the inability of systems to adapt to users' behaviors. A solution to these problems is to delay code generation until load time. This is the earliest point at which a piece of software can be fine-tuned to the actual capabilities of the hardware on which it is about to be executed, and also the earliest point at wich modularization overheads can be overcome by global optimization. A still better match between software and hardware can be achieved by replacing the already executing software at regular intervals by new versions constructed on-the-fly using a background code re-optimizer. This not only enables the use of live profiling data to guide optimization decisions, but also facilitates adaptation to changing usage patterns and the late addition of dynamic link libraries. This paper presents a system that provides code generation at load-time and continuous program optimization at run-time. First, the architecture of the system is presented. Then, two optimization techniques are discussed that were developed specifically in the context of continuous optimization. The first of these optimizations continually adjusts the storage layouts of dynamic data structures to maximize data cache locality, while the second performs profiledriven instruction re-scheduling to increase instruction-level parallelism. These two optimizations have very different cost/benefit ratios, presented in a series of benchmarks. The paper concludes with an outlook to future research directions and an enumeration of some remaining research problems. The empirical results presented in this paper make a case in favor of continuous optimization, but indicate that it needs to be applied judiciously. In many situations, the costs of dynamic optimizations outweigh their benefit, so that no break-even point is ever reached. In favorable circumstances, on the other hand, speed-ups of over 120% have been observed. It appears as if the", ["sigplan/2003/pdfs/proceeding/604174/p13-grossman.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Type-Safe Multithreading in Cyclone \ Dan Grossman\ Computer Science Department Cornell University Ithaca, NY 14853\ danieljg@cs.cornell.edu", ["norman-ramsey/system-fig.ps"] = "toolkit\ toolkit toolkit\ checker\ specification\ Ainst Adata\ assemble\ disassemble\ errors\ execute\ ", ["ertl/ertl+pirker97.ps.gz"] = "Paper and BibTeX entry are available at http://www.complang.tuwien.ac.at/papers/. This paper was published in:\ Euroforth '97 Conference Proceedings, pages 107­116\ The Structure of a Forth Native Code Compiler -Lambda\ M. Anton Ertl Christian Pirker\ Institut f¨ur Computersprachen\ Technische Universit¨at Wien\ Argentinierstraße 8, A­1040 Wien\ fanton,pirkyg@mips.complang.tuwien.ac.at\ http://www.complang.tuwien.ac.at/projects/forth.html\ ", ["popl/data/00001718.pdf"] = "CERTIFYING\ INFORMATION FLOW PROPERTIES AN AXIOMATIC APPROACH\ OF PROGRAMS:\ Richard Syracuse Gregory Cornell\ P. Reitman University R. Andrews University", ["norman-ramsey/icfp99.ps"] = "Reprinted from ACM SIGPLAN Notices 3-(3):73{83, March -000.\ The 1999 ICFP Programming Contest\ Norman Ramsey\ Harvard University\ nr@eecs.harvard.edu\ Kevin Scott\ University of Virginia\ jks6b@cs.virginia.edu\ Introduction\ ", ["sigplan/2003/pdfs/proceeding/949305/p282-chen.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Heap Compression for Memory-Constrained Java Environments £", ["norman-ramsey/delenda/eng.ps"] = "Staged Allocation: Engineering the Specification and\ Implementation of Procedure Calling Conventions\ Reuben Olinsky Christian Lindig Norman Ramsey\ Division of Engineering and Applied Sciences\ Harvard University\ {olinsky,lindig,nr}@eecs.harvard.edu", ["popl/data/00001495.pdf"] = "A DYNAMIC\ LOGIC\ OF MULTIPROCESSING\ WITH\ INCOMPLETE\ INFORMATION\ Aiken\ John Computation Cambridge, Gary L.\ H. Reif Lab., Harvard Mass.r Peterson 02138\ University", ["sigplan/2003/pdfs/proceeding/604131/p62-bouajjani.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ A Generic Approach to the Static Analysis of Concurrent Programs with Procedures\ Ahmed Bouajjani Javier Esparza Tayssir Touili", ["christopher-strachey/fundamentals.pdf"] = "Higher-Order and Symbolic Computation, 13, 11­49, 2000 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands.\ Fundamental Concepts in Programming Languages\ CHRISTOPHER STRACHEY Reader in Computation at Oxford University, Programming Research Group, 45 Banbury Road, Oxford, UK", ["popl/data/00001706.pdf"] = "THE FUNCTIONAL\ POWER OF PARAMETER PASSAGE MECHANISMS\ Adrienne Baylor Waco, Texas\ Critcher University\ 76To3\ 1.\ INTRODUCTION The effects procedures ,in [2], [5], shown as ([13]), of are or not which but this conjunction by the or at of parameter have been transmission investigated [81, [IO], to widely re-\ introduced relationship equality and\ by is test\ Constable not is are removed, total.) Snyder call", ["sigplan/2003/pdfs/proceeding/604131/p115-chakaravarthy.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ New Results on the Computability and Complexity of Points ­ to ­ Analysis\ Venkatesan T. Chakaravarthy\ Computer Sciences Department University of Wisconsin­Madison 1210, West Dayton Street, Madison, WI 53706, USA.", ["walter-tichy/p3-adams.pdf"] = "The Cost of Selective Recompilation Environment Processing\ ROLF ADAMS, WALTER TICHY, and ANNETTE WEINERT University of Karlsruhe\ and\ When a single software module in a large system is modified, a potentially large number of other modules may have to be recompiled. By reducing both the number of compilations and the amount of input processed by each compilation run, the turnaround time after changes can be reduced significantly. Potential time savings are measured in a medium-sized, industrial software project over a three-year period. The results indicate that a large number of compilations caused by traditional compilation unit dependencies may be redundant. On the available data, a mechanism that compares compiler output saves about 25 percent, smart recompilation saves 50 percent, and smartest recompilation may save up to 80 percent of compilation work. Furthermore, all compilation methods other than smartest recompilation process large amounts of unused environment data. In the project analyzed, the average environment of a compilation unit is up to 1.9 times the size of that unit, but less than 20 percent of the environment symbols are actually used. Reading only the actually used symbols would reduce total compiler input by about 50 percent. Combining smart recompilation with a reduction in environment processing might double to triple perceived compilation speed and double linker speed, without sacrificing static type safety. Categories and Subject ments; D.2.9 [Software\ D.3.4 [Programming\ Descriptors:\ Engineering]:\ Languages]:\ Engineering]: D.2.6 [Software Managemen,t--software Processors--compders\ Programming", ["sigplan/2003/pdfs/proceeding/781498/p155-deitz.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ The Design and Implementation of a Parallel Array Operator for the Arbitrary Remapping of Data\ Steven J. Deitz\ Bradford L. Chamberlain\ Sung-Eun Choi§\ §\ Lawrence Snyder", ["popl/data/00001624.pdf"] = "Five Paradigm\ Shifts\ in Programming\ Language\ Design\ and their Realization a Dataflow Programming\ in Viron, Environment\ Vaughan Pratt Stanford University", ["emmett-witchel/SIGMetrics96-embra.ps.gz"] = "Page 1-\ back when it is needed. Additionally, dynamic production of these\ code translations are essential to an OS simulation environment\ where new code can be generated by compilers, or read in from disk\ or from the network. Static instrumentation becomes burdensome\ when studying the behavior of large, complex systems. We current­\ ly boot our simulation system from a replica of the distribution disk\ of a system containing many hundreds of megabytes of binaries. Fi­\ nally, static instrumentation schemes have trouble with events that\ ", ["sigplan/2003/copyright.pdf"] = "Main TOC\ Search\ 2004 ACM SIGPLAN CD-ROM", ["john-hughes/lists.pdf"] = "", ["sigplan/2003/pdfs/proceeding/604131/p74-gulwani.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Discovering Affine Equalities Using Random Interpretation\ Sumit Gulwani George C. Necula University of California, Berkeley\ {gulwani,necula}@cs.berkeley.edu", ["sigplan/2003/pdfs/proceeding/949305/frontmatter.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ OOPSLA 2003\ 18th Conference on Object-Oriented Programming, Systems, Languages, and Applications\ CONFERENCE PROCEEDINGS\ October 26-30, 2003\ The Anaheim Convention Center · Anaheim, California, USA\ oopsla.acm.org", ["sigplan/2003/pdfs/proceeding/871895/p27-li.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Tool Support for Refactoring Functional Programs\ Huiqing Li H.Li@kent.ac.uk Claus Reinke C.Reinke@kent.ac.uk Simon Thompson S.J.Thompson@kent.ac.uk\ Computing Laboratory, University of Kent", ["sigplan/2003/pdfs/proceeding/858570/p41-davis.pdf"] = "Main TOC\ Proceedings TOC\ Search\ The Case for Virtual Register Machines\ Brian Davis, Andrew Beatty, Kevin Casey, David Gregg and John Waldron\ Department of Computer Science Trinity College Dublin 2, Ireland\ David.Gregg@cs.tcd.ie", ["gerard-holzmann/using_spin.pdf"] = "Using SPIN\ Gerard J. Holzmann\ gerard@plan9.att.com\ ", ["popl/abstract/00001426.pdf"] = "", ["popl/abstract/00001530.pdf"] = "", ["gerard-holzmann/marktoberdorf.pdf"] = "Software Model Checking\ Gerard J. HOLZMANN\ Bell Laboratories\ Murray Hill, New Jersey 07974\ ", ["chris-van-wyk/p361-van_wyk.pdf"] = "Moderated by Christopher 1. Van Wyk\ literate programming\ PROGRAMMING: AN ASSESSMENT\ explains why the approach was chosen, and sometimes why plausible alternatives were rejected. Such polish makes it pleasant to read a literate program, but it can hardly be considered distinctive of literate programs: authors have polished their programs for careful exposition for years. A less obvious, but ultimately crucial, feature of Knuth's literate programs I would dub their uerisimilitude: the published programs were produced from exactly the same input that was used to prepare the program that the computer executed. Verisimilitude is unique among these three aspects in that it distinguishes a literate program from a program that has merely been highly polished and presented with attention to cosmetic details. Four programs have appeared since July, 1987, when this column was commissioned to explore different approaches to literate programming. All of the programs' authors worked hard to polish their presentations. And all four share with Knuth's literate programs the cosmetic appearance of code interleaved with typeset comments: each achieved this appearance in a different way, but in all cases the production of the version for presentation followed the writing of the working code, and none of the published programs exhibits complete verisimilitude with working code. In June, 1989. Thimbleby served as reviewer, and courteously reminded us of the essential role that verisimilitude plays in a program's being literate. He also went on to suggest that the code and the documentation of a literate program must be produced (not merely presented to the reader) simultaneously, and that a system for literate programming should automatically provide such literary paraphernalia as tables of contents and cross references. Thimbleby's restatement of fundamental marks of literate programs inspires me to resolve that future columns will publish only programs that were produced using a system for literate programming. And that presents a problem. I know of perhaps a half-dozen systems for writing literate programs, each modeled on WEB, perhaps adding or subtracting a few features, or\ (continued on p. 365)\ LITERATE\ When Donald Knuth wrote the nXe program, one of his goals was to publish it as a program \"of which a professor of computer science might be proud, in spite of the fact that it meets real-world constraints and compromises\" [2, p. v]. To this end, he and some of his students wrote systems that were intended to foster documentation as a natural part of programming, and that allowed one to present programs in a fashion tailored for human understanding. WEB [3, 41 was the culmination of these efforts. WEB input can be \"woven\" and printed using TI$C, so that a person can read the program; thus, the WEB user has access to the full power of the TPX typesetting system in composing documentation. WEB input can also be \"tangled\" and compiled by a Pascal compiler, so that a computer can execute the program; thus, the WEB user can declare variables, define parts of procedures, and otherwise present pieces of the program in an order natural for exposition, rather than one dictated by Pascal. After he had used WEB for several years, Knuth realized that it had changed the way he wrote programs, \"that at last I'm able to write programs as they should be written,\" and he dubbed the new style \"literate programming\" [l, p. 971. In the May and June, 1986 issues of Communications of the ACM, the Programming Pearls column presented two literate programs by Knuth. Several common aspects are apparent in the various literate programs Knuth has published. The most obvious is cosmetic; the documentation is typeset like a book, and the code is typeset in a \"reference-Algal\" style. This is the easiest thing to notice, but it is hardly essential to a program's being literate. Harold Thimbleby's CWEB system, for example, typesets code in typewriter font [5], and surely one can write literate documentation without access to a multifont typesetting system. A second aspect of Knuth's literate programs is the polish they exhibit; the code and the documentation were written with meticulous care; indeed, the documentation not only explains what the code does, but it\ @TEX is a trademark 0,990 ACM of the American Mathematical $1.50 Society.\ 0001.0782/90/0300-0361\ March", ["maurice-herlihy/stm.pdf"] = "Software Transactional Memory for Dynamic­Sized Data\ Structures\ Maurice Herlihy\ Computer Science Dept.\ Brown University\ Providence, RI 0-91-, USA\ mph@cs.brown.edu\ Victor Luchangco\ Sun Microsystems Laboratories\ ", ["sigplan/2003/pdfs/proceeding/777388/p3-ager.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Fast Partial Evaluation of Pattern Matching in Strings\ Mads Sig Ager, Olivier Danvy, and Henning Korsholm Rohde BRICS Department of Computer Science University of Aarhus", ["simon-marlow/web-server-jfp.pdf"] = "s a edßÐi÷ bcnÖ Ùn`pÒrgÐd ÓÐi ÒriØÐi Ðd Ï )ÒÖ ed¤ÛÐa c¥©ÙÐiq Ö Ô pÝbaöHiÐcc ½ raqàÑdc eiìc©frÓÝ ÐàÒedÐd bcl`ean`fqÒncrÓÓÖ eÖg ©ßeØÓ lcpdÐc q wg¥pdÔ niiwgÒ ÒwÓÐa q Ò ` 5ÒØrc lan`Ð ÐÒÐ #ÙÓ eÝq g ¥£eacÔ Ï Ð cÐi Crc©Òiga Ò 3ØÒÏ d @ÐÒd Ð bÓ` nÞqpdei²bgÖ £¿ncibß3ÒbqpqbqÐqg nØÐ sÓ 7ÐØÒ pq¶Ó`qgnÖÝÏ ÓÒqÛÕ ¥eØrac ÓÏ ÒÐi ` Ü7 Ðg X qÓ Ö½ q g gniÐdÒfØÖ Ï ieiìciwÓÒe`@Ðg ²Ïs ÐÖ lÒ` ÛeÐ bßlqnq` ÏÓ eØRÐcs Ó pdÕ wglcr`Ò5vn`Ô la ®HdÓÞ wÓlcHÒdq eiÐ b`ìcqÝ ÐÖ eqrgq pܶgbqp`©gÓÐÙÐi #ÙÏg d Ò Æs Ð Ð5©ÒÜ ncfg¶Ò Ö Ði` d 5¥ÓÐiØ nÙ a eaÐc vRrcÒÖÏ eiÒ ìcÐÝ pÜÕ eig Ðc ©õvncÒ ²edÒô eÓfgg Ö Ï Ð Ði s nÙÐ ÓÐi Ó pØqg7ÎÜ ó q ØÐi `Ø q Ü7 Ð× lÒn`· ÐÜ ¼eq Ðg 5XbdnØi Ó s i g Þ `dd Ô ebßd lq@fgceq Xn`Ó ¶Ö yÒÐa bÓbq` pqeÜrcÐg ºeÝÔii eÝc ÆÐc pÜÐiq ½eÔÜg fa g i5i%g©Òg`d3ØÖ bÓ rcR¼ÓÒÒÏ Ði nÙ qÐgÕ Ði ¤bÖÓÐ g3`rÙÐ Ði Ö Ø4ÕÓ ¶Örcn`eiÓ 7rcÜ Ò ¶Ó` Ð Ï pi½ÐÞ bd`s lÝÕ f`3`qÛ©ÙÒrcHdnci CHdlcr`ÐÙÐdÝìiÔ Þ©ÒqÛwgnÓHÒÓ Ð q Ðd Ï ÐaÐ nÒqq ¥laÐÙÐi Ô ` égÐ ÒÏ g¤ Ò g ` sÐ Ö Æ ` g Õ s Æ Ô ) Ò ` Ò Ü qàÓ ÐÓ n`lÒb`lqf`eÖÐ g5ÒÝ ld3`Ü rÙ d Ði Ó ÐÚ )§gë ¶Ön`eÓÜ ÓrlÔÒÏÒÐ r`iÏ rÖlÒÓ ÆÏs lÒƤÕ` ndÒ Ði Ðd ÒÖ HdedcfcbÖbߥedpac )dÐ eiß g ¥Ð Ï Ò4 iÐi s eÔÐÓ pÞg £5`ÔbÓ Ï hbd£ÒØ ¤Û Ði gnÙ Ði g ò ÐÜ s Ó Ï '3ßÐ ñÒ nØÞ i ` Ð ei£pÒg g ÒÏ Öq `g Ôn`lÞHdÓ ¯ÐÕ rcº Ði eÞpdXa Ð lÒsn`` % ÐÜ s Ï £ldÆ©sbcbqpqeÓg Û Ï Ð `Öq yØë ¯ÓHÛÐ Ïߺb`ÒÒ pqeÝHdcg wÓlcÒr`ÒÐd ÒÖ Hdd ìØcÝ Ö Ð ei¥ÒÏcÐ )Ïa eqlÒgƯÐ` @Õs Ó c ©ÒÕ HdÐg ei)½Ðg ÐÓnÔÞc Òi ¯ÐÕ 3`Ði ©ÙrÙnccÓÐi i 5#ßÐ XÒÏg ®ÕaÓ wÓpdÐi g nÙ ÐÛ )Ði q 'ÒÓ ë qÕÐÜ Ð bi%Ø ßqílÒb`pqiÐ Ö Ðg ºÑdÒÏiÐ eÝÖ cfàwÓÐ Ò¶Óà ¯ea` Ðâg d ÒÓÃÝ`ÒÏ`Ð ÐdqÞ bqplde`qgrg3ÖÒbcedq fcÏÖÐ Ò·ÐÓÒ HdØ 7qíc Ð iÆ7ÓëgqÐÓ eiÕ ìc@ÐdÝ wÓÓÒrðÐÓÛ ei@s ÐÒ d Ï Ó Ði ©Ù¼ ` Ði nÙ Ði C ÐÜ s sÐ Ï rÓÒeÖwgHÒHdcÃÒd Ð b`qïqî· Ða yÒ¯yßÓ ë fàØ qíwÓ iÐ Ði nÙÐ bÖÐi 3` ÐirÙÓ ÐÜ ¥¯src×7lÒ q eq¶ÓeÝÐi 7rÙc Ði · ÐÜ ¤ pÝc edÐ bcn`ÒìØ4ÛbÖn`Þ eÓ)Ü 7Î q g Ó Ô¥g c Ö d Ý g Ð Ï gcq¶gpi ÔØ eÔåd Yc ¥yÒHÓ¥a ÒÏ Õ ed3g)bdn`eig Ï Ó ÐÚ ë å g ãC pÚqÕrcÐ pÒ¯ÒrciØ bÜn`ä irÒÐi ¶Ó`ÝyÕÓ pdqÛwgrÓi Ði CrÙÎ Ð lqÐi ` RãÓ ©ÒæÏÆÖä fÛÎ Ó¤ ¯ÐÐs Õ qébØ ÐÒÖ bdÐd` §ÐÓ Ó pêq ¥rçÛÔ pawÓ²nÙâÐig ¯áqàÒÓÐi edÐ rgnÒeaei%ba£4Hqé lß HèqÛÞ bdnÒy`eiHÓÐgc yÔiedÖÓ bdrg5¯bqÞÒri` ldp`¥heag` ffc²ÐÖÚ eáÛÜ ¶çHqÐ picgÖ ` leÛÚ l`bßnq q eØÔÓ pÔ7Ðcg pdÐi wgrÙÒØ5lan`qÕirÓÒ iÐgÕÐÓ¯ Ðd l`ÏfqlÒÖn`pÝlÒqýÓØc ¯aÕ ºged× nlde`gÓ ¥cHØ aHÏ c ºÕÒ eiÃedc bcÓ n`qÕ©ÒqgiÐ bÖb`Õ ØÔdq eÔ5Ï Æld Ò Æ©s` ¤ÒÞwÓ bd` n`ÒqÕeÖÐ wgÆÐid #sÒ)bg d y` Ô 7cpÝÓ eÓgÐ Ïq eÜÐÒg pÔrdqgqÖÐi qÛÒdÓ ed¿bcÑ n`pÒÐ 7fgÏ ÎÖ ÓÐiq gÏ c ' s7 É ÊqÍeÃi©Êf ÉUÇ ÌË È w¤w¥XCwfv¢q¶¥n¯w°r¤r¥ w i5Hq# ½©pH®¤CÆ ¨iH¥ 4¦ ¨p©©q@qb7 q ¢ yewww f ¨ ¢ ¥ ¤feC¢§©wH¤¯Cq¢wifnnC¢Årb%X§H ¤fw3»H pC¤fC¢ r¦rp¿vq3q H¢©¤¤HfpCw ¢)r q¥Ã¨ we¤¤°Ä ¤ÂwqÂHÁq¥q¢f¨¶¥ir ¯w§C ¿q ¤¤ffy©%C w wr¢HHHCp ¢½%§¤fH ¤yf ©wCw¢HC¢¤#f3 ¤¨ ½¢ ©H3 q Àv H¦H¤w#qr¾ Hqv¢CC¨® pwr¸· ¨² ®½¶ R#w ¯µ fq7Cr©¤wrHr ¦¤Cq³ ¢ b¤H¥ wr ²© ¤ © r#H¼»r w§' Hw w £ ¯ eb© r¥qqe i% 4w©¯w rr¥ wHH3nf¯ºq 3ny¹¤ ¤¨H± w w ¤ i ´ 4 § 4 °pfyq¯C¢¢ 4 f¤f§w fy r¤ ®fd5qeHHq¨¦¤e¨ ¤¬©«¡Hª ¤¨%H ¦ v©3¨ wr©qHHw wHwqH¤fw7 pq¨H¦wqrp#q¨¦r q¤§ q¦q¤¦ pfC¦ f rC Cq¢fyf¤¦rHv3 ¤RH3qqvw w¢eq f¥X ¤ff§ rH#£ rq¢pw p©fq} ~ fnmluyx7rk wsjyq| i{h gzfesdwos 4wyrv epwxrxwvy©uyr rt©s rqpo yxbwvt u ©sbcrqpihed¥ba3`Y gf c ¦§XR¥GUT¤R7¤P%¨ I ¦¡WV S ¡11 Q8 HG¤¥7¤FEC¡ A @9¥!75432¤0)'%#\"!©¨§¥¤¢ 1¡ £1¡ D B ¡8 61 ¨ 1¡ (& $ ¦¡ £¡\ ÐÜ s W S P H g Ð i Ï6 q`Y1aVbXVTUT2RQIIF lde`¥a ÒÏ Ð eÖ¶gÒq ÐÔ rcÒ Ð eÔc XÐ à ¤ÕÐ øâ úd fÐÐ Ü Ð bdn`CeÓg úÏ bÖ` Ï ¼edbcn`Ò d ë Ö Ó Ï ss i Û rß©ÚpdwgeiwgÒ¥Ðdc7 Ða Ða ¥Ða ¥labd`` HqÏ lÒcÆnc¯Ö` ¤eÒs ¯ÒncÔ W ðÐÔi ÆÕä ÆSÎ pdÎg P ý ÐÛ H FÐ ban`Ï ¤pÒldÒ ¥Ï %ÝÞ Ò ÜÞØ bdn`Ð edi c ÕØ ¤ÕwÓÒ` gÐiÐ Ï 3Ù1)edfc)0)Ö g4ÆyÒÒØ eØg ÐÓ c pÜ@gÒg ¶Ó` qÕ7ÐÏ ÒÎ Tbqà ÐÖ eqHfcd)eÝÖc 7ðcÛ s fÐÒÐ bdn`q ¥nÔ¤pÒg 3ceiìcìcÝÝ gÔ Ò' ` g Ð ih `lÒ` iÐ Ï ¯s ÐÛ Òn`Ó Ð Vb1a`YXVTUT2RQIIGÏ HiÐ ìcR Ði rÙ ÓÐi Ð ©Òrd Ði Òeq'ed@HÓ¤Ò` qÕÐ Ò ÒÐÓ Ð ²Ú Ð pܶgl` iÐq qàycÏ nÒ¶ÓbÖeipq` £bÓÔgc Ï ÃrÓÔs £nØnÒ½piÓ ÑÒ ¯à)E¯Òr`DgHdlcÔ edÐ Ï bcÐÔ n`CÒÒ ¯Öedâ ÐÖ §ñldÕYc v edbdn`` 4fßÓgrÓ ©sØcÖ ¯ÖÏìcÐd ¤ÝiniÓ bÛ qpqi edØg bcnÖ ` pÒHdÓÏ rgcÒÐÖ ¤Ðd sÏ HÓºÐÒa g piqÛ ¶glq¥ÐqÔØba¶Ö§nÒs` n` XngpiÓ Ði Ù na5Ði ÔHiìc5q`Ó ldyÝ ÛÐi bqÐÜ hÃyðÐqÔ s HdHÓi lcHØr`§£HÒýcg ©Òwg ÐÓ ncºbÒ Ü Ðd n`fiÓ ednÖÐa Óbcyq` ¯)¥laÐdÔÐ Ó Õ ¤3Ò` Ði âpÔ¿rÙÐÐi ÃqÕÔ ÐbÓ`liÓÐi 7ØÏ` ÎÐ ¤í7ÎiÐÏ q Þ g Ô Ó g Ð qàÒ9 i Ð bqc` ¥eag fcÖ ÐÕ g g Ø Ü ß eÓg ý qÕÐ\"lëC ` ÐÖÐ ÒÏ nÔÓ Ï lÒÐ Æpi` s@ ¤ÕÐ ¯ÒiØ lÜr`niyÒbÓ` ·Ð ÒpiÆbqpq¯Òc qÛ ÐÒ i%eÓg Õ eig Õ pdwgÒÆbq Ðq Ó yðHÓ§ý Ï §pÝ¥yÒeiÔ g ÞÐÓ n`eiÓ rglÜb`q ÓÐ Ï pÝc Ð ed§éHàÖ nßeig rglÜb`q Ð eÖgnÝ Ði Ògbd` Ða yÒ¯yßÓ BA YÑ @ä g Õ edg6d pigrß wÞg bid ` lÜb`Õ vbØq qHdlÖ c r`bdH`©Ò¤Ûwg Ði Ði nÙÐd Ði ·\"ÐÜ8 f s Î %ÏýÐ 5#gpdÒ eÛÞ ldrßr`piÒwgrØiÖ bÜnil`yÒÃeiÓq edncfcpÒ·bdbd@½ÐÓÜ`` Han`cei4lÜÞiÖ rg ldb`n`ÃrÓq eÝeic 4¤gÞÐÔ pdHÛwgnßieirg¯ÕiÐ bÜÆb` ` §5gÞsq bd3`qÕnðÐ HiØcÓ sÐ ÐÒ 7ó ncncR Õ ÐÓ edpdcÞ yÔg ÐÓ ÖÏ %Ð ncpð²XÐigÒ %rÙa ncRÓÐi Ò Ó ÏÐÐ Ï CÆRbdsÞ`Ò¶Ó Ærcei` ©s©Òbclqwgeqni@bÓgyÒ Hiìc` ldà)çÝ¥5edÐÝ gÕaq bcn`Ó ØÐ ÒÏ XYÐÖ Ò d fÐÐ Ï RgsåÓÐ HÓÓedg bcn`Ï ©ÒwgÖ Ò nØ3Ói HØqÛÖ¯bëÓÞ Ø eqd fcÓ½7baÖØ nc`Ó ¤ôyÒÐiÓ pqnÙÖg rdÓÐi Ði ÒÓÐ Ðâ ÒÏ ÒÒ i ` ÒìØ &½ncbÓeqg Ð pi@edbcn`¯ ÐÔ Ðâ eØÔ edrci Ï 3dyß4î ©Úà4edÐdÒ3wg bcn`Ò Ða ¥labd` ` Ð qжÓ`Ð ÆHdbqpqcgÖ ÓÏ ©sbcÐ bqpq%HÓ¤ç®2fÛg 1)wÓ0)¯ÒÆeØø bÛÐ Ðc (ba¨ n`'¦5HÓg ©slcrqÏ piò¥åfÓnØgÖ s ÐÓ HdiÓ nØpÒlcr`¯Ðg Ò %ÐÔÝ Ò¯pdÖ ®rgâ XeinÒá eØcÓ ¥edla£irc` pÝÏ¥3dÓÖc Hdyß4r`Ó lcÓ îØÒ ó q ÔYÐÖ Ó s 5 Ö g ¤ c ¯ÐÕ 3`Ðà ©ÙrcÖ edXnaçHiìcyÝÐi %@Ô bÛ $nÙ¨Ði §¦#ÓÐi ¤ ÐÓ Õ edcHcHc\"edeifàncìcÒÝ wÓeiß rcriÐ äi å ¿)ÐÓ edlabcr`n`Ò¯Ò¯Ú` ÐÔ d nØiÖ Ðâ Ò Ï lÒnÒÆei` bdÔÞÔ Æ'fceÔÓÖnØÓ rc¤eiìcÓ Hd7lcÝ n`q ÐÓ Ó Ør`ÒÐd b`lq3Òf`eÖÐâ g¼HÒÝ ìØq ÐÝ ØÐÖÐdq !ó i g7 Ô ¢ c¥ ` Ö Æ Ò Þ Æ ÒÏÐdHÒr`bgeq rÓ ÐÓ bÓÆ©Òg Ï 7wÓHÒ Ðd b`qÐ )eØ Ðc pdrglÒg¯5lan`Ó Ð ÖqlÔi r`Ò5 Öa ÐÐ ¯ÚeiHdìcÝ c5gÕÖ ÏÒ Ð bÞ Ð` ÐiÏ ©ÙsUbÞÏÒc ©sl`ò½Õg Óed¯ÐñÕg 3`ß©Ù)rcÖ Ðd i ¿bgpÒÔ çUq ©slcqbÛÐ ©§¦¯Ð¥`¤ Õ ©ÙÐÓ rcedi £¿ncHdÒrc¢ÔHc ÒÓ bÔqß Ï äå pÒbqg ÏÐq ®yðÒ HÓq §Õ 5¥Òcý hÐda ßri)ØniÖÐd Hdci fØ¡ó qlcq ¨ ×g bdp`XHac Õ q i Ô Ò YÐa HÜnc¤bÓ` g Ï 7eiìcÝ eÓìØÞq g bd` ÐÝ Ï )ÒÏÓ Ö ·ÆbßÓnØØ Õ )rgq piÓ %¶bÜ d g p`XƶÖØcq g d ean`Ó ¤ônÒpiÕc ÑÒ Ô-g edbcpdn`Ð qgpÒpiÖ fg¶Ög Ð l`lqsq Ðq nðÔ ÐpÔeÓ§§ÒgÓ g pØqgwgpdý ÐÖ rcyÒ§HiÒ ¯ÜeÛ))bßÓc ed¥bcÔ nqyÒy`barÓ'``bÓ i bdÐd ã¶þ3Ò` bßbqÐâ Ðq Ðq ÒbÙyðn`HÓÒ§ÐÖg õýÐÖÐd ºC@wgpqÐi bd` Ði ÐÒÐ rÙ%ÐÙÐi Ô Ði HaÓ ·ÐÜÖcÓ eÛbßq pdÕ %ÖsqgHdcg Ð ÐÖ Ð r`slÒÝ)Ƽlds`ài Þ bq 3`Ðq rÙyðÏß HÓÐi %ñ¯ÆYýcÓs § eiÐÜ ìcsÝ Ò qÛÕ ÒHØÐdq c ÒÏ ed¥ÖfcÓ ÑÒ Ð à©Ù¥Ðç c ¶Ö`Ða rÙ@eiÐii PbÕd ï5lcHdgÕ` rcr`®¯ÒÒ )pÔÔÓ rØnig Ði ÒÐiÏ ldeÔ7¤Û` eq¥nÙÐig babdÓÐi` ¥hÒÏaÐ ¥Ð bÓ`i HØiÐ Þ ¯HdÐë Ïcà %Æ©ÒÖÒ d ©sÐÚ g c 5Ïi Õ hlÒÒ rcÒ ¥Ð` nc£lÝqÓ Þ lÜldn`3`rÓÐq eðHÓrÓrglÒvÔ`c ƯwÒÓ ÐyÒHØei½rgÜc Ï yÒnclÒbÓÆeq` giÐÓ s Óc `g nlÒc 4Ò` ©ÒÐ geÜÒÏq g Ð Ð ÜÞ edrgÕ rqi piHØcg fÛÏ § Ði ÕcÐÓÓ nÙ lÒ®ÓÐi ` ݧeiÐ` Ï qàcïdÒÒ å Ð× ÏÐ bÖ `eÓqedwg¤X4naÖgÖ iÒ HiÐd ìceqyÝHcÐÙÐi Ði dÐÙ ÆXedHÓgÔpqÕ 4Ògg %üwgpdgfÛwÓeieayÒrcHircriìi)@Ðic Ý ¥rÓÔ yÒba¤rc`eaÐÓ eÓìiØ ¤íÝ4bÓbß`lqiÐ Ðq ìØÏ lÖ Ò ÐÝ ÆHÖ`pdwgs rgHiÐi qÕeqƯrcÞ Ð Õ§ÐiÒ 3clÒ©Ùfcqc pØ7gû ¶Óã`iÐÖ ó g a lÚÚly`pqÐi rÓ¶gnÙHÓdc` ¯Ð®ÕÔÓÐi HÓ%ÒgÐ Ï ¥3qÒ bß d wðbÐ Ö Ï` ²íØ s nÓeÓ®qÐÓ g wÓÒ¤Õc Ð ÐÓ ÒeÖØ ¶Óqgí ` Ð¥®baiÔ `Ó HØÐ eÞbqcÜ ÐƯÒ`Ü lq Ò s HØP)©sÖcÐ pdrcXig naÏ HiìcÒ yÝpdfgÐi 7²ÒÔÖ Ði` ÑÝ rÙfà¯Ði Ó wðÓ eÖlqeqwgrgyÒpÒÐi g ©ÙÐc ÔßÐ Ï Ò XÐÒ g dbÖ3`ÐÐ rÙÏ eÒÐi c ÓÐÛ dÚd eÝq cÜ ØncºHÒedrgyÒbÓn`Ü iÐÓÐ Ð ei¥iÔa 9º Ði nÙ ÓÐi Ï ÃpÒg Ï Ã`Ò 5£fß Ðd ©Òg ¶gT©slc)pÝg %Ð pÞrgÒed#gÙ Õ ²i Ï pÒ§î c ¶Ó` Ö q q Ôc ÐÓ eÓ ÓÐg figÖà Ô ld`ÆÓ Ð ©ÒÕ bqwgi` i ÞØ @ÏnÓ%ÐÓÒ HÓHiærceÞg põi ·ldeÔ7rc` HdÕiÓ lcr`ncÒ¥ÐÖÒ nÒwgdpiedÒfc§bqÖÓ eÝbqÆs HÞlcÐ3qgÖ wðHÖpdXÓg%eiraÜ g ìcnÝÕ i edÐi ë 'fßÓ ¤ô ÐiÖ Ðd nÙ©Òi ¶gq ÓÐi ÒÏÐÐ Ï ²ÕÒ qÛedÒHcbde`ÔÜ c cÐß ÐÐ eaÖ ncg §©Ò Ð÷ ©ÒwgÔ ¥bdy`HÓ Ð Ðg Ó igÖ bdpd§©Ò£gÒ¤pÒÆrÓyÒ ÐÓ q Ø qíÐ ci bqÔpqXg naqÞ i ldr`ßÜ qÕÐ nØeÓÓ Ðg a Ð pdqgÖ c` g g ` g dÜ dedbÖ¥raeiìcnÝ Ði Ó qô Ði rÙ Ði Ò £¼pÝ®Ò Ô ÐÖ yÔHÓ®¶Ó` 7àÏ g ÐàÎ bÜy`rÓHÓ²HÓP©sbc²eÓg Ð Ü ÕÔ Øq ÐÓ HØc Ï ¥Hdlcr`Ò ÐÖ edfcÖ bß3qÐs wð½íØg HiìcÒhÐÓÝ fßØ qíÖ Ðd iÐ ©Ò¶gqÐ Ï 5Ï rÓCÐÓÒ ¯ÖÓ pdrcÐg i ùvnca ÒbÓ` 7ÎqÏÐ pÜÐÞ Hd¥yÒqÜ lc 3cÓ 5v5eiaÒØnc ìc£rÙÝÐi ÐÓ rÖÓÐi eØncÐ Ï iÐÓ Ò fÛúÒwÓi Ø qíÞ àldÐ 3`øÆßi Ò lqeqXH`gÕ yaecXòceig#ÙÓ Y rcãÒ ó ` a£ Ö Ò%a s ¯hedbcn`Ò ÐÖ hbd` Ó¶Ó¤ôq ¯ÐÐi Õ nÙ¥Ðic ߥ)edÖg ®nicÐd ÒHÖi fØ¥fcedÔÖg laipqÒ wgÐÓ rÞpi¶gÐÙÐi q ²pÝÐ ¤ÒÏc rÓÐlÒn`#Ùg Ði Ï a rclÙÐÒ Ó r`Õ©Ò¶g Ðd 3ÒiÐq q ¯ÐÕÐ Ï 7rÓCfØfßnÖ¶ÓÖ ` Ðd CÐiriÕ ØXHdnccpÝÐÛÖÓ cpdÐ Xe`g¶Ö craeiìcÖÏ nÝÐiÐ ÔÒÏ Ó `¼ Ó cÓ Ö Ö\ ÛÞ Ý ÖÐÓ r iÐgÕ Ó pÚrcbdp`gi ïedfîgqàÏ ÐÓ ½nÓÒ ÐÓ Ði nÒ¯ÖrcÐÒ Üi eÔbqÐhncpdÒ g qÕÒÏ Ð Ò gÕ ÐÖ ¯ÔÐ Ðâ ÐiÏ ©Ù¶ÓrÓÐ qÐÓ Ö edX#ÙÐg nag HiÏ ìcyÝlßi bqwgÐpq ä àÐi iÐd ÉÞ Ó h~Ë ÒÏ É Ð pØiqgÍÐÖ rÜÍ fÛ¯2ÐÓ~ r rÓe ¡ó Ô¤ Üq ìØ¿ `c Ö iÔ gÔ Ò ÐiÐd õ` Õ bßnq ÏÒ bÞl`nqvHÓg Ï edbcn`pÒrgÒ Ðd Ða ¥ C q×Ò ÐÓ nÓ ÐÓ ¯ncð XncÒ ¤ÕÐ ei¥eafcîÖ qÓbÖr`Ò¶Ón` Ði ÒeÖÜ RpiÜwg g ` ÖÏ Ó qÔ ` ÒbaÓ iÐgÕ ð ÐÒ Ï ² Ðq nd Ði v ÏÒ bÞ Ð` syÚ ÏÒ bÞl`q ` qàÓ Ðiq ©sbcÓq ÐÓ ïbqlqÆs ß gÕ Ð ÏÐ eiÐiÏÒ 3c©ÙÛc Ðç eÓÐ fgÒÏ Ð 3ßeÓedfg'bdR¶Ö`Ï ` iÐÓ Ï rÓs ÐÓ 3Öld²qÛi`rc gÔ Ó ¤ÕÐÓ rðiÐgÕ eiÏ ìcÝ7 d gÐq fÐndÐ sÐi ` ¥7ÏÒÜ bÞÐÓ Ð` q ÜeÜsrgnÚÒ ` ÐÏÒ pÞlÞb`¥Ôqg eÓÐ Ð g eig ¤ÕÏ Ð ÒÓ lqbqÐd Æ@Ðas ¥¥ÐaÔ bayÒ` ¯yßÐ %#ßÞ ldr`X©Òg ga Ö gÖ Ý ÐÓ c c fÛnÚ ÐÓ Ði rÓeÔndi ¯ÐÕ ¥ åa ÐÓ nÓ ÐÓ ¯ÖrcÔ Ð ©Òwgpi) ÐÔ §eiìc@HÓ¤pi¶glq¥bay`Ó Ð bqlqÆs gÕ ÐiÏ ©Ùc ÏÐÐ CedÐ HÓ£fgc ÖÞ bd` Ï Õ¶Ö` Ï Ðd ÐÔs ldè` ÒÒÏ ¯ÖcnÔ4ncÒedc½pÔgXa¿#ßg¥ºÓ iÐgÕ Ï ¿Y 9 Ða Ò¯Ónߧbdn`©Òwg Ði eÔÃpi¶gضÖn`nÒpi)Ô i a Ò Û ÓÞ c q g } { y x w xv t p t |R|@z10IdIuBswrR1uqoses à Ð )5HÞlcq Ï %nc@rÓ ÐÓ fÖeÖ¤HiìcÝ Ð ©Òwg Ði eÔ3cc§yÒ57Ó që Ð Ò Ò g Ö ÓØ a q Ó ½g a Ø q ë ÐÖ iÐgÕ ÒÏ ÐÐ HqlÞq Ô r`bdÒy`hbßÐ lqeq¥raÐdgÖ ÕceiÏ ¿edd bÓ`g Ûeç` iÐ nHdÐm Ï lÒc r`ÒÐ× ¥dÔ YÐÖ q paqÐ åÓÐg Ðâ wÓeiHÒc ã ÐÙÐd à edbcn`edpÒbcrgn`ÒHÖÐi ngHÔ)§pdcÓ Ó wgqôniÆÐi Ò rÙÓ Õ Ði Hiú ÐÜ iÐÖcÓ ·Ïs ¶Ö7`g pÝÏ ¿sc rÓÐ ÒyÔceÞHÓbcgq 3ßlde`Ü rgnÒqÕ¯ÐÐi Õ 5©Ù3`Ö eincìcÝi qÕÔ Ó Ð licÕ ` Ø ¤íÐÐÒÏ C%¶Óai ùedbcn`pÒfg¶Öd Ø` ½¥HaÖ cCrÓ ÐÓ ¯Öi rcrÔ Ði Ò Ð Ñd qàX Ða yÒ¯yßhdldr`©ÒwgÔ Ðiq eÔÐ vÐc yÒHÓÒ ¥a aØ a Ö i Ó Ó Ó Þ Üedbcn`` pÒfg¶Öc` Õ ½¥HacnÓ ÐÓ ¯ÖrcnÔ Ði Òbd` Ï ½Ï pÝc Ð nØ`iÊ d pÒk 5agØ ²Òf`bÖb`Ö!¯â ÆÏ )eÝhac Ü Ò k Ú Ð Ð)pØqÓ ¥ba¿inÜ c Ò ÒÐ Ðd q ¥ÐdÔ` lan`Ù5HdÓ bßcnqbÖ i p`bd` giÐÝ ¶Ó£q nc¯ÐÃÕÒ Ó %Ðd a rÓº ÐÓÒ ÐÓ ¯ÖrÓncÐÓ i Ô¯ÖrcÐ pÒi ½eiÔrg d fÐg Ð ÓÐÔ s ÐÒ Ð 7 HdàÎ lcVrr`dfgh©Ò ¶ÖË ïli ¥É eacÍ i Ô²¯2ÐÒ k ©Ø ©Ü¤Û cjÒi ©ÊÐd !ó Ô fg `ÐÖ Þ Óg Ò Ö q qàrÓÝ ÐÓ ¯cÖ rcÆi Ï pÒg ßedgÒ rf nÚÒ Ði ÐÖ 5¿ÓÒ ¯Ðô edÕ 3`fg§rcÖ©Ù rÓ¯ÖÐÓi Ô Hdnclcri ` Ò'ÐÖÔ pÒÞ bd`rcÏi HÓ%rgÔ nßfiHiÖ %Ðc eqldn`a ô v©Òg Ï hÓ bdÞ` ÐÛ )pdwg Ði eqncУÏÒ lÒpØg®eÝ£Òrd HØ¥c pañÌbdp`wg!ó Ö põgR g gÐa RÓ Ða yÒ¯Óyß%bdn`©Òwg Ði eÔÖ ¼ci 7Î à ð h É ©Hgh¤Ê½q nÓÐqàrÓbðÐÓ l`yÒi¯Öq HÓÛrcfcq ·ÔÖi ¯ÐÕÐÔ ¥yÒcrØeqaÞ eibdrgn`yÒg Ï lÞÐ ` ÓÓ CÕÐ edÒÏ §Ðg pÒs ÐÓ bg3`rÓÓ ÐÓ ÐÙ bq¯ÖpqrcÔrcÐÒ iq ¯ÐpÜÕ¶glqeie`#Ù©gc ldRqÛ3`g pÝrÓc yÒ ÐÓ Ð Ï Ø HÖ¤ífgÐhbgeqg r`Ô fÐÐ ÓÐi Ð nqc Ò lÔr`ÒÕ 5Ðdq Ø aÒ Û Ð nÙÐ Ï eÖÐi §rcÔÓg îÒ ÓÓ ÏØ i Ð%bÓ` ÒÏ cÐ Ø c Ï ¶Ö` Ï ½X Ða yÒ3Ó¯ßà Ï lÞ` Ð òncñbß Ðq bðb`½¶Óùß Ö Ðd ©Òd ¶ghncÃÒÓ qÛnÓ ÐÓ ¯rcÔ ÐY Ï Ü ` Ò q ` Ö q Ö i ÔÏ eÖ Ðg eiìcÝ gÕ ÐiÏ ©Ùrßei¥ Ða a Õ pd¯gÛ gÕ ÐiÏ ©Ùc Ï Ð wÖÒÆnsÓnÚ3Ò Ðâ ÒHdcg)ØÖ ¤ÛÒÓcÖ Æi ©sÔ Õc ¯ ÓÏØ Õ c edg à ÒÔ c Ó Ò ` Þ Ü nØa nÒpiÐ Ï wgRÒÒ Ó cÐ Ï CÔ eÝXra Ði FÓ ldrÓyÒeÓ Ðg ÐÏÒ bÞ Ò Ð` ` 3sß#Ùg Ï i iÐ Ï pÒrgqi Ð eiq a ÐÓ nÓ ÐÓ ¯rc®¤Û ÐÙÐi ©s§ý grÓnÒeinØÓ Ða yÒ¯Óyß5ldr`©Òwg Ði eÔc Ï ºÝ²wÓeincrÓ Ð ÐÓ ¯ÖrcÔ Ð bÔn`lÒ5ºpÝc Ð pÞÒ wgHÒed©gÙ gÕ Ð pðwg`Ò ÐabßlqeqfgyÒ¶Ö3Ón`nß©Ò'HaÞ ldncr`¯Ò©ÒeØwg7Ðig bqbqeÔÆc` @qÐs Ï ¯Ð£ÕÒ ©Ò¥gc ½4rÓÒaÏ ÒeÖÐÓ 3ÖgÝ rcÔÐi Ï RÐÒ ©ÒpÝwgc piÐnØg nÒliÓÐÔ 3`Ï @ºeHÛdÒß àß0iÖ Ðd É riih ¯Ø )edÖ Öc Ë ÉÐ ÏÅiÞ Íbdrl`qÕÍ ¯pd~ 2gr eÏ ¶Ó¡ó h ÓX Ù q× ÏØ ·7 ÐÓ pÔg Ï ºq ¯ÐÕ ¥rÓ ÐÓ ¯ÖncÔ Ð pÒrgei ÓÐÔ Ï 3ÒfÛwÓHÒ Ðd Ða liØ ¤íÐ ÆHØÃeÝÆX Ò Ó Ò ÔØ Ó c a i g Ð ` ii c cÓ Þna Ði ' Ñd wÓnceig 3ßlÒÜ` qàHdÒqÕ%Ðdc qÐ 7qab` Õ rÓÖ pdgÐÓ Ï ¯ÖeÖÏ ncbÓÐg i 9rc¼ edXbcÒ n`lðÒeqÐÙÐq qrg¯ÚÐÖ ¥eÔÒ rcd rcHd²cÒÒ rÓÖÐ HqÐÓ ¯ÖÞ bdÐs y`rcÓdi ÔyÚ)Ïî eÖÐi g Ðà rð'`Ð eibd @Ïc iÐ ÅXÏgeÖs aÐs ²5ÏÛds Æ·)eÖÏgÐ Ò Ó edÆ7¤rÓÔcd )#sÐÓg î yÔÓ 3ß3ÖÜrcÕ edi ÔqÕÆÐg ÆÐaÓÓ ØedbcÒq n`¯ÐÓ Ò nßÕ ¥¥adcÓ ÐÖ Þ Hdldr`c©ÒXÏÖÐ wg%ÐiÒbdbÓ¥ceÔ` ¥ea¶Ó`c)7ldÏÖ Ðs Îd` ÐÐg `Ô `\ x t 1RVRuywvus \ à Ï eÖgncpÔ7Ó ôbq Ðq yðHÓ§¤Óý Ò Ðd nifØedc Ï Òc Æs a ÒÏ Ð pi¥HacÖ Õ pd3gqÛ ÐÓ eÞrgÒpd©gÙ Õ ng¶Ó` Õ iÔ g g i Ö ` Ð gÔ Ð` Ó¶Õ ` pdÏ ® ÐÓ Ñd eÞ¤àrgÒÐi pdnÙ©g Ði TbiÐÜgÓÕÙ ` ÏsÐ ®ÒpݶÓùedÕ bÞpdy`Óg ¯ÐÐ Ï bdù¶Óldq ²eqÐ` Õ bg¥XirØaÖf`c Hd½¶Ó¥q Ha¯cÐ ÕÖ %òÒÏa ßÐ bdÖ ¥Ðd` ripaØgi )Ðâ Ö edcß ÆÐûÖ r`pÝci Ü Ð Ð bÖH`%HdÖÏ lcr`7ÎÓÐÖÐÒ Ï Òg ú gÒ Æ cb`q Õ Ø Ò® Ö %a® c `Ð cs rh Ë p i h Ì f VqºÊ 4 É #ºH É Ê ge ÐÒ` c Ó g Ï Tld%ÒldH`)Ô Ð Hayc%©ÒHdlcr`©ÒrgÒ Ðd a Ð %baRbq Ðq yðHÓ§ý ÒÏ Ï lÒÆCç Ï eÖ§úbßnqÒ Ðd riØ åÖ Ðà Ði i nÙnدìØÓÐiÒ Ý qÔ ` g Ð `s Ð gÔ î i\ Ð Ó s Óà d ÏÝ Ð bßnqÒ Ðd riØÖ Ð eiß ÒÏ Õ edfÛÓ cÕ ÐÒÏ a ÓÐ ÒÏ Ð Ø Ï bÖ` Ï wÓ Ði rÙ Ði 'Õ ÐÜ HØncs pqeiwg@wÓ ÐÙÐig Ði 7yÒÐiÓ nÙ ¶Ó¤â3`Ó yÒ4ÐÓÐ ÒiÐ HÓgÐ 7Î ÒÏ i gÐ g qÝ g ` s h ` Ë a ï Í Ô ! àìØlde`hÖÔ Ðd c Ü iÐgÕ lÚÐ l`úrcÔÜq pÔÒ g ÕqÕeØ%ÏbÓPn`lÚ`Ò edlÒbq c n`½ÒØ HÖ'rga rilßrqÒÒ)pÜTßÐiÐdÓ g Ï bdÖ riÐd` pd4fØgi bÓÆed`Ö fcÐi úrÙÖ Ði g HدÒÓ c ÐÜ Ï slÒÆhà VrÞ bdq¥º¥paEeiwgk i eÞÉrcùnc2©Ók ºedÛ jbi c n`©Ê©Ò qg!ó î Ê ik r Ì c fa ¶Ó` Ï æbd` Ð )pdwg Ði eqnclÒpØg·Hiìc'nÒeinØhÒf`bÖb`¯Ô Ðâ ·bÓ` iÐ 7Î à h É ©hjqÊ àq ¯qÕrÐ ¥!ó Ò Ö Ò q Ý Ý cÔÔ Ó q cd ÐÏ Ð lq ` c r Þ Òc bd iÐgÕ` Ï ¼pÝ¥wðeÖà ¶gq qÕÐ ÏÓÐ 7¼¶ÓÒØ eÝ` c Ð pØqgÐÒÏ ÐÖ a HÜHÛIß SÖ VTÐd S©Ò(qP ¶g Ï ©sÃbÒ c %Ærß`q lÝ Ði Ði ¯õVnØà ·iÓ ed fgÉ hÖ ß lÒb`4eÜË bgÉ eqï¯iÖ fg Y àÍrgÕ Í ¯Ð~ 2eÐiÏ r ©Ù¡ó ÓcÕ Ð× pi§Ó cÕ ÐÒÏ a ÓÐ Ï ºeÝ@fÓ¶Ön`yÒbÓr` Ði ÒeÖwgpig ÖÏ 7Î ÐÒc ÐÏ g Ð ÐÒ `s ÓØ pdfgÖ ¤ày Ò HiIõc CÐ rqyÒlÒl`XÓq bß Ðq lÙr`©Ò¶g s iÐq Ï ÒÆ@ ÐÓ bÙn`©Òq )Ôg nd ` Ði lÒpqg ÓÐ Ï ÃeÝc c Ð edc Ó Ð )XncÒ Ó ¤ÕÞ Ð nÒ Ði ÙHdcÖ Ð Ü ÔSUT0SP ÐÓ Ø Ï bÖ` Ï ½edbcn`pÒrgÒ Ðd a Ð ¥ba¿ßedqg¤Û ÐÙÐi ©s¤©ýfàd X Ða yÒ3Ónß4ldr`©Òwg Ði eÔ3clqÏ eqg à 3ßÓÐ Ü X72ÐqÕÏ Î yÒSqàHiUT)Sc ÐÓ ÐØÔ P yØÏ víØ ÓlÒÆpÒ` HÒCXÐ ÐÙÐds c Ód piÐa gq eÜÐq rcrdÏ ¶i Ö ` Ô ÏðÐi qÕ¿Õs Ð HdedÐÓ ¯glcr`fÛi ÒrضÓpq©ÒÐd HdÝÐgg lÞÐa n`eiÕÓ ìceipÝÐg g Õ lar`edÒÐ rgÏlÚyÒpq¯ÚÓÒ HdÞ iÐg ldrc` ©Ò¼Bd A ¶gCYÑ Û`Ù Ð pq9Ðs bq hÛÆlßpÝ9½c Ðq bÙÓÑn`pÒÕ bÓ gc eØiÐq c edÐÒÏ rcÐ i®ñeqgaeiÏ lqgÖ ß3dyÐ ß Ð 4eiÓ7îgÎ ó Ð äg Ð à yð¶Ó` Õ Hancìi5bd` iÐgÕ Ð bq` Ï s ¤Õ¯ Ði iÐgÕ Ï ÒÚ Ð Hqbdy`·lß Ðq bÙn`Ò ÐÖ Ðõ ÝÞ ÞÓ nÐc eaÒ lßcÐÖq Ô pÔÜ Õg bq ß lqeØeqfcXÖg naHiXc ¤IÒd 1SºUTô ydS¥cÐÓ P Õ Õ pdÒg ¤pÒ9g ÏÑ 7¶ÓÞÒ ld` 3`wð19¯ÖbcÑq ÜldÚÞ ed3`wðc CrÓdqà¯ÖlclÞ Òbqq d Ün`yدHdÓÚ ÃiÐÓ Ø c d Ði rÙÐ ÏÏ 'XsÓÆØ ÐÜ a Õ bqÐ4Cncgqs ¥©ÓncÜ i rc¤ÆiÒÔ × 9Ò¶Ð Ó l`Ï Ñ¤ncpÒq ðbÓ` ¶Ó§îÕÒÏd ` ` ÒlÒ` Ô ` ØHÜ Ò `#ÙÐiwÓÐwgni£yÒÓÓ Ð ½hY ÒÏ Õ ededbcn`ÒìØÝ RISUTS¥Ï rc4nÓHÓrcÒ Õ Ï pÒ Ðd ReÝ£yÒ¶Ól`'g ØØ Ï a 9 Ð g Û Ö d P Ð Ò ÒÜ g Ô Þ q c q ÏÔÐ Ø iÕÒ bÓbq` @®yÒiÐÜØ 5%Ûa©s Hdç lcr`%qg©Òå 9 bÖb`¶Ó`q §Ô eÔXg ISÒÏÐ VTÐSPÓ pØ©Òqgg ÐÖ ÒÏ eÜÛ a ¤ÕÐ ÐyÒq HÜncÐÓ ¿ÔÒi lÐÞ d Ð` ÒÏ iHawÓeincìinciwÓÒÝ lÔr`iÐi rÖ¯Óõ nدÓÐ ¤Ï Ð eÖgq ncë pÝ®pÔÐiÔci à ²5¶ÓÜg ` 73ØÏa Îd ÓrHinc¯ÒbÔr`irÖÓ ¯ÐÕ q ë c c Ð Ò Ö Ò Ó i Ð Ð g bdp`HgeÞg cÐ ú Ðd eÔ7pÝ5Ò¶Ól`q Ï úedc X2SUTSP bqpqfghrc¿rdnØg Ðii ÐÒ TdÒ ÒÏ Õ edºÛçqÏ Ò 19Ô Ñ ÏÞÐ ld3`vwðÒ ©Ò¯Ög bcÏq ÜC¶ÓÚÒ ed%`ÕÞÐdg bdy`7åØÐÓ Ï Î ÐÓ à lÒnÞ ` Ær`ild Òs r`ÆÕi veigpds Óld iÐgÕc Þ Ð ÐgÕ` q eܽbgi bqHip`ìc©gÝ #Ù¥3ßqg Ð eÜpdbgbq@p`g ©g¥#ÙÓ rag eiìcÐ nÝpiCwÓeiÔ drc¯lÔÏ r`rÖiÒ edÓ bcnÐ` ©Ò'qgÕ bÖb`Ð @eÔeÝgc ` ÓÏ HdbÖ` lcr`Ï Ò'edd ìØHdÓÐ lcr`©ÒÐ 7XÎgÏ rafàeiìÓ c ¯ÝHdbdlc5Ò`r` ldÖÞ ìØ`d rd@çiÝ rاdHiÐÒ VTHÛUTlßYnq5eØÓ lßrqÐc ÒpdwgÐd pqÒ©gq ½ba`Ø lÙ Ø y`ÐÓ¤í rÓHieincc ¯bÔåÒ n`fiXnÖ ÓR¯I¿UÐTSÕÐ Sq ëP ÐÓ ôq bÔBAn`ÑlÒYq ½@@XrÓäa9Ø yÒÐ 4êÒÐÓÓ ó Ös cÝ qØ a Ý a Þ ` ÐÏ qà¯Ð×Õ ¶ÓbØqÐq bddÖ ed@g` nÓ ÖÏ ÐÓ ¯Ö19nci Ñ Ô eqÐ rgeqldn`ÐÙÐi Þ ¥ÐâgÓÓ bd`q lÔr`19Òq ѽXbdaÞ 3`ncÒ Ðâ qq lÔr`Ò5Ü ÆeiÒ ìc7Ó cÕ iÐÒÏ Ô ¥bdn`yÒbÓү⠣ÝÐ 7Î Ø Ò Ð pÜg Ð ¥nc7¶Ói` Ï HÖHgrceÔÆig bÓ` Ï Æeiìc7Ò Ðd a Õc Ò ` Ý c 3ßÐÚ pdliXØg` ¤íÞ bde`iÐ HcÐ HqÐÞ eiÞ bdìcy`)ÓÝ eÛbßnqÐ 7Î ÐÖÏÒ àliÝ Õ` Ðq wÓßÒ` Ðd riÐa yÒi دÓ)yÖ ß cedÓ ÖÞ ldr`¤Õ©ÒÐ wgbin`ÓÐi ¯ÐeÔ%ÏÐÐ Ï 4HÒ3ßÜ Ðd qÕÐa Ð Õq 3`¥©ÙÔ larc£¤ÐÓÒÔ rc ¶Ón`` lÒl`Ïbq`eÖHÖHggrcXeÔÞÔ bdn`4geig i ÏÐ ÓÏ eÒÐÚ ¤n`dba îÒ Ö\ t r x p r r s t uBs`rdE!`{`G\"1RR5w|w{`rXBes\ `s Í k Æk% Ð hÕ ¯ÒØà çeÜÒqÛiq eØÐ gn`Ý eÓ¯ÐÕ Ðg ©Òßg ÏÜ pq)Ðsg eÜbceqeaÞnc¶Ó¥ediÐgÕÚÓ ` bcÏ n`7©ÒÒ qg¶Ó5wg`` bÖ ©Òd ½Õ¥eai fc¯ÐÖ Õ pig Ï iÐgÕ bÓÏ` ÒnÚÐ ©ÒÐi rgHÒyÒ¼pqàÑdÓ qgVr3Öqbch qiÐgÕÚË Ê k i ÉÒÏ Ï lÒ!2©ldÞ jbi` pq©Êg ¯!ó Øg a å Ý f Ï` Ò àÎ eiìc²nÒeinØRlÒ`¶Öl`¯Ô Ðâ d Õ pdpgHdlcr`Ò ÐÖ pÒrcvrßei¥ Ða Càqc ®¯bÓÐd Õ ` ¥iÐc ƶÓÐa 7Ï '1hld` ÐÉ ©Ö pdwghjÐir qÊeq¿ÆÒrc qr Ò eØÌq g!ó Ý cÔÔ Ó q c Û iÔ c a i q gÐ cÞ rÓHiycrÓ ÐÓ 3ÖrcÔ Ð bÔn`lÒ½7pÝc Ð pÞrgÒqàedÐi #gÙ ¥gÕa eargÐHieðeÞrgrcÔ ncÒ Ï Ð ÃeÜpÝg¤nÒÐ piòÔ #ß¥Ï a 'edXÒcÐa ¯rÓð einßld3ßr`pd©Ò§¯Ðigwg Ò HØeÔc c Ï lÒÆsÒÏ`Ð i q qØ a Ò Ð Ò c Ü g Ò Ó@s \ Ð Ò c Õ Ð g Ó¤ i i g ý g c d Ï Ï Ï pÝnÓ iÐÓ gÕ ÒÏ Õ edÛ ÕqÐç edg g Ð Òr`Æs ÐgÕ lq Ðq nðeÓ§pqXraei5 åg yÒHÓc £Ð eÒ%¤àc ÒÓiÐa c ¿Ð g ÒÏ pÒ¥Ïc ÒÆsiÐa ` d Ï Ð 2H ÓredlÒbcp`n`7©Òg qgs bÖg ` d ½VSØ ¥Ieaa H fc5edÖ÷ 6 Hibcn`ìcÒÝ S2ìTd Ø Ý U²¬ 2H ¸ SV5»rdÏiÐ nØÐÒÒ ïldiÞ n`d 4ÏØÐÓ ºÐÒÒ Û wðqÕ¯ÖÐ nclÙCbÓ` ÐÖÐ`Ó Ï 5bÓHd%4Òc` yÒÐÓ ÐÓ Ø Ø qíqíÐ TòediiÐ Hdbcn`lcÒr`ÒÐÖ ÐÖ Hddd edcfcñU bqn`Ðs ÒgØ Ö Òi h ÖÖ @ d Ó ÐÒeiìc§¯ÖÝ wð Òe`nc%ldfg`ed ÖÐd yÒÐbÓb`v'1USÐd QeÔI½Yc rcª ®Ð ¶Óß3Ô` HdilcÒ r`eÝ©Òc fg¶ÖÐ b`bqØ pq©gÔ pÔ§ÒgÙ eÖÐi wgrÙniyÒÐi ½h3ßed§qÕÓ rdÐ ©si nØbclqHqiÐÒ ìcXÏÝ nd¶Ö` Ði Ï nÒ©Ò3sÛg )0¬Ô pqIwg ¬2Ði S P2ÞÐd « T 7ldÏÞÐ În`Ø Ó@s q g à Ò Þ ÓÓ pÜgX gÜ g qàpd¥²Ó ÐagÓ yÒÐ Õ¯Ó3`yß©ÙrcÓ ÔÞi bdn`pÒÏ bÖrg` ÏÐi HÔ§yÒHÓ¥ed§Ò ÐÓÐd Ô ®ä §Ð×î piÐÒ §wðg 3Ö¯ÒncHغ)eqcÓ eÜÅbcedgg ©sn`lcÒ ` 3dÕ Xniwgð ncÒ Ò ¤ÕÐ ¯ÏÐ fÐÕXcÒ Ð drcÖ ÆÐÒ piРƶs g ÒÏ bq%ÐÓ` edÒbar`bcn`n`ÆÒi Ó ÐsÖ bqeÖd lqÆÝ`gìØnÝs Ði Ð Ð Ò7ldÏ Î6` c ca c i Ñ Ö i Î ÐÒ ÔÔ c Þ Þ Ð g q Ú àHqc¯ncÐ eÒncÔ ` Æsä ÆÞ Î `ý d Ï ÃpÝc edÛ bcn`pÒrgÒ Ðd Ða qq ¥ba` ÐÐ ÒÏ Ð lÜr`irÖÓ ¯ÐÕ rcÔ ½`Ò Hd£ldH`ec¥Þ d ÒÏ Õ pd`¥eÔ3clc¯ Ó ÙÐq Ð q¯eÔÐ rcÒ c ÒÏ Ï ÒÆ¿bdbdq e` ÐÞ Ü g©Òr`lcHdwgHÒ Ðd Ð Ò Ða ¥la` i ÒÏ earcìiiÐÝ rÓ ÐÒ bÔndÓ ¯ÐÕ Õ cvsÖ 7bd Õ` bØqÓÖ bdi Ði Ò rÙ Ði ¥ ÐÜ s Ï ÓÒ eÝ5Hdlcr`©ÒwgHÒ Ðd Ða ¥la` `Ô gnðÐqbqeÓ4ý Ï pÝc Ð Ö rØÒÔÖ rØd niyÒÓ ÒÏ Ð lÜr`irÖÓ ¯Ð5Ð ÖhHdlcr`Ò ÒXÐÖÒ £bÓ` Ï Ñd qàHdÒ ÒÏÓ lcr`ÒeÖÜÕ rgedrgriÒ Ðs §Ód i Ô ÐÓ pÒbgr`Òld` Ö ÕÐ Ï pdCpÝFbcedcÓ n`HdÒlcr`©ÒÐÖ rgÒd edcÐd Fa Ð Ðs q %barÓFedÐÔ¯Ò` HÖgfÖ q×%ÒrÓg bßbqpqÐd Hdg 3Ø)bdc ¥ÒÔn` HaedcfcPpÒ@gc sÏ XHÓHÔ½lc3cg pÝ)· ÙÐqcq ÏÒ Ð Þ q ¯eØÚ HÔc ncCg Ð FpdedgfgÛHqcÖ ¯ÐiÖ ncrÙeÒncÐi Å ÆÐÜ ä ÆsÎ Î îý Ò@ rVj§ ¦É RF©Ehi É ¤ É £ghd!k ö¡ rh § ¥ Í h¤h ~h £ Í h k r ¢ È Ð c c Üa d g Óg Ó 3ß¼eÛfß Ðd `ë ¯ÐÕ à ¶ÓÕ` gÒÏ lcq ÒÏ Ý Ð eig õÏ XÓÓ rc@ôÒ Ó iÐgÕ ÒÏ Ò Ða Ò¯ÓnßÓeÚgÞ ldý r`©Òwg Ði eÔi ipÝÖ ¤ Ði 5c3ؼlqeq¥na¥XqÞ ldÔ n`Ø ÜÖÖ incHaìi¿ Ði yØvÒ yd ÕcÐÓ ©Òg Ï Ãbq Ðq yðHÓܧ¿HÒ Ðd rifØedc pÝòHdlcr`©ÒwgHÒ Ðd Ða ¥la` rÓpdHig ycg rÓedÐÓ úrc3Öc liÞ d 3`Ô rðeiÐ @bÔcq n`TlßqlÒs ½ÒØrq @Ðda pÝÒ nic fØÐ Ö eÞrgÐ Òpipdg ©g pagÕÙ Ðg Ð¥pðÒ Õ HÒwg·ÐdÒ c ncÒa eÔÐ bcpÜg ÙÐqq Ð ¯ÐÐ Õ hà bßÞlqeqý ¥\"raCg` eiq7¿ÎdÏcÐ q Ò ÐàôØ Hdld`c sÏ eÖÐ XeÞg Xwða#gc ÒHÖÓcg ¿ÓÏÔ ÐÐ Ï PiÐgÕ Ò edcÒÏ ÏÐ eÖlÒÆyÔs ÓyÚqÕÐ Ði rd)hedgÖÐiÓ Ø × fcÖÏ ÐÞ HؽcÜ rcÏ Òº qÕÐÛ qÐpÞÐ rgÒd edô #gÙ Õ rgbÓ` 'Ð aed%¶Ó` iÐ i 7ÐÏ Î bd¯ Ðâ bÔn`lÒ½a 9q Ñ pÝ` 5bÓbqp`wgÒ i ¯· ÒÏ `) ÖÕ Ð ÖndÐiÒ ÕcÐÓ Ði %eaÜ Õ rgHieÞa rc£Ô a¥ÒÏc Õ edHg¤ÛÒ ÏÒi clÞÐ`Ð s ÏÒ lÞb`R¶Ó½fßcgÖ Ðd riØHdi cÖ bÖ`Ð 7ÏÏ lÒÎ l`HqHàncß eiedrg¥aic bÜb`%ÏÞÐq CeÝc ÐiÐgÕ`Òld ÏÖ ed·XnaÐdgÒ ÓHiìcc yÝÏ ¤Ôi eØHcÐ iÒÏß eݺÐc qld¯Ð` ½%fceac %qÞ bd¯Ð¥Õ` %earga Hi¶Ó` eÞÏ rcCÔ eÝXfÓÒÏ ¶Ön`yÒÏ ¶ÓlÒn`ÆÒsÐi` q HÖrgÐ Õ ei¥7ÖÏ a rÓ ÐÓ Ð 73ÖÏ ÎrcÔ Ö Ð qÔ ` Ò Ó Ó qà Ði %eargÐ HieÞÒ rcÔ Ï ¥ncÒ ÐÐ lÜn`Ó bÓ3`3ÙbdÒ7bÓ` ia i Ð Ò q ` ÞÐ ¶Öe`c ÖÏ Ï ÔÒ Û qÕÐ Ò Ðd a Ð %ba7g` ¶Ó¤¶Ó` Ï @ ÐÙÐi ©s¤cc g Ôý aà HdÔ lcr`Ò ÐÖ ÆHØlc3` ÐÙ Ô Ï ·ld` ¤ÕÐ bÜn`finÖÓ ¯Õ Hdlcr`¯eÔc Þ Ø ® bdbd%raÐâ¯`` eiìcq lÔnÝr`ÒÐi q ½aÓ 19iÐgÕ £ÏÑ ÏÒÐ bq'ÐqÒ d yðfÐHÓÐ §sý ÐÒ Ð Üq bÔn`Ð lÒHÓ3cq 5cØ 'einÒÖaÏ #ߥönØ5ÐaÓ c yÒ¯ÓÎ yßqàÓ Ó Ð lar`iÐgÕ ÒÏ nØÒd bqi Ðq yðÐ Ï HÓÒ§eÛg Xyqýbß 3ßÓ HØpdXÐcg rgeda lÒÐÓ ½Ðâq Ø bq a n`bÔn`Ó lÒ9q ½Ø aÑ eÝÕ c pdÐ rÓÖg pdwgÐÓ Ò¯Ö)ncÓ ld5Ô`i pd4Ðag ncÒ¶Ó¯ÓpqnßÆbÓÓg ÃçÞ` ldr` ©Òwgý Ði C eÔbdc 5Ð` eqHdlÞc r`ld©Òn`ÆÒÓrg vÐdg ldºa` ÐÓ %Å`baiÔdq rØ Ða Ð yÒÏ 3ÓinßÒ ÒÓ HÓÐ Ðg ibq a n`pÒÒiHidg rØpiåc lq bqÐq Ðq nðeÓnðeÓ44ýgg ÃÒÐý Ï fÒÐd ÷qni¯ØÐi Õ ¥HdcÖ ca ¶Ó ` q ÒÏ 9 Ñ ÐÚ Ú` %baºpqwg ÐÙÐi qY ¤àÔ yÒHi)yØbd¼3`à ââ Ð` §gqd lÔ¤Òêr` eiq ìc5ÆaÝØ Ó yÒbÓ¯`9Ð Ðâ Ó Õ pd'gg iÐgÕ ldÒÏÞ r`piBAgg Ï YÑ ÓÞ @¿laä r`Ð HÖÒÐ yÔÓÐÙÐq g nÚq7Ði Ú ©sÓ lcÃqØ eÝ7ÒÏcÐ Ó ed¯bÐc n`Õ pÒ`rg©ÙÒrcÐdi bqlqÐa ÆsÔ cÔÔ Ó Þ Ô ` irgpÒn`bcedÒ Ðd Ða ¥bavÓ iÐgÕ ÒÏ Ð eÖnÔÓyÚ Ði Ø ÒÏ ÏÕ pdÐ ii ÐÛ s eÞeØpd¶gqÞ Ï ò3ßÜ ¤Õ¯Õ `©Ùrc½ ÐÓ bÙn`lÒ¥lar`Ô Ò` aÒ Ð i Ô ` i q÷¯ÐßÓ )ÕÖ y`)Ðd Ó ldni%fØedÒÏ bÖ c n`edÒfceÖÐa Ö wgyÒni¯ÓyÒÐ yßÏ5pÜÓÓ CgÞ ldÞ bdr`y`©Ò)wgÓ XiÐgÕ Ø Ði edÏ eÔ¿n`Òbc ©Òc eÝg qgeÝXÐicc bÖb`q edbcÔ 5wg©Òn`ÜeÔg a i 3ØÒ)#ÏdÐ bqÐd pqbÓXÐag ` ¤½lÒ¥ºng `laX5²bÒeÔgedcpÝ`ƽncncß bgeqÒlqwÓ edÐÒ r`¥lßÐdÒc ² Ði q nÓlÜÓn`¥ÓÆpaÐ )eic wg@eÞeiÔ ReiÓ rcåc i Ô rÓiÐgÕ ÐÓ Ð 73ÖÏ ÒÏ ÎrcÐ ià HÖwçÔ Ðg Ði nÔHq©ÒÓnÞÚ ¶gq ldn`Ði qÐvêgÓÐÓ§ ÐnÓ g `iÐgÕ nqa Ó Ô Ó\ } v t jRRjw{ Rje11es PPSa²²ºPY¸ ¹ ST²¬H ± µ³ SQ ® UV22VUI2¥1222w¸·V¶2IY ª V® IH S SQ ± µ³ ²±aY° ®® ¬¬SP« 12IY ª V´R|V12¥V¯21IT", ["popl/abstract/00001450.pdf"] = "", ["sigplan/2003/pdfs/sigp/640136/index.pdf"] = "Main TOC\ Proceedings TOC\ Search\ ACM SIGPLAN Notices Volume 38, Issue 3 (March 2003), Special Issue TLDI '03: The 2003 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation New Orleans, Louisiana, USA January 18, 2003\ Frontmatter (Inside Cover & Copyright Page, Foreword, Table of Contents, TLDI '03 Workshop Organization)\ SESSION: Types and multithreading\ Types for atomicity Cormac Flanagan and Shaz Qadeer Type-safe multithreading in cyclone Dan Grossman\ SESSION: Types and programming\ Scrap your boilerplate: a practical design pattern for generic programming Ralf Lämmel and Simon Peyton Jones A calculus for probabilistic languages Sungwoo Park\ SESSION: Type-based analysis", ["alan-jay-smith/the_task_of_the_referee.pdf"] = "The Task of the Referee *\ Alan Jay Smith\ Computer Science Division\ EECS Department\ University of California\ Berkeley, California 947-0, USA\ ", ["norman-ramsey/maniaj.pdf"] = "paper uses the power to solve an open programming problem, adding a to that debate. We focus on a kind of interpreter for which extensibility and separate c are especially important: the embedded interpreter. Embedding is motiva problem of controlling a complex application, like a web server or an compiler, that is written in a statically typed, compiled language such a or ML. Such an application will have lots of potential configurations and How are you to control it? If you use command-line arguments, you may fi writing an interpreter for an increasingly complicated language of com\ and data to the scripting language, which we call extension. 2. The interpreter should be compiled separately from the application ular, it should be possible to compile an application-specific extensi using or changing the interpreter's source code. In other words, the should be isolated in a library. 3. The combination of application and scripting language should be and this safety should be checked by the host-language compiler.\ This paper presents Lua-ML, which to my knowledge is the first embed preter to meet all three of these requirements. Lua-ML's API makes it 2\ a pointer to an interpreter and a value of type ClientData. This value to private data that is associated with the command; in this way, a Tcl can simulate a closure or methods of an object. Tcl's API enables an application to add new commands to an interprete Tcl code on demand, and so on. Adding a new command requires sup only an appropriate C procedure but also a value of type ClientData. Tcl provides limited support for embedding and projection. The AP functions to project a Tcl value (which is always a string) to an integer,\ 3\ value can be manipulated only when on the Lua stack, which is an a provided by the API. This design simplifies garbage collection of Lua va Like Tcl's API, Lua's API enables an application to add new values t preter, evaluate Lua code on demand, and so on. Lua's API provides an embedding function and a projection function its six types. Through its userdata type, Lua also provides support for and projection of application-specific types: a userdata value is repres C pointer of type void * and a small-integer tag, which identifies the t of the pointer. The Lua API contains support for allocating a unique t 4\ functions that move up and down the tower. Each such function is sim ample, a value from the level below arithx might be embedded by the fu v -> Other v, and a value from the arithx level might be projected do the function function Other v -> v | -> raise Projection. Building a full tower of types requires linking multiple levels through parameter, then tying the knot with a recursive definition of value, in w is used as the 'value parameter. The use of a type parameter to tie knot is called two-level types by Sheard (2001). This technique deserves widely known. 5\ | Bignum of Big_int.big_int | Ratio of value * value and void = Void of void\ (This style is even more convenient in Haskell, because mutually recu nitions may be spread over a module with other definitions intercalate them.) The 'value parameter has been dropped; instead the Ratio c refers directly to the value type. Because mutually recursive types must in a single module, this design sacrifices separate compilation for conven\ 6", ["sigplan/2003/pdfs/sigp/773039/p25-stefanovic.pdf"] = "Main TOC\ Newsletter TOC\ Search\ Older-first Garbage Collection in Practice: Evaluation in a Java Virtual Machine,\ Darko Stefanovid § Matthew Hertz\"t Stephen M. Blackburn~ Kathryn S. McKinley* J. Eliot B. Moss t\ ~'Dept. of Computer Science\ University of New Mexico\ t Dept. of Computer Science University of Massachusetts\ Amherst, MA 01003\ 'l Dept. of Computer Science", ["sigplan/2003/pdfs/proceeding/780732/p199-guo.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ A Graph Covering Algorithm for a Coarse Grain Reconfigurable System\ Yuanqing Guo yguo@cs.utwente.nl Hajo Broersma broersma@cs.utwente.nl Gerard J.M. Smit smit@cs.utwente.nl Paul M. Heysters heysters@cs.utwente.nl\ Faculty of Electrical Engineering, Mathematics and Computer Science University of Twente, P.O. Box 217, 7500AE Enschede, The Netherlands", ["popl/data/00001472.pdf"] = "COtIfeIX3nCe\ Record\ of\ the\ Fifth\ Annual\ ACM\ Symposium\ on\ Principles", ["luca-cardelli/BasicTypechecking.ps.bz2"] = "Page 1\ Science of Computer Programming 8/- (April 1987) Revised 6/-1/88\ Basic Polymorphic Typechecking\ Luca Cardelli\ AT&T Bell Laboratories, Murray Hill, NJ 07974\ (current address: DEC SRC, 130 Lytton Ave, Palo Alto, CA 94301)\ Introduction\ Polymorphic means to have many forms. As related to programming languages, it refers to\ data or programs which have many types, or which operate on many types. There are several\ ", ["sigplan/2003/pdfs/proceeding/781131/p12-lamb.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Linear Analysis and Optimization of Stream Programs\ Andrew A. Lamb, William Thies and Saman Amarasinghe\ {aalamb,\ thies, saman}@lcs.mit.edu", ["popl/data/00001438.pdf"] = "THE EVOLUTIONOF PROGRAMS: A SYSTEM FOR AUTOMATICPROGRAMMODIFICATION\ Nachum Dershowitz\ and\ Zohar Manna\ Stanford Artificial Intelligence Laboratory, Stanford University, Stanford, California and Department of Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel", ["martin-ward/middle-out-t.ps.gz"] = "Language Oriented Programming\ M. P. Ward\ Computer Science Department\ Science Labs, South Rd\ Durham, DH1 3LE\ January 6, 199-\ ", ["popl/data/00001510.pdf"] = "Position\ Paper on Optimizing\ S. C. Johnson Bell Murray Hill, Laboratories New Jersey\ Compilers\ 07974\ Optimizing compilers were essential on older-style machines, and are still frequently desirable on today's architectures. I argue that it is both possible and desirable to eliminate optimizing compilers from future computing ture, major o systems by correct choices of architecand operating system. The language, points are, inno Expense particular order: compilers are This Optimizing\ usefully\ q\ debugged\ during", ["pi/mobile-processes-bibliography.pdf"] = "Mobile Processes:\ a Commented Bibliography\ Silvano Dal Zilio\ Microsoft Research\ Abstract. We propose a short bibliographic survey of calculi for mobile\ processes. Contrasting with other similar exercises, we consider two re­\ lated, but distinct, notions of mobile processes, namely labile processes,\ which can exhibit dynamic changes in their interaction structure, as mod­\ elled in the #­calculus of Milner, Parrow and Walker for example, and\ ", ["sigplan/2003/pdfs/proceeding/780732/p220-zhuang.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Storage Assignment Optimizations through Variable Coalescence for Embedded Processors\ Xiaotong Zhuang ChokSheak Lau Santosh Pande\ Georgia Institute of Technology College of Computing 801 Atlantic Drive Atlanta, GA, 30332-0280\ {xt2000, chok, santosh}@cc.gatech.edu", ["derek-dreyer/type-classes.pdf"] = "Modular Type Classes\ (Draft of April 8, -006)\ Derek Dreyer\ Toyota Technological Institute at Chicago\ dreyer@tti­c.org\ Robert Harper\ Carnegie Mellon University\ rwh@cs.cmu.edu\ Manuel M.T. Chakravarty\ ", ["popl/data/00001416.pdf"] = "On Directly\ Constructing\ LR(k) Parsers\ Without\ Wilf Department of\ Chain Reductions\ R. LaLonde Engineering\ Systems University Canada.\ Carleton Ottawa,\ KIS", ["sigplan/2003/pdfs/sigp/966051/p44-kamin.pdf"] = "Main TOC\ Newsletter TOC\ Search\ Routine Run-time Code Generation\ Sam Kamin* Computer Science Department\ University of Illinois at Urbana-Champaign +1 (217) 333-7505", ["sigplan/2003/pdfs/proceeding/780732/index.pdf"] = "Main TOC\ Newsletter TOC\ Search\ LCTES '03: The 2003 ACM SIGPLAN Conference on Language, Compiler, and Tool Support for Embedded Systems San Diego, California, USA June 11-13, 2003\ Frontmatter (Inside Cover & Copyright Page, General Chair's Address, Program Chairman's Address, Table of Contents, LCTES '03 Conference Organization, LCTES '03 Symposium Organization, Reviewers)\ SESSION: Compiler optimizations\ Predicting the impact of optimizations for embedded systems Min Zhao, Bruce Childers, and Mary Lou Soffa Finding effective optimization phase sequences Prasad Kulkarni, Wankang Zhao, Hwashin Moon, Kyunghwan Cho, David Whalley, Jack Davidson, Mark Bailey, Yunheung Paek, and Kyle Gallivan Advanced copy propagation for arrays Peter Vanbroekhoven, Gerda Janssens, Maurice Bruynooghe, Henk Corporaal, and Francky Catthoor\ SESSION: Efficient Java systems\ A java virtual machine architecture for very small devices Nik Shaylor, Douglas N. Simon, and William R. Bush Compiling java for low-end embedded systems Ulrik Pagh Schultz, Kim Burgaard, Flemming Gram Christensen, and Jørgen Lindskov Knudsen Efficient memory-reference checks for real-time java Angelo Corsaro and Ron K. Cytron Data size optimizations for java programs C. Scott Ananian and Martin Rinard\ SESSION: Memory management", ["david-salomon/asl.pdf"] = "Contents\ Preface xi\ Intv\ duct-- 1\ AShort Hist8 of Assemblers and Loaders 7\ Types of Assemblers and Loaders 11\ 1 Basic Principles 13\ 1.1Asse\ ble OpeRLSQB 13\ ", ["sigplan/2003/pdfs/proceeding/604131/p1-simoen.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ The Essence of XML\ Jerome Simeon ´^ ´ Bell Laboratories simeon@research.bell-labs.com Philip Wadler Avaya Labs wadler@avaya.com", ["oliver-laumann/elk.ps"] = "Elk: The Extension Language Kit\ Oliver Laumann* and Carsten Bormann +\ * Technische Universität Berlin, Germany\ + Universität Bremen, Germany\ ", ["modules/Xavier.pdf"] = "J. Functional Programming 10 (3): -69--303, May -000. Printed in the United Kingdom\ c\ # -000 Cambridge University Press\ -69\ A modular module system\ XAVIER LEROY\ INRIA Rocquencourt, B.P. 10-, 781-3 Le Chesnay, France\ (e­mail: Xavier.Leroy@inria.fr)\ ", ["popl/data/00001365.pdf"] = "A\ Parallel\ Approach\ to Compilation\ Mary Lawrence\ Zosel Laboratory\ Livermore\ Introduction Design vector ment niques. limited hardware. performance speed\ CDC program (1) In the programming problems languages has included area, work in\ of programs", ["sigplan/2003/pdfs/topl/778559/p452-schultz.pdf"] = "Main TOC\ Transactions TOC\ Search\ Automatic Program Specialization for Java\ ULRIK P. SCHULTZ University of Aarhus JULIA L. LAWALL University of Copenhagen CHARLES CONSEL INRIA/LaBRI", ["phil-wadler/marktoberdorf.dvi"] = "\ \ Monads for functional programming\ Philip Wadler, University of Glasgow?\ \ \ Department of Computing Science, University of Glasgow, G12 8QQ, Scotland\ (wadler@dcs.glasgow.ac.uk)", ["norman-ramsey/maniaws.dvi"] = "", ["matthias-felleisen/units.ps"] = "Units: Cool Modules for HOT Languages\ Matthew Flatt Matthias Felleisen\ Department of Computer Science -Lambda\ Rice University\ Houston, Texas 7700-­189-\ ", ["bernhard-westfechtel/SEGRAGRA.ps.gz"] = "Electronic Notes in Theoretical Computer Science - (199-)\ URL: http://www.elsevier.nl/locate/entcs/volume-.html 10 pages\ A Programmed Graph Rewriting System\ for Software Process Management\ Peter Heimann, Gregor Joeris, Carl­Arndt Krapp\ Bernhard Westfechtel\ Lehrstuhl f¨ur Informatik III\ RWTH Aachen\ D­--074 Aachen\ ", ["popl/data/00001408.pdf"] = "AUTOMATIC\ GENERATION FOR\ OF EFFICIENT GRAMMARS\ EVALUATORS\ ATTRIBUTE\ Ken Scott Department of Rice Houston,\ Kennedy K. Warren Sciences 77001\ Mathematical University Texas\ 1.\ INTRODUCTION", ["roberto-ierusalimschy/lua.ps.gz"] = "SOFTWARE---PRACTICE AND EXPERIENCE, VOL. 0(0), 1--18 (? 19??)\ Lua---an extensible extension language\ Roberto Ierusalimschy Luiz Henrique de Figueiredo Waldemar Celes Filho\ TeCGraf, Computer Science Department, PUC--Rio\ froberto,lhf,celesg@icad.puc­rio.br\ SUMMARY\ This paper describes Lua, a language for extending applications. Lua combines proce­\ dural features with powerful data description facilities, by using a simple, yet powerful,\ mechanism of tables. This mechanism implements the concepts of records, arrays, and re­\ ", ["popl/data/00001407.pdf"] = "Code Generation\ for Expressions with Common Subexpressions", ["tim-harris/cpwl-submission.pdf"] = "Concurrent Programming Without Locks\ KEIR FRASER and TIM HARRIS\ University of Cambridge Computer Laboratory\ Mutual exclusion locks remain the de facto mechanism for concurrency control on shared­memory\ data structures. However, their apparent simplicity is deceptive: it is hard to design scalable\ locking strategies because they can harbour problems such as deadlock, priority inversion and\ convoying. Furthermore, scalable lock­based systems are not readily composable when building\ compound operations that span multiple structures. In looking for solutions to these problems,\ interest has developed in non­blocking systems which have promised scalability and robustness by\ ", ["sigplan/2003/pdfs/topl/641909/p316-c_rinard.pdf"] = "Main TOC\ Transactions TOC\ Search\ Eliminating Synchronization Bottlenecks Using Adaptive Replication\ MARTIN C. RINARD Massachusetts Institute of Technology and PEDRO C. DINIZ University of Southern California", ["ralf-hinze/HW00.ps.gz"] = "Derivable Type Classes\ Ralf Hinze\ Institut fur Informatik III\ Universitat Bonn\ Romerstrae 164, -3117 Bonn, Germany\ email: ralf@informatik.uni-bonn.de\ Simon Peyton Jones\ Microsoft Research Ltd\ St George House, 1 Guildhall St\ ", ["sigplan/2003/pdfs/aindex-pdf.pdf"] = "Main TOC\ Search\ Author Index\ A G M S\ B H N T\ C I O U Y\ D J P V Z\ E K Q W\ F L R X\ First Page", ["john-harrison/qed.ps"] = "Formalized Mathematics\ John Harrison\ š\ Abo Akademi University, Department of Computer Science\ Lemmink˜aisenkatu 14a, -0--0 Turku, Finland\ jharriso@abo.fi\ http://www.abo.fi/”jharriso/\ 13th August 1996\ ", ["simon-peyton-jones/state-lasc.ps.gz"] = ", , 1---1 ()\ c\ fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.\ State in Haskell\ JOHN LAUNCHBURY jl@cse.ogi.edu\ Oregon Graduate Institute, PO Box 91000, Portland, OR 97-91­1000\ SIMON L PEYTON JONES simonpj@dcs.glasgow.ac.uk\ University of Glasgow, G1- 8QQ, Scotland\ Abstract. Some algorithms make critical internal use of updatable state, even though their\ ", ["sigplan/2003/pdfs/sigp/885638/p23-das.pdf"] = "Main TOC\ Newsletter TOC\ Search\ Function Inlining versus Function Cloning\ Dibyendu Das\ Hewlett Packard India S/W Operations, 29 Cunningham Rd, Bangalore 560 052, India e-mail:dibyend@india.hp.com\ 1\ Introduction", ["andrew-appel/cpcps.ps.gz"] = "­\ Continuation­Passing, Closure­Passing Style\ Andrew W. Appel*\ Trevor Jim+\ CS­TR­183­88\ July 1988\ Revised September 1988\ ", ["bernhard-westfechtel/CW97.ps.gz"] = "Towards a Uniform Version Model for\ Software Configuration Management\ Reidar Conradi 1 and Bernhard Westfechtel -\ 1 Norwegian University of Science and Technology (NTNU)\ N­7034 Trondheim, Norway\ conradi@idt.ntnu.no\ - Lehrstuhl f¨ur Informatik III, RWTH Aachen\ Ahornstrasse --, D­--074 Aachen\ bernhard@i3.informatik.rwth­aachen.de\ ", ["sigplan/2003/pdfs/sigp/773039/p37-almasi.pdf"] = "Main TOC\ Newsletter TOC\ Search\ Calculating Stack Distances Efficiently\ George AIm&si, C~lin Ca,~caval and David A. Padua Department of Computer Science University of Illinois at Urbana-Champaign {galmasi, cascaval, padua}@cs.uiuc.edu", ["paul-hudak/icra99.ps.gz"] = "A Language for Declarative Robotic Programming\ John Peterson, Gregory D. Hager, and Paul Hudak\ Department of Computer Science\ Yale University\ New Haven, CT 06--0\ ", ["norman-ramsey/match.ps"] = "When Do Match-Compilation Heuristics Matter?\ Kevin Scott and Norman Ramsey\ Department of Computer Science\ University of Virginia\ jks6b@cs.virginia.edu nr@cs.virginia.edu\ May -000\ ", ["cristina-cifuentes/scp01.ps.gz"] = "Recovery of Jump Table Case Statements\ from Binary Code ?\ Cristina Cifuentes ?? and Mike Van Emmerik\ Department of Computer Science and Electrical Engineering\ The University of Queensland\ Brisbane Qld 407-\ Australia\ fcristina,emmerikg@csee.uq.edu.au\ ", ["xavier-leroy/zinc.pdf"] = " \   14970 33-9 \ 9 \ 9 9999 9999\ ! #\"%$%&'$)(*$+,$%&.-/ #+/0\ 13-\  --4768-:974;68-\ - <! 3=>- 9)? +,$%&.@A(\ ", ["sigplan/2003/pdfs/proceeding/780732/p144-pratap.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search", ["keith-cooper/survey.pdf"] = "Compiler­Based Code­Improvement Techniques\ KEITH D. COOPER, KATHRYN S. MCKINLEY, and LINDA TORCZON\ Since the earliest days of compilation, code quality has been recognized as an important problem 18. A rich\ literature has developed around the issue of improving code quality. This paper surveys one part of that literature:\ code transformations intended to improve the running time of programs on uniprocessor machines.\ This paper emphasizes transformations intended to improve code quality rather than analysis methods. We\ describe analytical techniques and specific data­flow problems to the extent that they are necessary to understand\ the transformations. Other papers provide excellent summaries of the various sub­fields of program analysis.\ The paper is structured around a simple taxonomy that classifies transformations based on how they change the\ ", ["luca-cardelli/mobility-security.pdf"] = "1\ Mobility and Security\ Luca Cardelli\ Microsoft Research\ Lecture Notes for the Marktoberdorf Summer School 1999,\ from works by Luca Cardelli and Andrew D. Gordon\ Abstract. We discuss the computational aspects of wide area networks, and we describe var­\ ious facets of a process calculus devised to embody mobility, security, and wide area network\ semantics. These lecture notes are an abridged version of 8, 11, -7, 1-, 13.\ ", ["tim-harris/2005-scp.pdf"] = "Exceptions and side­e#ects in atomic blocks\ Tim Harris\ Microsoft Research, 7 JJ Thomson Avenue, Cambridge, UK, CB3 0FB\ ", ["sigplan/2003/pdfs/proceeding/780732/p163-wasowski.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ On Efficient Program Synthesis from Statecharts\ Andrzej Wasowski\ Department of Innovation IT University of Copenhagen 2400 Copenhagen NV, Denmark\ wasowski@it-c.dk", ["popl/data/00001513.pdf"] = "Linear\ Cost is Sometimes\ Quadratic\ Barry Computer IBM Thomas Yorktown\ K. Rosen Department Research NY 10598 Center\ Sciences J. Watson Heights,", ["robin-milner/ECS-LFCS-89-86.ps"] = "A Calculus of Mobile Processes, Part II\ Robin Milner, University of Edinburgh, Scotland\ Joachim Parrow, Swedish Institute of Computer Science,\ Kista, Sweden\ David Walker, University of Technology, Sydney, Australia\ June 1989 (Revised October 1990)\ 1\ \ Running title: Calculus of Mobile Processes, Part II\ ", ["popl/abstract/00001557.pdf"] = "", ["sigplan/2003/pdfs/proceeding/949305/p78-demsky.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Automatic Detection and Repair of Errors in Data Structures\ Brian Demsky\ Laboratory for Computer Science Massachusetts Institute of Technology Cambridge, MA 02139\ Martin Rinard\ Laboratory for Computer Science Massachusetts Institute of Technology Cambridge, MA 02139", ["popl/abstract/00001518.pdf"] = "", ["popl/data/00001450.pdf"] = "Conference\ Record\ of\ the\ Fifth\ AXUNJal\ ACM\ symposium\ on\ Principles", ["popl/data/00001400.pdf"] = "PROGRAM SCHEMAS EXECUTION\ WITH\ CONCURRENCY:\ TIME\ AND HANGUPS+\ Department\ Bruce P. Lester of Electrical Princeton Princeton,\ Engineering\ University N.J. 08540", ["sigplan/2003/pdfs/proceeding/781498/p191-goel.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Compactly Representing Parallel Program Executions\ Ankit Goel Abhik Roychoudhury\ School of Computing National University of Singapore Republic of Singapore 117543 [ankitgoe,abhik,tulika]@comp.nus.edu.sg\ Tulika Mitra", ["sigplan/2003/pdfs/proceeding/781131/p258-joisha.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Static Array Storage Optimization in MATLAB\ Pramod G. Joisha\ ECE Department Northwestern University, Evanston, IL 60208\ Prithviraj Banerjee\ ECE Department Northwestern University, Evanston, IL 60208\ pjoisha@ece.northwestern.edu", ["sigplan/2003/pdfs/proceeding/944705/p65-levin.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Compiling Regular Patterns\ Michael Y. Levin\ University of Pennsylvania\ milevin@cis.upenn.edu", ["popl/abstract/00001647.pdf"] = "", ["popl/abstract/00001405.pdf"] = "", ["popl/abstract/00001494.pdf"] = "", ["sigplan/2003/pdfs/proceeding/774833/p87-grissom.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Algorithm Visualization in CS Education: Comparing Levels of Student Engagement\ Scott Grissom Grand Valley State University grissom@gvsu.edu Myles F. McNally Alma College mcnally@alma.edu Tom Naps University of Wis. - Oshkosh naps@uwosh.edu", ["sigplan/2003/pdfs/proceeding/949305/p96-allen.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ A First-Class Approach to Genericity \ Eric Allen\ Rice University 6100 South Main St. Houston TX 77005\ Jonathan Bannet\ Rice University 6100 South Main St. Houston TX 77005\ Robert Cartwright", ["john-harrison/qedl.ps"] = "Formalized Mathematics\ John Harrison\ š\ Abo Akademi University, Department of Computer Science\ Lemmink˜aisenkatu 14a, -0--0 Turku, Finland\ jharriso@abo.fi\ http://www.abo.fi/”jharriso/\ 13th August 1996\ ", ["henry-massalin/threads.ps"] = "Threads and Input/Output in the Synthesis\ Kernel\ Henry Massalin Calton Pu\ Department of Computer Science\ Columbia University,\ New York, NY 100-7\ calton@cs.columbia.edu\ November 3, 199-\ ", ["popl/abstract/00001493.pdf"] = "", ["lennart-augustsson/pepm97.ps.gz"] = "Partial evaluation in aircraft crew planning\ Lennart Augustsson\ Carlstedt Research & Technology\ Stora badhusgatan 18­-0\ S­411 -1 G¨oteborg, Sweden\ Email: augustss@carlstedt.se\ WWW: http://www.carlstedt.se/~augustss\ Phone: +46 31 701 4- 36\ Fax: +46 31 10 19 87\ ", ["peter-miller/recursive-make.pdf"] = "Recursive Make Considered Harmful\ Peter Miller\ millerp@canb.auug.org.au\ ", ["sigplan/2003/pdfs/proceeding/781498/p144-frens.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ QR Factorization with Morton-Ordered Quadtree Matrices for Memory Re-use and Parallelism\ Jeremy D. Frens\ David S. Wise\ Calvin College Grand Rapids, MI 49546-4388\ Indiana University Bloomington, IN 47405-7104", ["sigplan/2003/pdfs/proceeding/858570/p58-whaley.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Joeq: A Virtual Machine and Compiler Infrastructure\ John Whaley\ Computer Systems Laboratory Stanford University Stanford, CA 94305\ jwhaley@stanford.edu", ["popl/abstract/00001402.pdf"] = "", ["martin-erwig/ActivePatterns_IFL96.pdf"] = "\ 999 9999 9999 9999 9999 9999 9999 9999 9999 9999 \ ÷§p¬ù§Hµù§T¸ ÕèõDBчDåDê‰I\ LNMPOAQRTSVUXWYOZOCSY-&^\ _a`4b.c.d\ UXWYOZOCSY\ jlk8mn>opqsr,k-mntqsuv\ w uyx wz k87{|m w%} uqstn~.kY€‚,mnƒ\ w uq\ ", ["neal-glew/mcrt/X10/IBM-X10-Sarkar.pdf"] = "X10\ ­­­\ a\ New\ Programming\ Model\ for\ Productive\ Scalable\ Parallel", ["popl/abstract/00001634.pdf"] = "", ["sigplan/2003/pdfs/proceeding/777388/p10-gluck.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Transforming Interpreters into Inverse Interpreters by Partial Evaluation\ Robert Gluck ¨\ Youhei Kawada\ Waseda University, School of Science and Engineering Tokyo 169-8555, Japan\ Takuya Hashimoto\ Waseda University, School of Science and Engineering Tokyo 169-8555, Japan", ["george-trigg/errors.djvu"] = "VOLU.,a 42, Nv,'as2 12 \ PHYSICAL \ REVIE\\V \ LETTERS \ 19 M.ca 1979 \ 748 \ 2. \ 3. \ 4. \ 5. \ 6. \ 7. \ 8. \ 9. \ 10. \ 11. \ 12. \ 13 \ 14. \ 15. \ 16. \ 17. \ 18. \ 19. \ Make sure each pronoun agrees with their antecedent. \ Just between you and I, the case of pronouns is important. \ Vatch out for irregular verbs which have crope into English. \ Verbs has to agree in number with their subjects. \ Don't use no double negatives. \ Being bad grnmma.r, a writer should not use dangling raodEiars. \ Join clauses good like a conjunction should. \ A writer must not shift your point of view. \ About sentence fragments. \ Don't use run-on sentences you got to punctuate them. \ In letters essays and reports use commas to separate items in series. \ Don't use commas, vhich are not necessary. \ Parenthetical words however should be enclosed in commas. \ Its important to use apostrophes right .in everybodys writing. ", ["curtis-cook/typo.pdf"] = "ALPHABETS & LANGUAGES\ Edgar H. Sibley Panel Editor\ There is disagreement about the role and importance of typographic style (source code formatting and commenting) in program comprehension. Results from experiments and opinions in programming style books are mixed. This article presents principles of typographic style consistent and compatible with the results of program comprehension studies. Four experiments demonstrate that the typographic style principles embodied in the book format significantly aid program comprehension and reduce maintenance effort.\ Typographic Style is More than Cosmetic\ Paul W. Oman and Curtis R. Cook\ Program comprehension plays an important role in many programming tasks. For example, about one half of a maintenance programmer's time is spent studying the source code and related documentation. Maintenance programmers cite understanding the intent and style of another programmer's code as the major difficulty in making a change [4]. Unfortunately, in many instances the only reliable description of a program is the source code itself. The contribution of typographic style (source code of the program is formatting) to the unclerstandability not clear. Ledgard and Tauer [7] believe that code \"should speak for itself\" and that code formatting is \"not window dressing, but a visible display of the meaning\" of the program. On the other hand, in their classic book on programming style, Kernighan and Plauger [5] state that \"if the code is clear and simple to begin with, formatting details are of secondary importance.\" They illustrate each of their style rules by describing the shortcomings of an example code segment, rewriting the example in a better style, and drawing the general rule from the specific case. It is interesting to note that virtually all of their rewritten versions contain implicit changes in typographic style. Experimental studies of typographic factors have also been inconclusive. For example, most programmers believe that programs with indentation are easier to comprehend than programs without indentation. Shneiderman and McKay [15], however, found no significant differences between subjects who were asked to locate and correct an error in the indented and unindented versions of the same program. Also, Love [9] tested the impact of indentation and control flow complexity on program comprehension and found no significant differences between indented and unindented code. A later experiment by Miara et al. [lo], however, showed", ["seth-goldstein/CSD-97-975.pdf"] = "Lazy Threads: Compiler and Runtime Structures for\ Fine­Grained Parallel Programming\ by\ Seth Copen Goldstein\ B.S.E. #Princeton University# 198-\ M.S.E. #University of California#Berkeley# 1994\ A dissertation submitted in partial satisfaction of the\ requirements for the degree of\ Doctor of Philosophy\ ", ["todd-proebsting/pldi97.goal.ps"] = "Simple Translation of Goal­Directed Evaluation\ Todd A. Proebsting \\Lambda\ The University of Arizona", ["ole-agesen/gc-points.pdf"] = "GC Points in a Threaded Environment\ Ole Agesen\ GC Points in a Threaded Environment\ Ole Agesen\ SMLI TR-98-70\ December 1998", ["popl/abstract/00001424.pdf"] = "", ["popl/abstract/00001415.pdf"] = "", ["sigplan/2003/pdfs/proceeding/604174/p50-kobayashi.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Time Regions and Effects for Resource Usage Analysis\ Naoki Kobayashi Tokyo Institute of Technology email:kobayasi@cs.titech.ac.jp", ["popl/data/00001511.pdf"] = "A Program\ Development\ Tool\ C. N. Alberga,\ A. L, Browni,\ G. B. Leeman,\ Jr.,\ M. Mikelsons,\ and M. N. Wegman\ Computer IBM Thomas", ["benjamin-pierce/woggles.ps.gz"] = "Woggles from Oz:\ Writing Interactive Fiction\ (Full Version)\ Benjamin C. Pierce \\Lambda\ November 16, 1993\ A summary of this article will appear in the reviews section of Leonardo: Journal\ of the International Society for the Arts, Sciences, and Technology, 1994.\ The term ``interactive fiction'' describes any artifact --- book, theater script, image, auto­\ maton, or computer program --- allowing a reader to make choices that determine the un­\ folding of a story. An ordinary book or movie is not interactive in this sense: it has a static,", ["sigplan/2003/pdfs/proceeding/781131/p232-condit.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ CCured in the Real World\ Jeremy Condit Matthew Harren Scott McPeak George C. Necula University of California, Berkeley\ {jcondit,matth,smcpeak,necula,weimer}@cs.berkeley.edu \ Westley Weimer", ["chris-van-wyk/p583-van_wyk.pdf"] = "li\ te\ rat\ e\ M\ o\ d\ e\ r\ ", ["popl/data/00001708.pdf"] = "SPECIFYING A Tutorial\ PROGRAMMING and Critique\ LANGUAGE by Hoare\ SEMANTICS: and Lauer\ of a Paper by\ 1. Gretf Massachusetts\ and A. Meyer Institute of Technology\ Cambridge,\ Massachusetts\ 1, Introduction", ["sigplan/2003/pdfs/proceeding/604174/p62-calcagno.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Deciding Validity in a Spatial Logic for Trees\ Cristiano Calcagno\ Queen Mary, University of London\ Luca Cardelli\ Microsoft Research\ Andrew D. Gordon", ["sigplan/2003/pdfs/topl/641888/p225-b_bruce.pdf"] = "Main TOC\ Transactions TOC\ Search\ PolyTOIL: A Type-Safe Polymorphic Object-Oriented Language\ KIM B. BRUCE, ANGELA SCHUETT and ROBERT VAN GENT Williams College and ADRIAN FIECH Memorial University of Newfoundland\ PolyTOIL is a new statically typed polymorphic object-oriented programming language that is provably typesafe. By separating the definitions of subtyping and inheritance, providing a name for the type of self, and carefully defining the type-checking rules, we have obtained a language that is very expressive while supporting modular type-checking of classes. The matching relation on types, which is related to F-bounded quantification, is used both in stating type-checking rules and expressing the bounds on type parameters for polymorphism. The design of PolyTOIL is based on a careful formal definition of type-checking rules and semantics. A proof of type safety is obtained with the aid of a subject reduction theorem. Categories and Subject Descriptors: D.3.3 [Programming Languages]: Language Constructs and Features--classes and objects, constraints, inheritance, polymorphism; D.3.1 [Programming Languages]: Formal Definitions and Theory--semantics; D.3.2 [Programming Languages]: Language Classifications--objecct-oriented languages; F.3.2 [Logics and Meanings of Programs]: Semantics of Programming Languages--operational semantics; F.3.3 [Logics and Meanings of Programs]: Studies of Program Constructs--object-oriented constructs General Terms: Design, Language, Theory Additional Key Words and Phrases: Matching, hash type\ 1. INTRODUCTION Because of the complexity of object-oriented languages, it has proven to be very difficult to design type-safe statically typed object-oriented languages that are also very expressive. At one extreme we have statically typed languages like", ["benjamin-pierce/tapat.ps.bz2"] = "Regular Expression Pattern Matching for XML\ Haruo Hosoya Benjamin Pierce\ Department of Computer and Information Science\ University of Pennsylvania\ fhahosoya,bcpierceg@cis.upenn.edu\ ", ["popl/data/00001557.pdf"] = "On\ Effective\ Axiofnatizations\ of Hoare\ Logics\ Edmund\ M. Clarke,\ Jr.l, Steven M. Germanl'3,\ and Joseph Y. Halpernl'2\ 1. Aiken Computation Laboratory, Harvard University, Cambridgg", ["popl/abstract/00001500.pdf"] = "", ["benjamin-pierce/attapl.pdf"] = "\ 999 9999 9999 9999 9999 9999 9999 9999 9999 9999 \ ñ·ø›ó·\   \ \r\ \r\  ! \"#$ \"%\ % &'#\ ()'#$* #\ + -, &%( /.10&! & \" 32 \r!54  ", ["phil-wadler/views.pdf"] = "V\ i\ e\ w\ s\ :\ A\ w\ a\ ", ["norman-ramsey/mdesc.dvi"] = "", ["sigplan/2003/pdfs/proceeding/949305/p313-marinov.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Object Equality Profiling\ Darko Marinov\ MIT Lab for Computer Science\ Robert O'Callahan\ IBM T. J. Watson Research Center\ marinov@lcs.mit.edu", ["sigplan/2003/pdfs/proceeding/781498/p84-bronevetsky.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Automated Application-level Checkpointing of MPI Programs\ Greg Bronevetsky, Daniel Marques, Keshav Pingali, Paul Stodghill Department of Computer Science, Cornell University, Ithaca, NY 14853", ["john-hughes/lists.djvu"] = "", ["xavier-leroy/exceptions-toplas.ps.gz"] = "Type-based analysis of uncaught exceptions\ XAVIER LEROY and FRANCOIS PESSAUX\ INRIA Rocquencourt\ This paper presents a program analysis to estimate uncaught exceptions in ML programs. This\ analysis relies on uni cation-based type inference in a non-standard type system, using rows to\ approximate both the \row of escaping exceptions (a la e ect systems) and the \row of result values\ (a la control-\row analyses). The resulting analysis is eÆcient and precise; in particular, arguments\ carried by exceptions are accurately handled.\ Categories and Subject Descriptors: F.3.2 [Logics and Meanings of Programs]: Semantics of\ Programming Languages|Program analysis; Operational semantics; F.3.3 [Logics and Mean-", ["popl/data/00001685.pdf"] = "FOREWORD\ The papers on Principles SIGPLAN. response thank all The and several research. more It of These to the\ in\ this\ volume\ were\ presented\ at\ the\ Third", ["ian-witten/p256-moffat.pdf"] = "Arithmetic Coding Revisited\ ALISTAIR MOFFAT\ The University of Melbourne\ RADFORD M. NEAL\ University of Toronto\ and\ IAN H. WITTEN\ The University of Waikato\ Over the last decade, arithmetic coding has emerged as an important compression tool. It is\ ", ["popl/abstract/00001513.pdf"] = "", ["popl/abstract/00001412.pdf"] = "", ["norman-ramsey/mllike.ps"] = "Using an ML­Like Language to Specify the\ Semantics of Machine Instructions\ Norman Ramsey\ Department of Computer Science\ University of Virginia\ Charlottesville, VA --903\ nr@cs.virginia.edu\ July -4, 1998\ ", ["popl/abstract/00001540.pdf"] = "", ["norman-ramsey/maniaj.ps"] = "Under consideration for publication in J. Functional Programming 1\ MODULAR PEARL\ ML Module Mania:\ A Type­Safe, Separately Compiled,\ Extensible Interpreter\ Norman Ramsey\ Division of Engineering and Applied Sciences\ Harvard University\ ", ["jan-jansen/janj2006-TFP06-EfficientInterpretation.pdf"] = "Efficient Interpretation by Transforming Data Types and\ Patterns to Functions\ Jan Martin Jansen ?1 , Pieter Koopman - , Rinus Plasmeijer -\ 1 The Netherlands Ministry of Defence,\ - Institute for Computing and Information Sciences (ICIS),\ Radboud University Nijmegen, the Netherlands.\ j.m.jansen@forcevision.nl, {pieter,rinus}@cs.ru.nl\ ", ["popl/abstract/00001536.pdf"] = "", ["rob-pike/conc-win.ps"] = "A Concurrent Window System\ Rob Pike\ AT&T Bell Laboratories\ Murray Hill, New Jersey 07974\ ", ["popl/abstract/00001719.pdf"] = "", ["robin-milner/elements.pdf"] = "I\ a\ m\ g\ r\ e\ a\ t\ l\ ", ["pierce/TR507.ps.Z"] = "What is a File Synchronizer?\ S. Balasubramaniam\ Indiana University\ sbalasub@cs.indiana.edu\ Benjamin C. Pierce\ Indiana University\ pierce@cs.indiana.edu\ Indiana University\ CSCI Technical Report #-07\ ", ["sigplan/2003/pdfs/proceeding/777388/index.pdf"] = "Main TOC\ Newsletter TOC\ Search\ PEPM '03: The 2003 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation San Diego, California, USA June 7, 2003", ["paul-hudak/jfp.ps.gz"] = "Haskell vs. Ada vs. C++ vs. Awk vs. ...\ An Experiment in Software Prototyping Productivity -Lambda\ Paul Hudak\ Mark P. Jones\ Yale University\ Department of Computer Science\ New Haven, CT 06-18\ fhudak­paul,jones­markg@cs.yale.edu\ July 4, 1994\ ", ["sigplan/2003/pdfs/sigp/885638/p6-christopher.pdf"] = "Main TOC\ Newsletter TOC\ Search\ ACM\ SIGPLAN In Parallel\ Totally Message Driven Computation\ Editor: Thomas W. Christopher, P.O. Box 6335, Evanston, IL 60204-6335 ; tc@toolsofcomputing.com\ A Simple Parallel System\ Thomas W. Christopher\ In this and subsequent columns, we will consider a completely message driven system, which we call AMDC, for \"Active-Message-Driven Computing.\" Parallel computing really ought to be different from serial computing. In serial computing, the process provides both data and control. In a parallel computer, even if it is a network of conventional computers, data and control are provided more by messages. Messages contain data, and the arrival of a message triggers computation, so it might make more sense to base the entire computation on message passing. So where does this insight lead? Can we design and implement such a system? Can we program in it? One possibility is some sort of communicating reactive object system such as Actors (Agha 1986) or Cantor (Athas 1987): objects send each other messages and only perform computations as a result of messages arriving. (We discussed reactive object systems in an earlier column: \"Communicating Reactive Objects.\") One particularly clean design is Actors. Here is the basic design: The system contains a varying collection of actors. Each actor is a mailbox with an associated \"behavior\" script and \"acquaintance list\" containing local data. When a message arrives at a mailbox, the behavior is executed, being passed the message and the acquaintance list. Beyond the usual arithmetic and such, the behavior can do three things: it can send messages to its own or other actors' mailboxes, it can create new actors providing the initial behavior and acquaintance list, and it can \"become\" a different actor by changing its script and/or acquaintance list. One nice thing about actors is how easy they are to implement. Mailboxes and messages form simple linked data structures. The behavior can be a function pointer. The acquaintance list can be an array or a struct. With object-oriented programming, of course, the behavior would be a method in an object whose fields comprise the acquaintance list. A scheduler can run through a list of mailboxes with waiting messages calling the behaviors. Simple locking allows multiple processors to run behaviors. An Actors system can be created with apparently only a tiny amount of programming. Other reactive object systems are similar to this version of actors. Those systems have some problems, though. One problem is aesthetic: the reactive objects are not messages, so the systems violate the goal of totally-messagedriven computing. Another problem is practical: Reactive object systems are almost unprogrammable. The reactive objects (or mailboxes) are accessible by pointer, which makes the implementation of arrays problematic. Either you need to represent arrays of objects with some linked structure such as a search tree, or you need to pass around an array of pointers. The first alternative wastes time and results in the root of the structure being flooded with messages when the program is performing array operations. The second wastes too much space. Methods in other objects are called by sending a call message to the other object and receiving a return message. If the reactive objects must process their input queues sequentially, there is a problem with a server calling a method in another object: The return message from the call may be later on the input queue than some pending requests. The requests cannot be processed until the return message is received, and the return message cannot be received until the requests ahead of it on the queue are processed. Creating objects on other nodes of a network has the same problems as calling remote methods. An object would send a message requesting the allocation and wait for a response message to bring back the pointer to the newly created object. Unfortunately, it has more problems than needing to look ahead on an input queue: if the behavior blocks until the response comes back, and if the behavior is being executed as a subroutine of the scheduler, the scheduler blocks. Good performance requires several scheduler threads. Reactive object systems provide an inspiration for the totally message-driven system we are considering here. We want to overcome their problems while preserving", ["gerard-holzmann/dobbs97.pdf"] = "Reliable Design of Concurrent Software\ Gerard J. Holzmann\ Computing Principles Research Department\ Bell Laboratories -C­--1, Murray Hill, NJ 07974, USA\ Email: gerard@research.bell­labs.com\ ", ["norman-ramsey/sync.dvi"] = "", ["popl/abstract/00001398.pdf"] = "", ["conor-mcbride/notanum.pdf"] = "I am not a number: I am a free variable\ Conor McBride and James McKinna\ June 8, -004\ ", ["sigplan/2003/pdfs/proceeding/604174/p86-amtoft.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Inferring Annotated Types for Inter-procedural Register Allocation with Constructor Flattening\ Torben Amtoft§\ Kansas State University\ Robert Muller¶\ Boston College\ tamtoft@cis.ksu.edu", ["luca-cardelli/bioware.pdf"] = "Bioware Languages\ Luca Cardelli\ Microsoft Research\ Reflecting joint work with Ehud Shapiro and Aviv Regev,\ Weizmann Institute of Science.\ Introduction\ This work can be seen as example of an emerging class of languages for describing, and\ possibly programming, biological systems (bioware). A living cell is, to a rather\ surprising extent, an information processing device 1. One can envision describing\ ", ["norman-ramsey/blocks.pdf"] = "Declarative Composition of Stack Frames\ Christian Lindig1 and Norman Ramsey2\ 1\ Universit¨t des Saarlandes, 66 123 Saarbr¨cken, Germany a u lindig@cs.uni-sb.de 2 Division of Engineering and Applied Sciences Harvard University, Cambridge, MA 02138, USA nr@eecs.harvard.edu", ["sigplan/2003/pdfs/proceeding/774833/p133-mu.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Interactive Locality Optimization on NUMA Architectures\ Tao Mu Jie Tao , Lehrstuhl f¨ r Rechnertechnik und Rechnerorganisation u Department of Informatics Technische Universit¨ t M¨ nchen au Martin Schulz Sally A. McKee§ , Computer Systems Laboratory School of Electrical and Computer Engineering Cornell University", ["popl/abstract/00001541.pdf"] = "", ["norman-ramsey/recognizer.dvi"] = " To appear in the 15th International Conference on Compiler Construction\ Converting Intermediate Code to Assembly Code\ Using Declarative Machine Descriptions\ Jo\"ao Dias and Norman Ramsey\ Division of Engineering and Applied Sciences\ Harvard University", ["jack-davidson/p20-milner-new.ps"] = " \ \ \ \ \ \ \ \ \ ", ["popl/abstract/00001639.pdf"] = "", ["sigplan/2003/pdfs/proceeding/944705/p239-hughes.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Polish Parsers, Step by Step\ R. John M. Hughes\ Computing Science Chalmers University of Technology SE-412 96 Gøteborg, Sweden\ S. Doaitse Swierstra\ Institute of Information and Computing Sciences Utrecht University P.O. Box 80.089 3508 TB Utrecht, the Netherlands\ rjmh@cs.chalmers.se", ["kent-dybvig/Call-1cc-PLDI96.ps"] = "Representing Control in the Presence of\ One­Shot Continuations -Lambda\ Carl Bruggeman Oscar Waddell R. Kent Dybvig\ Indiana University Computer Science Department\ Lindley Hall -1-\ Bloomington, Indiana 4740-\ fbruggema,owaddell,dybg@cs.indiana.edu\ ", ["sigplan/2003/pdfs/sigp/966051/frontmatter.pdf"] = "Main TOC\ Newsletter TOC\ Search\ ACM\ SIGPLAN Notices\ 1 2 3 7 8 9 11 17 18 20 28\ Table of Contents\ Editor: Jay Fenwick and Cindy Norris, Department of Computer Science, Appalachian State University; sigplan@cs.appstate.edu\ Activities\ Executive Committee October Meeting Report by Michael Burke Letter from the Editors", ["sigplan/2003/pdfs/proceeding/888251/backmatter.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Author Index\ Ager, M. S. .........................................................8 Antoy, S............................................................20 Appel, A. W....................................................264 Banyasad, O......................................................44 Biernacki, D........................................................8 Blanchet, B. ........................................................1 Brassel, B. ........................................................20 Cameron, M......................................................56 Cox, P. T...........................................................44 Dal Palù, A. ....................................................219 Damiani, F. .......................................................67 Danvy, O. ...........................................................8 de la Encina, A. ..............................................102 del Vado Vírseda, R. ......................................253 Dovier, A. .......................................................219 Duck, G. J.........................................................79 Echahed, R........................................................91 Escobar, S.......................................................113 Fissore, O. ......................................................124 García de la Banda, M. .........................32, 56, 79 Gnaedig, I. ......................................................124 Greco, S..........................................................136 Hamana, M. ....................................................148 Hanus, M. .........................................................20 Hirschowitz, T. ...............................................160 Holzbaur, C. .....................................................79 Kirchner, H.....................................................124 Krukow, K. .........................................................4 Leroy, X..........................................................160 Liu, Y. A.........................................................172 Marriott, K........................................................56 Miculan, M. ....................................................184 Midtgaard, J........................................................8 Moulder, P. .......................................................56 Nadathur, G. ...................................................195 Naish, L. .........................................................230 Nanevski, A. ...................................................207 Nielsen, M. .........................................................4 Peña, R............................................................102 Pontelli, E. ......................................................219 Pope, B. ..........................................................230 Prost, F..............................................................91 Qi, X. ..............................................................195 Rossberg, A. ...................................................241 Rossi, G. .........................................................219 Sato, T. ...........................................................275 Scagnetto, I. ....................................................184 Serwe, W. .........................................................91 Stoller, S. D. ...................................................172 Stuckey, P. J. ..............................................32, 79 Stump, A.........................................................264 Wazny, J. ..........................................................32 Wells, J. B.......................................................160 Wu, D. ............................................................264 Zhou, N.-F. .....................................................275 Zumpano, E. ...................................................136\ 284", ["popl/data/00001399.pdf"] = "AN ALGEBRAIC\ MODEL\ FOR STRING\ PATTERNS\ I.P.\ GLENN F. STEWART SHARP ASSOCIATES LIMITED 145 King Street West Torontor Ontario Canada 1. Introduction\ A great deal has been learned about programming and programming during the past ten years. The concepts of structure, protection and having profound effects on the way languages are designed. Unfortunately, progression from FORTRAN to PASCAL and SIMULA and beyond has no parallel development of string manipulation languages.", ["popl/abstract/00001539.pdf"] = "", ["popl/abstract/00001502.pdf"] = "", ["sigplan/2003/pdfs/proceeding/780732/p171-alur.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Generating Embedded Software from Hierarchical Hybrid Models\ Rajeev Alur, Franjo Ivan i´ , Jesung Kim, Insup Lee and Oleg Sokolsky cc Department of Computer and Information Science University of Pennsylvania", ["norman-ramsey/delenda/eng.dvi"] = " Staged Allocation: Engineering the Specification and\ Implementation of Procedure Calling Conventions\ Reuben Olinsky Christian Lindig Norman Ramsey\ Division of Engineering and Applied Sciences\ Harvard University\ folinsky ; lindig ; nr g@eecs.harvard.edu", ["popl/abstract/00001435.pdf"] = "", ["popl/abstract/00001699.pdf"] = "", ["jack-davidson/portable.djvu"] = "A Portable Global Optimizer and Linker? \ Manuel E. Benitez \ Jack W. Davidson \ Department of Computer Science \ University of Virginia \ Charlottesville, VA 22903 ", ["gordon-cormack/micro-kernel.djvu"] = "", ["sigplan/2003/pdfs/proceeding/949305/p302-fahndrich.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Declaring and Checking Non-null Types in an Object-Oriented Language\ Manuel Fahndrich ¨ K. Rustan M. Leino\ Microsoft Research One Microsoft Way Redmond, WA 98052, USA\ {maf,leino}@microsoft.com", ["sigplan/2003/pdfs/topl/596980/p70-rugina.pdf"] = "Main TOC\ Transactions TOC\ Search\ Pointer Analysis for Structured Parallel Programs\ RADU RUGINA Cornell University and MARTIN C. RINARD Massachusetts Institute of Technology\ This paper presents a novel interprocedural, flow-sensitive, and context-sensitive pointer analysis algorithm for multithreaded programs that may concurrently update shared pointers. The algorithm is designed to handle programs with structured parallel constructs, including fork-join constructs, parallel loops, and conditionally spawned threads. For each pointer and each program point, the algorithm computes a conservative approximation of the memory locations to which that pointer may point. The algorithm correctly handles a wide range of programming language constructs, including recursive functions, recursively generated parallelism, function pointers, structures, arrays, nested structures and arrays, pointer arithmetic, casts between different pointer types, heap and stack allocated memory, shared global variables, and thread-private global variables. We have implemented the algorithm in the SUIF compiler system and used the implementation to analyze a set of multithreaded programs written in the Cilk programming language. Our experimental results show that the analysis has good precision and converges quickly for our set of Cilk programs. Categories and Subject Descriptors: F.3.2 [Logics and Meanings of Programs]: Semantics of Programming Languages--Program analysis; D.3.2 [Programming Languages]: Language Classifications--Concurrent, distributed, and parallel languages General Terms: Analysis, Languages Additional Key Words and Phrases: Pointer analysis\ 1. INTRODUCTION The use of multiple threads of control is quickly becoming a mainstream programming practice. Programmers use multiple threads for many reasons--", ["popl/abstract/00001715.pdf"] = "", ["john-reppy/conc93.ps"] = "Concurrent ML:\ Design, Application and Semantics\ John H. Reppy\ Department of Computer Science\ Cornell University ?\ 1 Introduction\ Concurrent ML (CML) is a high­level, high­performance language for concurrent\ programming. It is an extension of Standard ML (SML) MTH90, and is imple­\ mented on top of Standard ML of New Jersey (SML/NJ) AM87. CML is a\ ", ["popl/data/00001628.pdf"] = ".\ Reasoning\ About\ Nonatomic\ Operations\ `\ Computer\ Leslie Lamport Science Laboratory\ SRI International", ["popl/data/00001717.pdf"] = "SYSTEMATIC\ DESIGN OF PROGRAM ANALYSIS\ FRAMEWORKS\ Patrick\ Cousot*\ and Radhia\ Cousot**\ Laboratoire d'Informatique,U.S,M.G. , BP.53X 38041 Grenoble cedex, France\ 1.\ INTRODUCTION", ["popl/abstract/00001451.pdf"] = "", ["jim-plank/CS-99-416.ps.Z"] = "", ["sigplan/2003/pdfs/proceeding/781131/p289-lin.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ A Compiler Framework for Speculative Analysis and Optimizations\ Jin Lin Tong Chen Wei-Chung Hsu Pen-Chung Yew Roy Dz-Ching Ju Tin-Fook Ngai Sun Chan\ Microprocessor Research Lab. Intel Corporation Santa Clara, CA 95052 U.S.A Department of Computer Science and Engineering University of Minnesota Minneapolis, MN 55455 U.S.A", ["sigplan/2003/pdfs/proceeding/780732/p284-aboughazaleh.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Energy Management for Real-Time Embedded Applications with Compiler Support", ["maurice-herlihy/p124-herlihy.pdf"] = "W\ ai\ t\ ­\ Fr\ e\ e\ S\ y\ ", ["popl/data/00001498.pdf"] = "THEORETICAL\ AND EMPIRICAL\ STUDIES\ ON USING\ PROGRAM MUTATION\ TO TEST Timothy Richard J. A.\ THE FUNCTIONAL (Yale), (Berkeley)\ CORRECTNESS A. DeMillo\ OF PROGRAMS (Georgia G. Sayward Tech), (Yale)\ Budd", ["popl/abstract/00001628.pdf"] = "", ["popl/abstract/00001433.pdf"] = "", ["popl/data/00001432.pdf"] = "APPLICATI\ CNS OF A GRAPH CONTROL\ GRAMMAR FOR\ PRCKXAM\ FLCW ANALYSIS\ Ken Kennedy;C Linda Dept. of Zucconi;: Sciences 77001\ Mathematical Rice University Houston, Texas\ I.\ Introduction ------\ structure for the purpose of code optimization is to A standard approach to the analysis of program Various execution paths through the program. construct the \"control flow graph\" which models the possible graph to produce data flow information, possible optigraph algorithms can be applied to the control flow --Studies of the form-of typical [A1,A2,AC:AU2,AU3,CS ,HUl,HU2.HU3,Kel~Ke2,Ke3,Ke4,Sc,U] . mizations, etc. control flow graphs indicate that such graphs tend to fall into a restricted subclass of general graphs. For example, empirical investigations have shown tha'c the vast majority of program graphs have no multipleentry loops [AC,HU2,HU3,Knl]. programming\" has suggested that \"good\" programs fall into an even more The recent work on \"structured In fact, purists recommend that all programs be synthesized from three basic control restricted subclass. and single-entry single-exit loops [Di,Wi]. if-then-else statements, structures : sequential statements, language theory [Hou] has given us a practical way to specify the set of strings which comFormal It is then a natural idea to extend grammars from the strings to prise a given language: via a grammar. Several researchers have used this approach graphs in hopes of getting the same power of expression. [FKZ,J2,RO]. In this paper we study the applicability of a grammatical approach to describing the set of control programs in the sense proposed by many programming practitioners. The flow graphs which arise from \"good\" flow graph language contains all those programs constructed according to the purists' rules and resulting also admits ~rograms with multiple-exit loops if such loops are constructed sensibly. The grammar we use is the ll~emi.structured flow graph\" gra~ar GSsFG which was studied originally in [FKZ]. There are perhaps the most important, from the point-of-view of a several appealing properties of this grammar; compiler-writer, is the existence of a linear-time parsing algorithm which leads directly to a linear-time data flow analysis method [FKZ]. First, In the present work we summarize the results from [FKZI and address several new questions. how often do programs written by people with no knowledge of the SSFG rules fall into the language defined once a program has been Second, In other words, is the language a natural one for programming? by GssFG? parsed according The paper is to Gs~FG do benefits into three other main than fast data flow II analysis introduces accrue? GssFG and the parsing algoto", ["popl/data/00001430.pdf"] = "GENERALIZED\ CONMON SUBEXPRESSIONS\ IN\ VERY\ HIGH\ LEVEL\ LANGUAGES*\ Amelia Department University Toronto, Canada of\ C. of\ Fong Science Torcinto IA?", ["popl/data/00001481.pdf"] = "An Overview\ of\ the\ SUMMER Programming\ Language\ Paul Mathematisch The\ Klint Centrum\ Netherlands", ["uwe-nestmann/choice.ps.gz"] = "Decoding Choice Encodings -Lambda\ Uwe Nestmann y Benjamin C. Pierce z\ April 1996\ ", ["popl/data/00001373.pdf"] = "Advice --\ on .\ Structuring\ Compilers\ and\ Proving\ Them\ Correct\ t\ F.", ["popl/abstract/00001651.pdf"] = "", ["sigplan/2003/pdfs/sigp/944579/p44-hericko.pdf"] = "Main TOC\ Newsletter TOC\ Search\ Object Serialization Analysis and Comparison in Java and .NET\ Marjan Hericko, Matjaz B. Juric, Ivan Rozman, Simon Beloglavec, Ales Zivkovic University of Maribor, FERI, Institute of Informatics, Smetanova 17, SI-2000 Maribor E-mail: marjan.hericko@uni-mb.si", ["benjamin-pierce/modules-icfp.ps.bz2"] = "Advanced\ Module\ Systems\ (A\ Guide\ for\ the\ Perplexed)\ Benjamin\ ", ["brian-kernighan/tcl-exp.ps.gz"] = "Experience with Tcl/Tk for Scientific and Engineering Visualization\ Brian W. Kernighan\ AT&T Bell Laboratories\ Murray Hill, New Jersey 07974\ bwk@research.att.com\ ", ["stephen-gilmore/fengshui.ps.gz"] = "Feng Shui for Standard ML Programmers\ Stephen Gilmore\ LFCS, Edinburgh\ Abstract. Feng Shui is an ancient knowledge which provides instruc­\ tion about the importance of order and harmony in living. Programmers\ working with sophisticated programming languages such as Standard ML\ want to achieve correctness (order) in programs. However, they also need\ to engineer trade­offs (harmony) between elegance and efficiency; time\ and space; generality and specialisation; encapsulation and re­use; and\ ", ["popl/data/00001368.pdf"] = "MATHEMATICAL\ SEMANTICS\ OF SNOBOL4\ Tennent R.D. Department of Computing and Information Science Queen's University Kingston, Ontario", ["matthew-flatt/kill-safe.pdf"] = "Kill­Safe Synchronization Abstractions\ ``Well, it just so happens that your friend here is only mostly dead.\ There's a big difference between mostly dead and all dead.''\ -- Miracle Max in The Princess Bride\ Matthew Flatt\ University of Utah\ Robert Bruce Findler\ University of Chicago\ ", ["greg-morrisett/fpca_gc.ps.gz"] = "Abstract Models of Memory Management -Lambda\ Greg Morrisett Matthias Felleisen Robert Harper\ Carnegie Mellon Rice University Carnegie Mellon\ jgmorris@cs.cmu.edu matthias@cs.rice.edu rwh@cs.cmu.edu\ ", ["bob-harper/tic98.ps"] = "How Generic is a Generic Back End?\ Using MLRISC as a Back End for the TIL\ Compiler ?\ (Preliminary Report)\ Andrew Bernard ?? , Robert Harper, and Peter Lee\ School of Computer Science\ Carnegie Mellon University\ Pittsburgh, PA 1--13\ Abstract. We describe the integration of MLRISC, a ``generic'' com­\ ", ["popl/abstract/00001495.pdf"] = "", ["dale-parson/dsl99talk.pdf"] = "D. Parson, Lucent Technologies, 8/3/99 -nd Conference on Domain­Specific Languages p. 1\ Using Java Reflection to Automate\ Extension Language Parsing\ -nd Conference on Domain­Specific Languages\ Dale Parson\ Bell Laboratories / Lucent Technologies\ dparson@lucent.com\ \ D. Parson, Lucent Technologies, 8/3/99 -nd Conference on Domain­Specific Languages p. -\ ", ["manuel-benitez/portable.djvu"] = "A Portable Global Optimizer and Linker? \ Manuel E. Benitez \ Jack W. Davidson \ Department of Computer Science \ University of Virginia \ Charlottesville, VA 22903 ", ["norman-ramsey/r.ps"] = "Submitted to the ACM SIGPLAN '04 Conference on Programming Language Design and Implementation\ A Generalized Algorithm\ for Graph Coloring Register Allocation\ Michael D. Smith, Norman Ramsey, and Glenn Holloway\ Harvard University\ {smith,nr,holloway}@eecs.harvard.edu\ ", ["popl/abstract/00001523.pdf"] = "", ["sigplan/2003/pdfs/proceeding/888251/p79-duck.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Extending Arbitrary Solvers with Constraint Handling Rules\ Gregory J. Duck Peter J. Stuckey\ Dept. of Computer Science and Software Engineering University of Melbourne, 3010 Australia\ {gjd,pjs}@cs.mu.oz.au\ Maria Garcia de la Banda\ School of Computer Science and Software Engineering Monash University, 3800 Australia\ Christian Holzbaur,", ["luca-cardelli/TypeType.ps"] = "Page 1\ A Polymorphic l­calculus with Type:Type\ Luca Cardelli\ Digital Equipment Corporation\ Systems Research Center\ 130 Lytton Avenue, Palo Alto, CA 94301\ SRC Research Report 10, May 1, 1986.\ © Digital Equipment Corporation 1986.\ This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without\ ", ["greg-morrisett/jgmorris-ppopp.ps.gz"] = "13 E. C. Cooper and J. G. Morrisett. Adding threads\ to Standard ML. Technical Report CMU­CS­90­186,\ School of Computer Science, Carnegie Mellon Univer­\ sity, Dec. 1990.\ 14 W. P. Crowley, C. P. Hendrickson, and T. E. Rudy.\ The SIMPLE code. Technical Report UCID 1771-,\ Lawrence Livermore Laboratory, Livermore, CA, Feb.\ 1978.\ 1- T. W. Doeppner Jr. Threads: A system for the support\ ", ["olivier-danvy/danvy92representing.ps.gz"] = "Math. Struct. in Comp. Science (199-), vol. -, pp. 361--391. PREPRINT\ Representing control:\ a study of the CPS transformation\ OL I V I ER DANVY 1y and ANDRZEJ F I L I N SK I -\ 1 Department of Computing and Information Sciences, Kansas State University, Manhattan,\ Kansas 66-06, USA. (danvy@cis.ksu.edu)\ - School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania 1--13, USA.\ (Andrzej.Filinski@cs.cmu.edu)\ Received February 1991; Revised June 199-\ ", ["abdulaziz-ghuloum/incremental.pdf"] = "An Incremental Approach to Compiler Construction\ Abdulaziz Ghuloum\ Department of Computer Science, Indiana University, Bloomington, IN 47408 aghuloum@cs.indiana.edu", ["popl/data/00001476.pdf"] = "Conference\ Record\ of\ the\ Fifth\ Annual\ ACM\ Symposium\ on\ Principles", ["popl/data/00001437.pdf"] = "IMPLEMENTATION\ OF AN ARRAY\ BOUND\ CHECKER\ *\ Norihisa Department Carnegie-Mellon Pittsburgh,\ Suzuki Science University Pa. 15213 and\ of Computer\ Kiyoshi Department University Tokyo,\ Ish ihata Science of Tokyo Japan", ["wilson-hsieh/logical-disk.pdf"] = "Separating these two concerns has three advantages.\ First, it leads to a file system structure that makes file sys­\ tems easier to develop, maintain, and modify. Second, it\ makes file systems more flexible. Different implementations\ of LD can be tailored for different access patterns and dif­\ ferent disks can run under different implementations of LD.\ Similarly, different file systems can all share a particular LD\ implementation. Third, it allows for efficient solutions to the\ I/O bottleneck Ousterhout and Douglis 1989; Ousterhout\ ", ["popl/abstract/00001544.pdf"] = "", ["popl/abstract/00001422.pdf"] = "", ["popl/abstract/00001473.pdf"] = "", ["popl/abstract/00001472.pdf"] = "", ["popl/abstract/00001470.pdf"] = "", ["craig-chambers/pldi03.ps"] = "Automatically Proving the Correctness of\ Compiler Optimizations\ Sorin Lerner Todd Millstein Craig Chambers\ Department of Computer Science and Engineering\ University of Washington\ flerns,todd,chambersg@cs.washington.edu\ ", ["john-levine/linker12.ps.gz"] = "References 1\ References\ $Revision: 1.- $\ $Date: 1999/0-/1- 07:09:19 $\ IBM, MVS/ESA Linkage Editor and Loader User's Guide, Order number\ SC-6­4-10, 1991. Also available as http://www.ibm.com/\ AT&T, System V Application Binary Interface, UNIX Press/Prentice Hall,\ ISBN 0­13­877-98­-, 1990.\ AT&T, System V ABI Motorola 68000 Processor Family Supplement,\ ", ["popl/abstract/00001690.pdf"] = "", ["phil-wadler/essence.dvi"] = "\ \ The essence of functional programming\ Philip Wadler, University of Glasgow*\ \ \ ", ["popl/abstract/00001641.pdf"] = "", ["popl/data/00001637.pdf"] = "\"SOMETIMES\" AND \"NOT NEVER\" REVISITED: ON BRANCHING VERSUS LINEAR TIME\ (PRELIMINARY E. 1. Computer Allen Emersonl and REPORT) Joseph Y. Halpern2 TX 78712\ Sciences Department, University 2. IBM Research Laboratory, San\ of Texas, Austin, Jose, CA 95193\ 1.\ INTRODUCTION Temporal logic describing iS suitable (cf. there underlying linear: future. tree-like into possible is chosen, logic we as at The nature: alternate futures. classify either of of are nature each other at ([ PR57], the [PR67]) occurrence for [PN77]). two of moment is reasoning In possible time. there thst each time moment, representing upon a which system in is based time logic the time, provides of events about a\ temporal events\ operators along in reflect quantification a single a\ are time logic the\ provided path of (cf.", ["sigplan/2003/pdfs/proceeding/949305/backmatter.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Author Index\ Allen, E.............................................................96 Azatchi, H.......................................................269 Bacon, D. F.....................................................241 Bannet, J. ..........................................................96 Barabash, K. ...................................................255 Bäumer, D. .......................................................13 Black, A. P........................................................47 Blackburn, S. M..............................................344 Boyapati, C.....................................................403 Cahill, V. ............................................................1 Caromel, D. ......................................................27 Cartwright, R. ...................................................96 Chambers, C. ..........................................205, 224 Chen, G...........................................................282 Clarke, D. .......................................................374 Cointe, P. ..........................................................27 Corwin, J. .......................................................241 De Bosschere, K. ............................................169 Demsky, B. .......................................................78 Diwan, A. .......................................................359 Driesen, K.......................................................149 Ducasse, S. .................................................47, 65 Dufour, B........................................................149 Eeckhout, L. ...................................................169 Fähndrich, M. .................................................302 Fraser, K. ........................................................388 Garcia, R.........................................................115 Georges, A......................................................169 Gohda, O. .......................................................187 Grove, D. ........................................................241 Harris, T. ........................................................388 Hendren, L......................................................149 Hertz, M. ........................................................359 Hirzel, M. .......................................................359 Inagaki, T........................................................187 Irwin, M. J. .....................................................282 Ishizaki, K. .....................................................187 Järvi, J.............................................................115 Kandemir, M. .................................................282 Kawachiya, K. ................................................187 Kawahito, M...................................................187 Kiezun, A..........................................................13 Komatsu, H.....................................................187 Koseki, A........................................................187 Lafferty, D. .........................................................1 LaMarca, A.....................................................205 Lee, K. ............................................................205 Leino, K. R. M................................................302 Levanoni, Y. ...................................................269 Liskov, B. .......................................................403 Lumsdaine, A. ................................................115 Marinov, D. ....................................................313 Mathiske, B.....................................................282 McKinley, K. S...............................................344 Millstein, T. ....................................................224 Moh, C.-H.......................................................403 Moss, J. E. B...................................................326 Mougin, P. ........................................................65 Murthy, C. ......................................................241 Nakatani, T. ....................................................187 Noble, J...........................................................374 Noyé, J..............................................................27 O'Callahan, R. ................................................313 Ogasawara, T..................................................187 Ogata, K..........................................................187 Onodera, T......................................................187 Ossia, Y. .........................................................255 Palsberg, J.......................................................135 Paz, H. ............................................................269 Petrank, E. ..............................................255, 269 Reay, M. .........................................................224 Richman, S. ....................................................403 Richmond, M..................................................374 Rinard, M..........................................................78 Rustan M. Leino, K. .......................................302 Sachindran, N. ................................................326 Schärli, N..........................................................47 Shrira, L..........................................................403 Siek, J. ............................................................115 Suganuma, T...................................................187 Takeuchi, M....................................................187 Tanter, É. .........................................................27 Tip, F. ...............................................................13 Verbrugge, C. .................................................149 Vijaykrishnan, N.............................................282 Vitek, J............................................................135 Willcock, J......................................................115 Wolczko, M. ...................................................282 Yasue, T..........................................................187 Zhao, T. ..........................................................135\ 418", ["sigplan/2003/pdfs/proceeding/871895/p72-stuckey.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Interactive Type Debugging in Haskell\ Peter J. Stuckey\ Department of Computer Science and Software Engineering The University of Melbourne, Vic. 3010, Australia\ Martin Sulzmann\ School of Computing, National University of Singapore S16 Level 5, 3 Science Drive 2, Singapore 117543\ Jeremy Wazny\ Department of Computer Science and Software Engineering University of Melbourne, Vic. 3010, Australia", ["bob-muller/hutr0692.ps"] = "Lecture Notes on Domain Theory \ Robert Muller\ August 31, 1999\ ", ["popl/data/00001705.pdf"] = "CHARACTERIZATION\ AND\ ELIMINATION\ OF REDUNDANCY\ IN\ RECURSIVE\ PROGRAMS*\ Norman Harvard\ H.\ Cohen", ["norman-ramsey/oxform-a4.ps"] = "A Transformational Approach to\ Binary Translation of Delayed Branches\ (4980­word technical summary)\ Norman Ramsey\ Department of Computer Science\ University of Virginia, Charlottesville, VA --903 USA\ nr@cs.virginia.edu\ Cristina Cifuentes\ Department of Computer Science and Electrical Engineering\ ", ["popl/abstract/00001407.pdf"] = "", ["popl/abstract/00001549.pdf"] = "", ["don-knuth/web.dvi"] = " ______________________________________________________________________________________________________________________________*\ *________________\ \ Literate Programming\ \ ______________________________________________________________________________________________________________________________*\ *________________\ \ Donald E. Knuth\ Computer Science Department, Stanford University, Stanford, CA 94305, USA", ["popl/data/00001465.pdf"] = "Conference?\ Record\ of\ the\ Fifth\ Annual\ ACM Symposium\ on\ Principles\ of", ["sigplan/2003/pdfs/proceeding/781498/p119-chu.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Optimizing Data Aggregation for Cluster-based Internet Services", ["sigplan/2003/pdfs/sigp/780822/index.pdf"] = "Main TOC\ Proceedings TOC\ Search\ ACM SIGPLAN Notices Volume 38, Issue 5 (May 2003), Special Issue PLDI '03: The ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation San Diego, California, USA June 9-11, 2003\ Frontmatter (Inside Cover & Copyright Page, Foreword, Table of Contents, Conference Committee, Referees, Other Conference-Related Activities)\ SESSION: Embedded systems\ The nesC language: A holistic approach to networked embedded systems David Gay, Philip Levis, Robert von Behren, Matt Welsh, Eric Brewer, and David Culler Linear analysis and optimization of stream programs Andrew A. Lamb, William Thies, and Saman Amarasinghe Taming the IXP network processor Lal George and Matthias Blume\ SESSION: Power-aware compilation\ The design, implementation, and evaluation of a compiler algorithm for CPU energy reduction Chung-Hsing Hsu and Ulrich Kremer Compile-time dynamic voltage scaling settings: opportunities and limits Fen Xie, Margaret Martonosi, and Sharad Malik\ SESSION: Code optimization I", ["neal-glew/mcrt/Id/Lambda-Barrier.pdf"] = " \ 0 \ 9999 9999 9999 9999 9999 9999 9999 9999 9999 \ í·ø«ï\ ./10243457685:9;/1<>=?5A@:34BC5A34@:DFE(@/13\"2HGHDI0J/JK1LNM\ O 6P ?A@CBED9;*3@?A:: (39?(3@A@6BC@0146(3@AB3D?2,E*F;G(.HI7BJ@A@LK\ MONQPLRCNQSCTCUV7W.XYNQZCRCN\\[\ ]\ QPLRCNQSCTCUV7W.XYNQZCRCN\\[ 34216 10510 \ A@6BC@\ hkaqerCULNQs3^ofFMYfP)fa?UntlRvuwaqr7j?Ulaq`)jmUnS\ xylz){|p}k~7p€&|6ƒ‚lyƒ„?…o…?†\ ‡#ˆ H259?(.Dm2q‰#Š s N_P#aqg‹a?UntlRCN_`)ft`)TCUlflŒ6N_g.sEfd.f5g3s3fgJ`i^ofg3flUla?[ŽŒd3TUnd7jqP)f>d3amUna?[Ž[Qfl[dCUnjo^?Ulaqe#eNQgE^‘[Qaog3^qT3ao^qf", ["popl/data/00001415.pdf"] = "An Algorithm\ for Structuring\ Programs:\ EXTENDED", ["martin-ward/icsm99-t.ps.gz"] = "Assembler to C Migration using the FermaT Transformation System\ M. P. Ward\ Software Migrations Ltd.\ Mountjoy Research Centre\ Stockton Rd.\ Durham, UK\ Martin.Ward@durham.ac.uk\ Phone: 44+(0)191 386 04-0\ Fax: 44+(0)191 374 0936\ ", ["popl/data/00001534.pdf"] = "Optimal\ Code\ for\ Control by\ Structures\ M. University Londonr\ V. of\ S.\ Ramanath Western\ Ontario", ["popl/abstract/00001453.pdf"] = "", ["jack-davidson/code-sel84.ps"] = " \ \ \ \ \ \ \ \ \ ", ["norman-ramsey/icfp99.dvi"] = "", ["joshua-auerbach/RC20718.ps.gz"] = "RC -0718 (0-/0-/97)\ Computer Science\ IBM Research Report\ The Mockingbird System: A Compiler­based Approach to Maximally\ Interoperable Distributed Programming\ Joshua Auerbach, Mark C. Chu­Carroll\ IBM Research Division\ T.J. Watson Research Center\ Yorktown Heights, New York\ ", ["neal-glew/mcrt/Fortress/core-calculus.pdf"] = "A Core Calculus of Metaclasses\ Sam Tobin­Hochstadt Eric Allen\ Sun Microsystems Laboratories\ Burlington MA 01803\ .@sun.com", ["popl/data/00001422.pdf"] = "Procedure Dianne E. Britton, David of\ Referencing Frederick Hanson, C. and\ Environments Druseikis, Richard\ in\ SL5* E. Griswold\ R.\ A.\ Ralph Holmes\ Department\ Computer Tucson,", ["popl/data/00001647.pdf"] = "On the and Program\ Unification", ["sigplan/2003/pdfs/sigp/844091/p47-luo.pdf"] = "Main TOC\ Newsletter TOC\ Search\ A Formal Semantic Definition of DEVIL\ Lei Luo School of Computer Science and Engineering University of Electronic Science and Technology Chengdu 610054 People's Republic of China Email: lluo@uestc.edu.cn Ming-Yuan Zhu Qing-Li Zhang\ CoreTek Systems, Inc. 11th Floor, CEC Building 6 South Zhongguancun Street Beijing 100086 People's Republic of China Email: zhumy@coretek.com.cn", ["guy-steele/ultimate-imp.ps.gz"] = " \ \ \ \ \ \ \ \ \ ", ["sigplan/2003/pdfs/proceeding/781131/p77-stephenson.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Meta Optimization: Improving Compiler Heuristics with Machine Learning\ Mark Stephenson and Saman Amarasinghe\ Massachusetts Institute of Technology Laboratory for Computer Science Cambridge, MA 02139\ {mstephen,\ Martin Martin and Una-May O'Reilly\ Massachusetts Institute of Technology Artificial Intelligence Laboratory Cambridge, MA 02139", ["popl/abstract/00001476.pdf"] = "", ["popl/data/00001697.pdf"] = "THE and The\ EVOLUTION Need for\ OF LIST-COPYING Structured Program\ ALGORITHMS Verification\ Stanley Computer University Berkeley Science of CA\ Lee* Division California 94720\ Willem Computer\ P.\ deRoever* Division of California CA 94720\ **", ["sigplan/2003/pdfs/topl/937563/index.pdf"] = "Main TOC\ Search\ ACM Transactions on Programming Languages and Systems (TOPLAS) Volume 25, Issue 5 (September 2003)", ["jay-lepreau/typesafety.ps.gz"] = "International Conference on\ Computer Systems and Education, IISc, Bangalore, 1994\ Type­safe Composition of Object Modules -Lambda\ Guruduth Banavar, Gary Lindstrom, Douglas Orr\ Department of Computer Science, University of Utah\ Salt Lake City, Utah 8411- USA\ ", ["simon-peyton-jones/imp-except.ps.gz"] = "A semantics for imprecise exceptions\ Simon Peyton Jones\ Microsoft Research Ltd, Cambridge\ simonpj@microsoft.com\ Alastair Reid\ Yale University\ reid­alastair@cs.yale.edu\ Tony Hoare ff\ Cambridge University Computer Laboratory\ ", ["olin-shivers/msort.ps"] = "A simple and efficient\ natural merge sort \ Olin Shivers\ Georgia Institute of Technology\ March 31, -00-\ ", ["popl/abstract/00001538.pdf"] = "", ["craig-chambers/popl02-dataflow.ps"] = "Composing Dataflow Analyses and Transformations\ Sorin Lerner David Grove Craig Chambers\ Univ. of Washington IBM T.J. Watson Research Center Univ. of Washington\ lerns@cs.washington.edu groved@us.ibm.com chambers@cs.washington.edu\ ", ["popl/data/00001687.pdf"] = "FO REWARD\ The FiftH\ papers ACM\ in\ this Symposium\ volume on\ were Principles\ presented of\ at\ the", ["paul-wilson/allocsrv.ps.gz"] = "Dynamic Storage Allocation:\ A Survey and Critical Review ? ??\ Paul R. Wilson, Mark S. Johnstone, Michael Neely, and David Boles ???\ Department of Computer Sciences\ University of Texas at Austin\ Austin, Texas, 787-1, USA\ (wilson---markj---neely@cs.utexas.edu)\ Abstract. Dynamic memory allocation\ has been a fundamental part of most com­\ ", ["phil-wadler/lazyvsstrict.dvi"] = "\ Lazy vs. Strict*\ \ \ \ Philip Wadler\ \ University of Glasgow\ \ Glasgow G12 8QQ, Scotland", ["ralph-becket/TABDL.pdf"] = "The Painful Truth about Declarative Languages\ The 1999 ICFP programming contest issued a non­trivial state­machine optimization challenge. Teams\ had 7- hours from the time the problem details were released to produce a solution. Here's what\ happened...\ Declarative vs. Imperative Programming Language Entries\ Of 38 entries, half used imperative languages and half used functional languages.\ 6 Haskell\ 6 OCaml\ -ML\ ", ["simon-peyton-jones/eval-apply-jfp.ps"] = "Under consideration for publication in J. Functional Programming 1\ Making a Fast Curry: Push/Enter vs.\ Eval/Apply for Higher-order Languages\ Simon Marlow and Simon Peyton Jones\ Microsoft Research, Cambridge\ ", ["david-hanson/lcsc.pdf"] = "SOFTWARE---PRACTICE AND EXPERIENCE\ Softw. Pract. Exper. -004; 34:1-11--1--4\ Published online 1- July -004 in Wiley InterScience (www.interscience.wiley.com). DOI: 10.100-/spe.610\ A research C# compiler\ David R. Hanson #,+ and Todd A. Proebsting\ Microsoft Research, 1 Microsoft Way, Redmond, WA 980--, U.S.A.\ SUMMARY\ C# is the new flagship language in the Microsoft .NET platform. C# is an attractive vehicle for language\ design research not only because it shares many characteristics with Java, the current language of choice\ ", ["views/context.pdf"] = "\ 9999 9999 9999 9999 9999 9999 9999 9 \"$#&%('*),+\".-0/-1-341\ -76980:<;>=@9,-/@><BAC1 '%3 D/,><E GF ?HI76KJB-?$L1 )M-\ NO687%HI'*),+/6P1 HQ$B$& 6#9( 6K3 6P1 2R:S1\ (:T9,-/G><:\ P1 17878 27228 ", ["popl/abstract/00001642.pdf"] = "", ["luca-cardelli/TypefulProg.ps"] = "Typeful Programming\ Luca Cardelli\ Digital Equipment Corporation, Systems Research Center\ 130 Lytton Avenue, Palo Alto, CA 94301\ ", ["norman-ramsey/TR_2002_105.pdf"] = "Experience in the Design, Implementation and Use of a Retargetable Static Binary Translation Framework\ Cristina Cifuentes, Mike Van Emmerik, Norman Ramsey, and Brian Lewis\ Experience in the Design, Implementation and Use of a Retargetable Static Binary Translation Framework\ Cristina Cifuentes, Mike Van Emmerik, Norman Ramsey, and Brian Lewis SMLI TR-2002-105 January 2002", ["stefan-savage/Tocs97.pdf"] = "Eraser: A Dynamic Data Race Detector for\ Multithreaded Programs\ STEFAN SAVAGE\ University of Washington\ MICHAEL BURROWS, GREG NELSON, and PATRICK SOBALVARRO\ Digital Equipment Corporation\ and\ THOMAS ANDERSON\ University of California at Berkeley\ ", ["popl/data/00001475.pdf"] = "COXIferenCe\ Record\ of\ the\ Fifth\ Annual\ ACM\ Symposium\ on\ Principle%", ["popl/data/00001393.pdf"] = "EVEN\ SIMTLE\ PROGEAMS\ ARE\ HARD\ TO\ ANALYZE\ by\ Neil\ D,", ["dale-parson/luxsim99.pdf"] = "", ["popl/abstract/00001408.pdf"] = "", ["simon-peyton-jones/putting.ps.gz"] = "Under consideration for publication in J. Functional Programming 1\ Practical type inference for arbitrary-rank types\ - January -004\ Simon Peyton Jones\ Mark Shields\ ", ["jeremy-condit/capriccio-sosp-2003.pdf"] = "Capriccio: Scalable Threads for Internet Services\ Rob von Behren, Jeremy Condit, Feng Zhou, George C. Necula, and Eric Brewer\ Computer Science Division\ University of California, Berkeley\ {jrvb,jcondit,zf,necula,brewer}@cs.berkeley.edu\ ", ["john-reppy/exene.ps"] = "4\ A Multi­threaded Higher­order\ User Interface Toolkit\ EMDEN R. GANSNER and JOHN H. REPPY\ AT&T Bell Laboratories\ ", ["popl/abstract/00001443.pdf"] = "", ["popl/data/00001644.pdf"] = "Summarizing\ Graphs\ Mark\ by Regular\ Wegman Research\ Expressions\ IBM\ Thomas\ J. Watson\ Center", ["sigplan/2003/pdfs/sigp/773039/p36-hirzel.pdf"] = "Main TOC\ Newsletter TOC\ Search\ Understanding the Connectivity of Heap Objects\ Martin Hirzel Johannes Henkel Amer Diwan\ University of Colorado\ {hirzel,henkel,diwan}@cs.colorado.edu\ Michael Hind\ IBM Watson Research Center\ hindm@us.ibm.com", ["simon-peyton-jones/rules.ps.gz"] = "Playing by the Rules: Rewriting as a practical optimisation technique in GHC\ Simon Peyton Jones\ Microsoft Research Ltd\ simonpj@microsoft.com\ Andrew Tolmach\ Portland State University\ apt@cs.pdx.edu\ Tony Hoare\ Microsoft Research Ltd\ ", ["popl/data/00001702.pdf"] = "?_Jniversality\ of Data\ Alfred\ Retrieval\ V.\ Languages\ Aho\ Bell Laboratories Murray Hill, New Jersey\ and Jeffrey D. UllmanT", ["david-turner/elegance.djvu"] = "The Semanti Elegance of Applicative Languages \ D. A. Turner \ University of Kent at Canterbury \ In what does the alleged superiority of \ applicative languages consist? In the \ last analysis the answer must be in terms \ of the reduction in the time required to \ produce a correct program to solve a given \ problem. On reflection I decided that \ the best way to demonstrate this would be ", ["sigplan/2003/pdfs/topl/937563/p549-m_amadio.pdf"] = "Main TOC\ Transactions TOC\ Search\ The Receptive Distributed -Calculus\ ROBERTO M. AMADIO Universite de Provence ´ ´ GERARD BOUDOL INRIA and ´ CEDRIC LHOUSSAINE University of Sussex\ We study an asynchronous distributed -calculus, with constructs for localities and migration. We show that a static analysis ensures the receptiveness of channel names, which, together with a simple type system, guarantees the message deliverability property. This property states that any migrating message will find an appropriate receiver at its destination locality. We argue that this distributed, receptive calculus is still expressive enough while allowing for an effective type ` inference a la ML. Categories and Subject Descriptors: D.3.1 [Programming Languages]: Formal Definitions and Theory--Semantics, syntax; D.3.3 [Programming Languages]: Language Constructs and Features--Concurrent programming structures; F.3.2 [Logics and Meanings of Programs]: Semantics of Programming Languages--Operational semantics General Term: Theory Additional Key Words and Phrases: -Calculus, distribution, receptivity, resource access control\ 1. INTRODUCTION The distributed -calculus D introduced by Hennessy and Riely [2002] is an enrichement of the -calculus involving explicit notions of locality and migration, that is, code movement from one location to another. In this model communication is purely local, so that messages to remote resources (i.e., receivers, or input processes, in -calculus terminology) must be explicitly routed. This is, for example, similar to the Ambient calculus of Cardelli and Gordon [1998] and different from the JOIN calculus [Fournet and Gonthier 1996; Fournet et al. 1996]\ Some of the results presented here were announced in a preliminary form in Amadio et al. [1999]. Authors' addresses: R. M. Amadio, Laboratoire d'Informatique Fondamentale de Marseille, CMI, 39 rue Joliot-Curie, F-13453, Marseille, France; email: amadio@cmi.univ-mrs.fr; G. Boudol, INRIA, 2004 route des Lucioles, BP93, 06902 Sophia-Antipolis, France; email: Gerard.Boudol@sophia. inria.fr; C. Lhoussaine, COGS, University of Sussex, Brighton BN1 9QH, U.K.; email: clh23@ cogs.susx.ac.uk. Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists requires prior specific permission and/or a fee. C 2003 ACM 0164-0925/03/0900-0549 $5.00\ ACM Transactions on Programming Languages and Systems, Vol. 25, No. 5, September 2003, Pages 549­577.\ 550", ["sigplan/2003/pdfs/proceeding/944705/p203-beffara.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Disjunctive Normal Forms and Local Exceptions\ ´ ´ Universite Paris 7, Equipe PPS 2 place Jussieu 75251 Paris Cedex 05, France\ Emmanuel Beffara\ ´ ´ Universite Paris 7, Equipe PPS 2 place Jussieu 75251 Paris Cedex 05, France\ Vincent Danos\ beffara@pps.jussieu.fr", ["popl/data/00001482.pdf"] = "ANALYSIS OF SIMPLE PROGRAMS OVER DIFFERENT SETS OF PRIMITIVES\ (Extended", ["dan-wang/ugc.ps.gz"] = "Untrusted Garbage Collectors\ (Extended Abstract)\ Daniel C. Wang Andrew W. Appel\ Department of Computer Science\ Princeton University\ Princeton, NJ 08-44 USA\ July 17, -000\ ", ["sigplan/2003/pdfs/proceeding/949305/p135-zhao.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Lightweight Confinement for Featherweight Java\ Tian Zhao Jens Palsberg Jan Vitek\ University of Wisconsin, Milwaukee Purdue University", ["sigplan/2003/pdfs/proceeding/781131/p208-chen.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ A Provably Sound TAL for Back-end Optimization\ Juan Chen Dinghao Wu\ Princeton University\ {juanchen, dinghao, appel}@cs.princeton.edu\ Andrew W. Appel\ Hai Fang", ["popl/abstract/00001391.pdf"] = "", ["sigplan/2003/pdfs/proceeding/944705/p127-walker.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ A Theory of Aspects\ David Walker\ Steve Zdancewic\ University of Pennsylvania\ Jay Ligatti\ Princeton University", ["sigplan/2003/pdfs/proceeding/944705/p99-bierman.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Dynamic Rebinding for Marshalling and Update, with Destruct-time\ Gavin Bierman\ Michael Hicks\ Peter Sewell\ Gareth Stoyle\ Keith Wansbrough", ["marc-shapiro/podc01.ps.gz"] = "The IceCube approach to the reconciliation of divergent\ replicas\ Anne­Marie Kermarrec, Antony\ Rowstron, Marc Shapiro\ Microsoft Research\ Cambridge, CB- 3NH, UK\ fannemk,antrg@microsoft.com,\ marc.shapiro@acm.org\ Peter Druschel \ ", ["russ-cox/systems.pdf"] = "Toward a new systems programming environment\ Russ Cox\ rsc@mit.edu\ 1. Introduction\ I am growing increasingly dissatisfied with the systems programming environments available to\ me. This is a rant. In it, I try to articulate what I find wrong with current systems programming\ environments, in an attempt to decide what the systems programming environment I want to use\ would look like. Some sections are more well thought out (and thus longer) than others.\ To start, I must define systems programming environment. First, systems programming is\ ", ["norman-ramsey/c--exn.ps"] = "Reprinted from Proceedings of the ACM SIGPLAN -000 Conference on Programming Language Design and Implementation (PLDI -000)\ A Single Intermediate Language\ That Supports Multiple Implementations of Exceptions\ Norman Ramsey\ Harvard University\ nr@eecs.harvard.edu\ Simon Peyton Jones\ Microsoft Research Ltd\ simonpj@microsoft.com\ ", ["popl/abstract/00001687.pdf"] = "", ["phil-wadler/monadscomb.dvi"] = "\ Combining Monads\ \ \ \ David J. King Philip Wadler\ \ University of Glasgow*\ ", ["dale-parson/corba99dbg.ps.gz"] = "D. Parson, Lucent Technologies, 9/-8/99 Lucent CORBA 1999: Distributed Debugging API p. 1\ Lucent CORBA Seminar 1999\ Distributed Debugging API for ORBs and Services\ Request for Proposal, test/99­08­0-\ September -8, 1999\ Dale Parson, Distinguished Member of Technical Staff\ Bell Labs, Microelectronics Division\ dparson@lucent.com\ \ ", ["popl/abstract/00001449.pdf"] = "", ["mark-jones/springschool95.ps.gz"] = "Functional Programming with Overloading and\ Higher­Order Polymorphism\ Mark P. Jones\ Department of Computer Science, University of Nottingham, University Park,\ Nottingham NG7 -RD, UK.\ Abstract. The Hindley/Milner type system has been widely adopted as\ a basis for statically typed functional languages. One of the main reasons\ for this is that it provides an elegant compromise between flexibility, al­\ lowing a single value to be used in different ways, and practicality, freeing\ ", ["sigplan/2003/pdfs/proceeding/781498/p203-tan.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Using Generative Design Patterns to Generate Parallel Code for a Distributed Memory Environment\ Kai Tan\ Duane Szafron\ Jonathan Schaeffer John Anvik\ Steve MacDonald\ Department of Computing Science, University of Alberta, Edmonton, AB, T6G 2E8, Canada School of Computer Science, University of Waterloo, Waterloo, ON, N2L 3G1, Canada", ["norman-ramsey/sigcalc.ps"] = "Toward a Calculus of Signatures\ Norman Ramsey\ Division of Engineering and Applied Sciences\ Harvard University\ October -, -001\ ", ["andrew-tolmach/pi3.ps.gz"] = "J. Functional Programming 1 (1): 1--000, January 1993 c\ fl 1993 Cambridge University Press 1\ From ML to Ada: Strongly­typed Language\ Interoperability via Source Translation 1\ ANDREW TOLMACH\ Pacific Software Research Center\ Department of Computer Science, Portland State University,\ P.O. Box 7-1, Portland, OR, 97-07­07-1, USA\ email: apt@cs.pdx.edu\ ", ["modules/harper98typetheoretic.pdf"] = " \ 0 \ 9999 9999 9999 9999 9999 9999 9999 9999 9999 \ ô·ø ÷· 0214357698:\r;\ \"#%$'&! (\r)* ()#+-, I\ HG8914=!5 38177 14440 \ $'&! (\r)* () GaPB!11Vbc1\ ]Z^W`_V\\ 37116 15770 \ )* () @k;\ 7=ai5 37266 18640 ", ["popl/data/00001516.pdf"] = "Axiomatic\ Definitionsof\ Programming\ Languages,\ II\ Joseph\ Y,\ Halpern\ Madwma[ics Deparlmen!, Harvard University, Cambridge, Massachusc(ts02138.\ Albert R. Meyer Laboratory for Computer .$cience, Ma.rsachuset(sIns[itute of Technology, Cambridge, Massachusetts 02139.", ["tony-hoare/csp.pdf"] = "P\ r\ o\ g\ r\ a\ m\ m\ i\ ", ["popl/abstract/00001400.pdf"] = "", ["emery-berger/berger-oopsla2002.ps.gz"] = "Reconsidering Custom Memory Allocation\ Emery D. Berger\ Dept. of Computer Science\ University of Massachusetts\ Amherst, MA 0100-\ emery@cs.umass.edu\ Benjamin G. Zorn\ Microsoft Research\ One Microsoft Way\ ", ["popl/abstract/00001694.pdf"] = "", ["popl/data/00001484.pdf"] = "Qualified\ Data\ Flow\ Problems\ L. Howard\ Honey\ BarryK. Computer\ Rosen Sciences Department Research 10598 Center\ IBM Cambridge Scientific Center 545 Technology Square Cambridge, MA 02139\ lBMThomas Yorktown", ["mark-bailey/tse-11-03.pdf"] = "Automatic Detection and Diagnosis of Faults\ in Generated Code for Procedure Calls\ Mark W. Bailey, Member, IEEE, and Jack W. Davidson, Member, IEEE Computer Society\ Abstract---In this paper, we present a compiler testing technique that closes the gap between existing compiler implementations and\ correct compilers. Using formal specifications of procedure­calling conventions, we have built a target­sensitive test suite generator\ that builds test cases for a specific aspect of compiler code generators: the procedure­calling sequence generator. By exercising\ compilers with these specification­derived target­specific test suites, our automated testing tool has exposed bugs in every compiler\ tested on the MIPS and one compiler on the SPARC. These compilers include some that have been in heavy use for many years.\ Once a fault has been detected, the system can often suggest the nature of the problem. The testing system is an invaluable tool for\ ", ["sigplan/2003/pdfs/proceeding/781498/index.pdf"] = "Main TOC\ Newsletter TOC\ Search\ PPoPP '03: The Ninth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming San Diego, California, USA June 11-13, 2003\ Frontmatter (Inside Cover & Copyright Page, Welcome to PPoPP '03!, Table of Contents, Symposium Committee)\ SESSION: Speculation\ Using thread-level speculation to simplify manual parallelization Manohar K. Prabhu and Kunle Olukotun Toward efficient and robust software speculative parallelization on multiprocessors Marcelo Cintra and Diego R. Llanos Compiler support for speculative multithreading architecture with probabilistic points-to analysis Peng-Sheng Chen, Ming-Yu Hung, Yuan-Shin Hwang, Roy Dz-Ching Ju, and Jenq Kuen Lee\ SESSION: Software for parallel architectures\ Improving server software support for simultaneous multithreaded processors Luke K. McDowell, Susan J. Eggers, and Steven D. Gribble Programming the FlexRAM parallel intelligent memory system Basilio B. Fraguela, Jose Renau, Paul Feautrier, David Padua, and Josep Torrellas Exploiting task-level concurrency in a programmable network interface Hyong-youb Kim, Vijay S. Pai, and Scott Rixner User-controllable coherence for high performance shared memory multiprocessors Collin McCurdy and Charles Fischer\ SESSION: Short talks on emerging research topics", ["sigplan/2003/pdfs/proceeding/949305/p169-eeckhout.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ How Java Programs Interact with Virtual Machines at the Microarchitectural Level\ Lieven Eeckhout Andy Georges Koen De Bosschere\ Department of Electronics and Information Systems (ELIS), Ghent University St.-Pietersnieuwstraat 41, B-9000 Gent, Belgium\ {leeckhou,ageorges,kdb}@elis.UGent.be", ["popl/abstract/00001441.pdf"] = "", ["popl/data/00001518.pdf"] = ".\ Program Logic Without Binding is DecidaMe\ V. R. Pratt M.I.T.\ subbat.Stanford", ["gerard-boudol/asynchrony.ps"] = "Asynchrony and the ß­calculus\ (Note)\ G'erard Boudol\ INRIA Sophia­Antipolis\ 06-60­VALBONNE FRANCE\ ", ["sigplan/2003/pdfs/proceeding/858570/p24-franz.pdf"] = "Main TOC\ Proceedings TOC\ Search\ A Portable Virtual Machine Target For Proof-Carrying Code\ Michael Franz, Deepak Chandra, Andreas Gal, Vivek Haldar, Ferm´n Reig, Ning Wang i\ {franz,dchandra,gal,vhaldar,reig,wangn}@uci.edu\ Department of Computer Science University of California Irvine, CA 92697-3425", ["sigplan/2003/pdfs/proceeding/781131/p26-george.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Taming the IXP Network Processor\ Lal George Network Speed Technologies, Inc lg@network-speed.com\ Matthias Blume Toyota Technological Institute at Chicago blume@tti-c.org", ["popl/data/00001361.pdf"] = "", ["sigplan/2003/pdfs/sigp/773039/p64-shaham.pdf"] = "Main TOC\ Newsletter TOC\ Search\ Estimating the Impact of Heap Liveness Information on Space Consumption in Java\ Ran Shaham\ Tel-Aviv University and IBM Haifa Research Laboratory\ Elliot K. Kolodner\ IBM Haifa Research Laboratory\ Mooly Sagiv\ Tel-Aviv University", ["matthew-flatt/thesis-flatt.ps"] = "RICE UNIVERSITY\ Programming Languages for\ Reusable Software Components\ by\ Matthew Flatt\ A Thesis Submitted\ in Partial Fulfillment of the\ Requirements for the Degree\ Doctor of Philosophy\ ", ["derek-dreyer/tshom-tr.ps"] = "A Type System for Higher­Order Modules\ (Expanded Version)\ Derek Dreyer Karl Crary Robert Harper\ December -00-\ CMU­CS­0-­1--R\ School of Computer Science\ Carnegie Mellon University\ Pittsburgh, PA 1--13\ This report refines and supersedes the original version published in July -00- as CMU Technical Report\ ", ["norman-ramsey/sync.pdf"] = "Reprinted from Foundations of Software Engineering 2001\ An Algebraic Approach to File Synchronization\ Norman Ramsey Division of Engineering and Applied Sciences Harvard University Cambridge, USA nr@eecs.harvard.edu Eld Csirmaz o Mihaly Fazekas Secondary Grammar School Budapest, Hungary elod@renyi.hu", ["mark-bailey/popl95.pdf"] = "-98\ ", ["richard-kelsey/r5rs.ps.gz"] = "Revised - Report on the Algorithmic Language\ Scheme\ RICHARD KELSEY, WILLIAM CLINGER, AND JONATHAN REES (Editors)\ H. ABELSON R. K. DYBVIG C. T. HAYNES G. J. ROZAS\ N. I. ADAMS IV D. P. FRIEDMAN E. KOHLBECKER G. L. STEELE JR.\ D. H. BARTLEY R. HALSTEAD D. OXLEY G. J. SUSSMAN\ G. BROOKS C. HANSON K. M. PITMAN M. WAND\ Dedicated to the Memory of Robert Hieb\ -0 February 1998\ ", ["popl/data/00001649.pdf"] = "MECHANISMS\ FOR\ COMPILE-TIME\ ENFORCEMENT\ OF\ SECURITY", ["doaitse-swierstra/LL1.pdf"] = "Deterministic, Error­Correcting\ Combinator Parsers\ S. Doaitse\ Sw ierstra and Luc Duponcheel\ Dept. of\ Compu ter Science, Utrecht University\ P.O.Box 80.089, 3-08 TB Utrecht, The Netherlands\ e­mail\ swierstra@cs.ru u .nl and\ ", ["sigplan/2003/pdfs/proceeding/871895/p62-heeren.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Helium, for Learning Haskell\ Bastiaan Heeren Daan Leijen Arjan van IJzendoorn\ Institute of Information and Computing Sciences, Utrecht University P.O.Box 80.089, 3508 TB Utrecht, The Netherlands\ {bastiaan, daan, afie}@cs.uu.nl", ["sigplan/2003/pdfs/proceeding/871895/p103-hallgren.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Haskell Tools from the Programatica Project", ["norman-ramsey/checker.ps"] = "Automatic Checking of Instruction Specifications\ Mary Fern'andez\ AT&T Labs\ 600 Mountain Ave.\ Murray Hill, NJ 07974\ mff@research.att.com\ Norman Ramsey\ Dept. of Computer Science\ University of Virginia\ ", ["joe-armstrong/development.ps.gz"] = "The development of Erlang\ Joe Armstrong\ Computer Science Laboratory\ Ericsson Telecom AB\ joe@cslab.ericsson.se\ ", ["norman-ramsey/prag01.dvi"] = "Under consideration for publication in J. Functional Programming 1\ Pragmatic Aspects of\ Reusable Program Generators\ Norman Ramsey\ Division of Engineering and Applied Sciences\ Harvard University\ (e-mail: nr@eecs.harvard.edu)\ ______________________________________________________________________________________________________________________", ["sigplan/2003/pdfs/proceeding/781498/p167-ocallahan.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Hybrid Dynamic Data Race Detection\ Robert O'Callahan\ IBM T. J. Watson Research Center\ Jong-Deok Choi\ IBM T. J. Watson Research Center\ roca@us.ibm.com", ["popl/data/00001483.pdf"] = "Synchronous\ Schemes and (Extended", ["dale-parson/corba99dbg.pdf"] = "D. Parson, Lucent Technologies, 9/-8/99 Lucent CORBA 1999: Distributed Debugging API p. 1\ Lucent CORBA Seminar 1999\ Distributed Debugging API for ORBs and Services\ Request for Proposal, test/99­08­0-\ September -8, 1999\ Dale Parson, Distinguished Member of Technical Staff\ Bell Labs, Microelectronics Division\ dparson@lucent.com\ \ ", ["dan-wang/dsl97.ps.gz"] = "The Zephyr Abstract Syntax Description Language\ Daniel C. Wang Andrew W. Appel Jeff L. Korn\ Christopher S. Serra\ Department of Computer Science, Princeton University, Princeton, NJ, 08-44\ fdanwang,appel,jlkg@cs.princeton.edu, csserra@cs.wisc.edu\ ", ["xavier-leroy/applicative.ps"] = " \ \ \ \ \ \ \ \ \ ", ["modules/p470-mitchell.pdf"] = "A\ b\ s\ t\ r\ a\ c\ t\ T\ ", ["matthias-felleisen/prompts.pdf"] = "The Theory\ and Practice\ of First-Class\ Prompts\ Mat t hias Felleisen Indiana University Computer Science Department Lindley Hall 101 Bloomington, IN 47405", ["sigplan/2003/acrobat/win/Help/ENU/MiniReader.pdf"] = "Adobe Acrobat Reader Help\ This help file contains the basic information you need to open, navigate, and print PDF files using Adobe Acrobat Reader. If you need more help, you can download and install the complete Acrobat Reader Help by clicking the link below. You must have an Internet connection to download the complete Help file. Click here to download and install the complete Acrobat Reader Help.\ Opening PDF documents\ Adobe Acrobat Reader allows to open and view Portable Document Format (PDF) files. To open a PDF document:\ ·\ , or choose File > Open. In the Open dialog box, select Click the Open button one or more filenames, and click Open. PDF documents usually have the extension .pdf. Choose the document's filename from the File menu. The menu lists the four PDF documents you last opened. Double-click the file icon in your file system.\ · ·\ Note: On Mac OS, you may not be able to open a PDF document created in Windows by double-clicking the icon. If double-clicking the icon on Mac OS does not open the document, use File > Open in Acrobat to open the document.\ Adjusting the view of PDF documents\ You can change the magnification of a PDF document and set the page layout so that you can see one page at a time or a continuous flow of pages. To increase magnification: , and click the page, or drag to draw a rectangle around Select the zoom-in tool the area to magnify. You can also click the Zoom In button in the viewing toolbar. To decrease magnification: Select the zoom-out tool , and click the page, or drag to draw a rectangle the size you want the reduced page to be. You can also click the Zoom Out button in the viewing toolbar. Note: When the zoom-in tool is selected, you can press Ctrl (Windows) or Option (Mac OS) while clicking or dragging to zoom out instead of in. When the zoom-out tool is selected, press Ctrl or Option to zoom in. To resize a page to fit the window: Do one of the following:", ["norman-ramsey/mdsmith_pldi04_final.pdf"] = "A Generalized Algorithm for Graph Coloring Register Allocation\ Michael D. Smith, Norman Ramsey, and Glenn Holloway Harvard University\ {smith,nr,holloway}@eecs.harvard.edu", ["popl/data/00001558.pdf"] = "Modular\ Verification Brent Computer\ of Concurrent Hailpern Department Research New York\ Programs\ Sciences Heights,\ IBM\ T. J. Watson\ Center 10598\ Yorktown\ Susan Owicki Computer Stanford, Systems California Laboratory 94305 Stanford University", ["sigplan/2003/pdfs/proceeding/858570/index.pdf"] = "Main TOC\ Search\ IVME '03: The 2003 Workshop on Interpreters, Virtual Machines and Emulators San Diego, California, USA June 12, 2003\ Frontmatter (Inside Cover & Copyright Page, Preface, Organizers, Table of Contents) Embedding an interpreted language using higher-order functions and types Norman Ramsey Executable JVM model for analytical reasoning: a study Hanbing Liu and J Strother Moore A portable Virtual Machine target for Proof-Carrying Code Michael Franz, Deepak Chandra, Andreas Gal, Vivek Haldar, Fermín Reig, and Ning Wang Generation of fast interpreters for Huffman compressed bytecode Mario Latendresse and Marc Feeley The case for virtual register machines Brian Davis, Andrew Beatty, Kevin Casey, David Gregg, and John Waldron Dynamic native optimization of interpreters Gregory T. Sullivan, Derek L. Bruening, Iris Baron, Timothy Garnett, and Saman Amarasinghe Joeq: a virtual machine and compiler infrastructure John Whaley Engineering a customizable intermediate representation K. Palacz, J. Baker, C. Flack, C. Grothoff, H. Yamauchi, and J. Vitek", ["lal-george/gc-api.ps"] = "SMLNJ: Garbage collection API\ Lal George\ Rm -c478, Bell Labs\ 700 Mountain Ave\ Murray Hill, NJ 07974\ May -1, 1999\ This note describes the garbage collection interface to\ the runtime system implemented in version 110.1-. All\ communication to the runtime system is through a fixed\ ", ["sigplan/2003/pdfs/sigp/773039/p65-ykman-couvreur.pdf"] = "Main TOC\ Newsletter TOC\ Search", ["pieter-olivier/debug-thesis.ps.gz"] = "A Framework for Debugging\ Heterogeneous Applications\ On Bugs and Trees\ \ The work in this thesis has been carried out\ under the auspices of the research school IPA\ (Institute for Programming research and Algorithmics).\ \ A Framework for Debugging\ ", ["sigplan/2003/pdfs/topl/641888/p210-ramsey.pdf"] = "Main TOC\ Transactions TOC\ Search\ A Transformational Approach to Binary Translation of Delayed Branches\ NORMAN RAMSEY Harvard University and CRISTINA CIFUENTES Sun Microsystems Laboratories\ A binary translator examines binary code for a source machine and generates code for a target machine. Understanding what to do with delayed branches in binary code can involve tricky case analyses, for example, if there is a branch instruction in a delay slot. This article presents a disciplined method for deriving such case analyses. The method identifies problematic cases, shows the translations for the nonproblematic cases, and gives confidence that all cases are considered. The method supports such common architectures as SPARC, MIPS, and PA-RISC, and it should apply to any tool that analyzes machine instructions. We begin by writing a very simple interpreter for the source machine's code. We then transform the interpreter into an interpreter for a target machine without delayed branches. To maintain the semantics of the program being interpreted, we simultaneously transform the sequence of source-machine instructions into a sequence of target-machine instructions. The transformation of the instructions becomes our algorithm for binary translation. Categories and Subject Descriptors: D.3.4 [Programming Languages]: Processors; I.1.4 [Computing Methodologies]: Symbolic and Algebraic Manipulation--applications General Terms: Experimentation, Languages Additional Key Words and Phrases: Binary translation, program analysis, program transformation\ 1. INTRODUCTION Binary translation makes it possible to run code compiled for source platform S on target platform T . Unlike interpreted or emulated code, binary-translated code approaches the speed of native code on machine T . The fundamental steps in binary translation are to distinguish code from data, to map data locations from the source to the target machine, and to translate instructions [Sites et al. 1993]. The problem of distinguishing code\ This work has been supported by grant A49702762 from the Australian Research Council. N. Ramsey has additional support from National Science Foundation grants ASC-9612756 and CCR-9733974 and from DARPA contract MDA904-97-C-0247. Authors' addresses: N. Ramsey, Division of Engineering and Applied Sciences, Harvard University, Cambridge, MA 01238; email: nr@eecs.harvard.edu; C. Cifuentes, Sun Microsystems Laboratories, Palo Alto, CA 94303; email: cristina.cifuentes@sun.com. Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided that the copies are not made or distributed for profit or commercial advantage, the copyright notice, the title of the publication, and its date appear, and notice is given that copying is by permission of ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists requires prior specific permission and/or a fee. C 2003 ACM 0164-0925/03/0300-0210 $5.00\ ACM Transactions on Programming Languages and Systems, Vol. 25, No. 2, March 2003, Pages 210­224.\ Binary Translation of Delayed Branches", ["greg-morrisett/jgmorris-mp.ps.gz"] = "A Portable Multiprocessor Interface\ for\ Standard ML of New Jersey\ J. Gregory Morrisett 1 Andrew Tolmach -\ Carnegie Mellon University Princeton University\ jgmorris@cs.cmu.edu apt@cs.princeton.edu\ June 199-\ CMU­CS­9-­1--\ School of Computer Science\ ", ["benjamin-pierce/snc-mobicom.ps.bz2"] = "What is a File Synchronizer?\ S. Balasubramaniam\ Vidam Communications\ sundar@vidam.com\ Benjamin C. Pierce\ University of Pennsylvania\ bcpierce@cis.upenn.edu\ ", ["andrew-appel/edit.ps.gz"] = "How to Edit a Journal by E­mail\ Andrew W. Appel\ Department of Computer Science\ Princeton University\ appel@princeton.edu\ CS­TR­494­9-\ July 10, 199-\ ", ["popl/data/00001631.pdf"] = "Making An Equational\ Variables Theory", ["popl/data/00001544.pdf"] = "PRACTICAL\ ERROR\ RECOVERY\ IN\ LR\ PARSING\ Seppo\ Sippu\ and\ Eljas", ["norman-ramsey/embedj.ps"] = "Under consideration for publication in J. Functional Programming 1\ Embedding an Interpreted Language Using\ Higher­Order Functions and Types\ Norman Ramsey\ Division of Engineering and Applied Sciences\ Harvard University\ ", ["popl/data/00001709.pdf"] = "DECISIONS\ FOR\ \"TYPE\"\ IN\ APL*\ Dept.\ of\ W. II.. Gull M. A. Jenkins Computing and Information Queen's University Kingston, Canada\ Science", ["jay-lepreau/oskit-sosp16.ps.gz"] = "The Flux OSKit: A Substrate for Kernel and Language Research\ Bryan Ford Godmar Back Greg Benson Jay Lepreau Albert Lin Olin Shivers\ University of Utah University of California, Davis Massachusetts Institute of Technology\ ", ["olivier-danvy/BRICS-RS-01-23.dvi"] = " Defunctionalization at Work *\ Olivier Danvy and Lasse R. Nielsen\ BRICS y\ Department of Computer Science\ University of Aarhus z\ June, 2001", ["mark-jones/fundeps.pdf"] = "Type Classes with Functional Dependencies #\ Appears in Proceedings of the 9th European Symposium on Programming,\ ESOP -000, Berlin, Germany, March -000, Springer­Verlag LNCS 178-.\ Mark P. Jones\ Department of Computer Science and Engineering\ Oregon Graduate Institute of Science and Technology\ Beaverton, Oregon, USA\ mpj@cse.ogi.edu\ Abstract. Type classes in Haskell allow programmers to define func­\ ", ["jeroen-fokker/parsers.ps.gz"] = "Functional Parsers\ Jeroen Fokker\ Dept. of Computer Science, Utrecht University\ P.O.Box 80.089, 3-08 TB Utrecht, The Netherlands\ e­mail jeroen@cs.ruu.nl\ Abstract. In an informal way the `list of successes' method for writ­\ ing parsers using a lazy functional language (Gofer) is described. The\ library of higher­order functions (known as `parser combinators') that\ is developed is used for writing parsers for nested parentheses and op­\ ", ["popl/data/00001364.pdf"] = "", ["popl/data/00001366.pdf"] = "PROGFUUWIING\ LANGUAGE\ SEMANTICS\ MJD\ CLOSED\ APPLICATIVE\ LANGUAGES\ John IBM Research San Jose,\ Backus Laboratory California\ INTRODUCTION This general is paper that proposes axioms of \"programming to define language\", a sequence the most of language-classes; restricted has the some most", ["popl/abstract/00001370.pdf"] = "", ["simon-peyton-jones/ooeval-apply.ps"] = "Making a fast curry\ Push/enter vs eval/apply for higher­order languages\ January 13, -003\ Simon Marlow and Simon Peyton Jones\ Microsoft Research, Cambridge\ ", ["sigplan/2003/pdfs/proceeding/774833/p67-orso.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Visualization of Program-Execution Data for Deployed Software\ Alessandro Orso College of Computing Georgia Institute of Technology orso@cc.gatech.edu James Jones College of Computing Georgia Institute of Technology jjones@cc.gatech.edu Mary Jean Harrold College of Computing Georgia Institute of Technology harrold@cc.gatech.edu", ["sigplan/2003/pdfs/proceeding/777388/p85-liu.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Optimizing Ackermann's Function by Incrementalization\ Yanhong A. Liu Scott D. Stoller\ Computer Science Department, State University of New York at Stony Brook, Stony Brook, NY 11794, USA\ {liu,stoller}@cs.sunysb.edu", ["sigplan/2003/pdfs/sigp/944579/p20-pronk.pdf"] = " ho do io n i n nkmn n w h y y i h w h i w n i h ts r do mo hk ho n q w hon q i !6rW#!~Weh~Q\"r161!6UUreeir$s#suBDeh¦WEWs#snd¦raeiWjEu¡²©#~lW~!16s#!!r¦\" Hi w q n q wm w hn n yw w o v q i q ts r do mo h k ho n q mo q nm p q !neij#j\"l\"U~Ws#rr¿rls¡xWdd$¡Elu¡²©~~6W#!16\"c~~¦rUW3\" i V £¤ ªi £ v q¦ ¼ e Vc q Rv q¦ T v q¦ V Ö I¤¦i ¬R¦¤ V Ti h v «c ¬ « V ª v q¦ T « £ Vcv § v £ivR ¨ v q¦ « £¤¤ ¬i £ e £ ª ªv j±TQ¥¬#Q¥VQQYda¿#QUjQg¿l#QUUQj#¤ #WuaWYdfcQSu'Y±VYdl³'±¤~#UQ¤QU³Q¥VUUY#U¥¤QD¥VQ¬s¥¨#Qq ¥Ô#¢#UsDtdÕU¥¤¥£dDUWT1QxQ¥VQuaUYQW®TS~ì W¥ëx¥v#¥iUd'~QW¥TUs#³E±ÔQW¥Ts#QYUQd\"UjQUYdQU1j¥XpÀ ªv §vR¦ Cv ¤c × § ªc §R v q¦ « £¤ ¬ ¦c q¦ e V ¬ v ×¼ ë ê ª £¦Rc ev V £¦ Vv § ª¤ ¬ £ úvR ¨ v q¦ T ¤R T q¦ ¬c v q¦ v £ È Æ ¦ È Ä ¦ Å - Å f Ç Å Ä d V Ǥ b È - ` ÄË Æ É È Ê Ä Ë Æ V T Q\"¡x\"Wg¥QDY²e¡1UYcX¡÷¡pÅ aUQ¿xgYXx§QW¥U\"\ S\ I eRc e Vc¦¤ v q¦ £ R TRRv Vc £ vRv q¦ ¼ « £¦ £ R V Ti v Ø ¤ V £¦ £Ri¤v tUduQd!UQ¢¥VxjU#Dd±¤¤U#QQuQ¥VU#¥iaj#Ea¿QW¥TQ¥¨U##Qe q¦ T Ø ª ¬ T q¤ Q vi Vc¦R T ¨ £ ªc ¬ ¯v T vRc ¦ Cv¦ q ª « e Vc V £ £ V v e ªc §R ¦c q¦ ¤v¦c¦¤ ª £ ª ¨ Cv ¦ Vv § ¬i T Wug¥eQWQs##QurWu¢¥§uas#1ddsDDU¥¤¥£WQV ù QugW¥TU¥¦Qa° QauGW®T da~Ud!U$¥ÔU¥¦#¥i¥£QsDs#³Q#sQe v q¦ ¦c q¦ vRv q v¦ T V v èI « £ Vcv § e V c £c¦v e v £ivR ¨ v q¦ v £ « v ª ¬ §R v q¦ e V c ¼ v «c ¬ « V »º ª ¬ e T f v q¦ QU¦daU~QEUWYx8duQ¥VQdl³¢Qu¥¤¥ªd!#Q¥¤##UYYUxj¥úWdfcQ$W®T¿Q¢QujWduWQucª cYQsDQU\"dT ¤¦i ¬R¦¤ V Ti v q¦ T V £¦ £Ri¤v e v¤Rc Ti ñ ªv £¦ ªv î c v £ « ¤¦Rc ¨ ªc ¬¦ Cv¦ v q¦ Q v ª ¬ §R À hº f ¾ Á e Vc q ª « #QUUQj#Q1dgj±TQ¥¨U##QUu#¦Q¥Ô#W¥údfc#URDW¥úW¿UUuauaUsDQW#ufcQ$Uj®T QU³EDQdg±¤¥£jQV ù T vR ¬¦ £ § c « £¤ ¬ ev¦i ¬R¦¤ V Ti ¤ c × eR c e V c¦¤ v Iì6¼ ê ¤ V £¦ c ª Ø ¬ ¨ Rv q¦ T e V c ìA¼ G¼ E¼ Î ê ¤v £¦ T Ó V ª ¨ £ uQUsPC¢¿'Q¥VQD#U#YUUQW~1d¢daQurQq ¢ U6HYI8YW¥TUul¥i±£YQQ1#YUW$Yd6HuFQFQ6¥ë#~±iW¿'ucYW¥«sh ¥V¢³¥§U$duU$dÕ#YU¥¤¥£QQQÕ~#a$uadfc#UuG8!Q$¢uW#QW¥T±¦Ya!QgYUu¢¥vQ³dQDd8Q¥Vs±új« W®R £ v £¦ ¦c q¦ ¦c ev q ª Ø ¬ ¨ Vvv Ø ¤c q ª £Rv¦c § qi ¬ § ¤c ¼ vRv q V £ £ V °v e v q¦ T ª ¨ §c Cv Vc « £ £ § T ¥Vd!®R!g8\"U6eÎê QU³EDWuaWQufcª j¥TU¥¦Qa!YdGW®TÚQUÕYdGsDU¥¤¥£WQV ù UWuÕ¥V#Q¥esdUQð##u¢uaq £c vR v è Iì À hº f ¾ Á v «c ¬ « V V £ £ V °v e ªc §R v q¦ e Vc ¦ Cv¦ q ª « q¦ T Ø £ ev £ úTR ¨ Vvv Ø ¤c ¤ £RcR ª v q¦ e V v «c ¬ « V ª v q¦ T V £ £ V °v e v I Î è Ô Ø ev e Vv¦ Cv Rv¦ ª e Vc ì» q¦ £ è Ô Ø evi ¬ e TR¦ ~±vd!Q¥Ø±£¤QUDQuc jdajQdfcYU1dDW¥T±¦Ya!QYq ¢ Qlë Ñ ³s²#YQ#UsD¿#UufcGYd66¥ëê U¥RÕDsg##YQsUUs¥V£ ¤c v «c ¬ « V ª »º ª ¬ e T f v q¦ T V £ £ V °v e v q¦ ¤ £c¦ V Ti e Vc A 6 6 ujdajQdfc³U6fcQQsD¢Qu²j¥TU¥¦Qa!Y$QUY±VursW~²QuD##Bë ¥V£ Qh Ì s8#Q¥¤±£YQQuEs#¢Y#sQ$Qq ¢ Ö ÔØ evq ª ج¨ ¤c × ¦Vv § ¬iTe v I Î èø » » H h øë ¢ ù ø Ö Ô Ø A 6 6ë T¦ 9 8 6ë § T ev ¨ ªv úv e ¤c × ì eRc e Vc¦¤ v¤c Ø »º ª ¬ e T f v Qlë Ñ uWjQW6EH Wæ H UÌ EQh Ì s@#7ðU@#7ÐW®R)#aj¥T#W#Y$d!¥ëê daYdr²daU6fcQYÚ²Qq ¢\ 5 4 2 2 Â0  ¨ )  ' & $ \" Ã Ã È Æ ¦ È Ä ¦ Å ¦ ý ¨ ¦¤ É È ¢ - (13©U1s©¦(©Â %#\"!¡6Y¡x\"j£¥j©§¥¿Ç £¡²þ\ Iñ »º ª ¬ e T î Î è ¨ ¬ TR « « £ XR T × ¤ £ £ R ª ¬ £¦Rc ¨ £ e Vc ¼ » » H h £ ¤v ¬ £ V qiv¦ ªc §R « £¤ ¬ ¤ £ £ £¦i ~WU6fcQQsDf$lë Ñ DQjUj'Q¥VsUj¥¦¢¥VdfcQ#¥iUdu¢¥VDQdQYWQD±V¿#Qs¥¯QQ!#auGUj®T¤Q¥VUQ#¥v±¦s¥úU~dc V ¦ c £ eR c e V c¦¤ × £ úRv ú T ¦R T ¤ c ¤v £ « v¦ T V £ I¤vi cRv¦ vR c × T h §v¦¤ Ô h e V c ¤¦ Vv § V T £ ú £v q j±T£dl¥©QdaYdruT÷#¥vsU~WdxWQqx~W¥úWWQ¥¤Qq ¢ l#~dü#UsV Ì Uur®¦usû#UssgQdUs#³QW¥RsV ù ¥R#YU¦ ¼¤v « ¬ « Vc À « £ § §c « TR P V T » H h øë ¢ ù ø Ö ¤c qi ¬¤ £ §vR « V £¦c £ eRc e Vc¦¤ Rv q¦ T £ ¤ e T q¦v l#jdcajQdtgQV³¢d!RWjU\"÷jgj»QW6EH Wæ H UÌ EQh Ì d÷!Qgfc³#UjéW¥Tdl¥©QdaQur¢#QW¥V$QsQU~¢§ ªc §R T v¤ ¬ « £ e Vc¦ « V ª v q¦ T vRc ×c V ª¦ VvRc ¨ ¨c vRc ¤R T q¦ ¬c v q¦ ¦c q¦ ¤ ×T q¤ vi Vv¦ Vv¤ Rv¦¦ ª v dDUj®Tu$UQDQ¥VQYdr¤DQW¥T$Qu'd6aQ¬g¥ÔUs#daYd¢Uu'UjQUYd¢QdadQ¢#Q~Us#U¤#Udfc$Qq ¢ III I Ô e Ø ¤ eRc e Vc¦¤ c Ô Ø ¤ e T q¦v § ªc §R T ¤v¤ ¬ ¦¤R #lpsQsTuQUuaQd!U3D¦QsQ#¢QuGW®T\"d¿#UYUUu° v q¦ T v V T ¼ V £¦ci £i ¨¤ q¦c P e Vc ÔRv ó ò ª £i õ v q¦ T ¦Rc £ ¤cv £ v¤v q¦ V T ev¤c Ø ¤ £¦ Vc §v QU1d¿QWYW¥Tdlaö°#~vaGd\"òDQuG#Q¬¿xpdfc#¢uTYUuUua¨¥¤ulQ¥eU~QUDWD#da¦#¥iUsuG#¤ ªc §R Ï I c §v qi h À ò T V £¦c ªc §R ¤v £Ri¤v Rv ¨c ¨ £ I q¦c P ò e Vc ¼ ÔRv ¬ ó ò ¼ c §v qi dDUj®TôuYG#Q!sðgfEuGj¥TUd6©±¥£uGUj®T³c¢#u¥ØU##Qe3#uda¥¤Qq ¢ d\"8QusU~Q¿xaYG#Yrph À f ò « e ªi £ ¼¤ eR c e V ¦¤ ev¦ ªvR V c À f ò v¦ T § TR ¨ H Î î £¦R T V T H Øv è v £ èº ªR T è v gEQ¥V£QY±¬~Q¥VslQdaQucr¢#dfc#U$eYdg1¤~UW³WQ\"ñWðfèï§Q¥¬UWU¤YW¦¢#8¦Q¥eÕrs¥eUW8Yq ¢ í ì ë R ª e c è I P e V c V T çv £ h U!j¥ëê#¥vQués\"gQd¢j#Õ¥§suI æ Ô Ø å ä ã âá Üà ÜÞÞ Ý Ü Û Ù ª £ Rc v q¦ T ¦ cR¦¤ Øc v q £ XRc §v « £ × v q e V v × ¼ À P Ö P ¤v «c ¬ « Vc s8Dxx$!Qßl#!¦YpÚ¥v#¥i¦Ud3QU1dE#iurUQu'QU¦D¥V¢dD#URY±Vd¥T¥ªªWTEQU¦DQY¬W®TE¦u11E1x~WduWQuÀ «Q¥V³¢d!WjU\"dT¢~±vY±¨~Q¥VU\"ÕWTQ¥¬Wu¢sÔsh ¢ xÏ UÌ hUxÒ1P UÌ hÐxÏjWW»gQ¦dTDWQ¥VQ~##sU\"QUV Ì £ § §cR « TR P ¤ ª £i £R P V § £¤ T ¨ § H Ñ º Ó Ï À Ñ f H Î Í Í v q ¤ « £ evvi TR P v q¦ Ä ÇË Å Ê É È Ç Æ Å Ä 1QuxxYpWà  I « ª TR P ¼ À hº f ¾ Á ¼¤v «c ¬ « Vc À V £ £ V °v ¾ ªc §R T ½ ¼ »º ª ¬ e T ¹ ¸ · ¶ µ uW¥TW\"aQU³Esl~WduWQuGj¥TU¥¦Qa!¿auGWYQQU6fcQQsDf \"Waps³´ I¤v«c ¬« V ª « £ § §cR«TR 6#WuaWQufcxQ¥V¢³d!WWQ¨ T V £ £ V °v e v q¦ R ¤v ¬ £ V qiv¦ ªc §R T v¤ ¬ « £ e Vc¦¤ « V ª v q¦ ¤v £¤c q ¨ §v v¦ T V ¦R T q¤ £ ¢ ¡ u²j±T¥¦Qa!Q$YUEW®T¤#Qs¥¯QQ!#\"dGW®T¦d$QgQ¥VQYdr¢Qj¥T$QU~#¥©UduQ¢#$WQ¤UWYU¥¤Qq dudl~1$ y x y } y { x } | x 6rad~!Q6uW6lW~~dd~d~d rmrnQ6l6o~ohW!pd#$iUlkj1s6Q!sq r!#s6tomi ~$Wz~px rjW~Urjx6\"~xrsirh i t q o n m i h g }y Wh6 i d Wn 6 p d} W{ h y n i q m m o d o n h y |w n h m q t o h q do nm i h g Wws#rsqr¦v¦\"ul66o#sWr!pp#$iUlkj1¦fedWpW6$y b b w R v X i c q V sT q i h I f e V c b ` X V T R P I !x!#W!uaQWtrpQ8gQd¢¦aYWUSQEH F C £ § C § A 2 § 9 2 § 7 2 ¥ ¥ § £ 2 ¡ £ ( & ¡ ¡ © § ¥ £ ¡ G1ED¢3\"'B'¢@¢384¢65431¤'10)'%$#\"!¢¨¦¤¢ \ Main TOC\ ACM SIGPLAN Notices\ Newsletter TOC\ Search\ 20", ["rajiv-gupta/iccl98a.ps"] = "Automatic Generation of Microarchitecture Simulators -Lambda\ Soner ¨\ Onder Rajiv Gupta\ Department of Computer Science\ University of Pittsburgh\ Pittsburgh PA 1--60\ fsoner,guptag@cs.pitt.edu\ ", ["popl/data/00001370.pdf"] = "TYPES\ ARE NOT\ SETS*\ H. Morris, Jr. Xerox Corporation Palo Alto Research Center (PARC) Palo Alto, California 94304\ James", ["rance-cleveland/p36-cleaveland.pdf"] = "T\ h\ e\ C\ o\ n\ c\ u\ r\ ", ["norman-ramsey/tk-usenix.ps"] = "Reprinted from 199- Usenix Technical Conference  January 16{-0, 199-  New Orleans, LA\ The New Jersey Machine-Code Toolkit\ Norman Ramsey\ Bell Communications Research\ Mary F. Fernandez\ Department of Computer Science, Princeton University\ ", ["john-hughes/arrows.ps.gz"] = "Generalising Monads to Arrows\ John Hughes\ November 10, 1998\ 1 Introduction\ One of the distinguishing features of functional programming is the widespread\ use of combinators to construct programs. A combinator is a function which\ builds program fragments from program fragments; in a sense the program­\ mer using combinators constructs much of the desired program automatically,\ rather than writing every detail by hand. The freedom that functional languages\ ", ["neal-glew/mcrt/Functional Language Comparisons/hartel93benchmarking.pdf"] = "\ 9999 9999 9999 9999 9999 9999 9999 9999 9999 9999 \ õ·ø›÷·H¥÷·\ 7 8!\ 98:;%<,&=\ 0 \ #\"$&%'\")(+*-,./!#\"$0 1023 454,6 \ ·ø›÷·\ LMONQPRNQST1U)T>VWSRPRNXY Z0VWS\\[]GNNXONQ^_\ Z0VWSRPRMa`&b>XcPed fgN`G`)VWSRPhbeikj8iGlmPRlRlRn8`po LNQPRNQS>q=*3@?A:@?BAC@DFE0DHGI>KJL@DNMHC@OPDFCMRQPSUTVMR>KCAXWYQZ?[>.\\^]0_0`a\\\ b C@cIdfeZgihjeklke", ["popl/data/00001508.pdf"] = "Making\ the World\ Safe for Garbage\ Susan\ Collection\ Owicki Laboratory\ Computer\ Systems\ Stanford\ University", ["todd-cook/lisas-iccl94.ps"] = "A Functional Specification Language for Instruction Set Architectures\ Todd A. Cook Ed Harcourt\ Dept. of Electrical and Computer Eng. Dept. of Computer Science\ Rutgers University Box 8206\ P.O. Box 909 North Carolina State University\ Piscataway, NJ 08855 Raleigh, NC 27695\ tac@ece.rutgers.edu harcourt@eos.ncsu.edu\ January 18, 1994", ["popl/data/00001403.pdf"] = "AN ALGEBRA\ OF RELATIONS\ FOR MACHINE\ COMPUTATION\ Patrick\ Hall, IBM\ Peter Hitchcock, (UK) Scientific Neville Road Peterlee Co. Durham England\ Stephen Centre\ Todd", ["neal-glew/mcrt/Id/M-Structures.pdf"] = "  \ 9999 999\  \   !\"$#%#&#('*) +,- \ '*)\ / \  \ '*) 35418 19220 \ 567\r8 49\ :;=<>@?@ACB%AEDF;HGJIKAMLE?ONPAM?@LEQSRUTULM;H?@>VWQ0<;YXHZK[", ["popl/data/00001435.pdf"] = "SYMIXILIC THE\ EVALUATION VALUE by\ AND GRAPH\ GLCBAL\ John Center for\ H.\ Reifl\ and in\ Harry Computing\ R.", ["mads-tofte/oregonPS.letter.ps.gz"] = "Essentials of Standard ML Modules\ Mads Tofte\ Department of Computer Science\ University of Copenhagen\ Abstract. The following notes give an overview of Standard ML Mod­\ ules system. 1\ Part 1 gives an introduction to ML Modules aimed at the reader who\ is familiar with a functional programming language but has little or no\ experience with ML programming.\ ", ["norman-ramsey/pmonad.pdf"] = "Reprinted from the Conference Record of the 29th Annual ACM Symposium on Principles of Programming Languages (POPL'02)\ Stochastic Lambda Calculus and Monads of Probability Distributions\ Norman Ramsey Avi Pfeffer\ Division of Engineering and Applied Sciences Harvard University", ["popl/data/00001530.pdf"] = "UNBOUNDED\ SPEED\ VARIABILITY\ IN\ DISTRIBUTED\ COMWIUNICATIQN\ SYSTEMS*\ John Aiken Division Harvard Universityr\ Reif\ and", ["sigplan/2003/pdfs/proceeding/604131/p26-taha.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Environment Classifiers", ["popl/data/00001418.pdf"] = "PROGRAM\ IMPROVEMENT\ BY SOURCE\ David B. Love\ TO SOURCE\ man\ TRANSFORMATION\ Massachusetts 26 Wakefield,\ Computer Princess Street\ Associates,", ["sigplan/2003/pdfs/proceeding/777388/p44-allen.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Slicing Java Programs that Throw and Catch Exceptions\ Matthew Allen matthew@cs.wisc.edu Susan Horwitz horwitz@cs.wisc.edu\ Computer Sciences Department University of Wisconsin-Madison 1210 W. Dayton St, Madison, WI 53706 USA", ["popl/data/00001453.pdf"] = "Conference\ Record\ of\ the\ Fifth\ Annual\ ACM\ Symposium\ on\ Principles", ["neal-glew/mcrt/Chapel-Cascade/hips04.pdf"] = "The Cascade High Productivity Language #\ David Callahan + , Bradford L. Chamberlain + , and Hans P. Zima #\ + Cray Inc., Seattle WA, USA, {david, bradc}@cray.com\ # JPL, Pasadena CA, USA and University of Vienna, Austria, zima@jpl.nasa.gov", ["olivier-danvy/damian-danvy.ps.gz"] = "Syntactic Accidents in Program Analysis #\ Daniel Damian and Olivier Danvy\ BRICS +\ Department of Computer Science, University of Aarhus\ Ny Munkegade, Building -40, DK­8000 Aarhus C, Denmark\ {damian,danvy}@brics.dk\ ", ["john-ousterhout/tkUsenix91.ps.gz"] = "An X11 Toolkit Based on the Tcl Language\ John K. Ousterhout\ Computer Science Division\ Electrical Engineering and Computer Sciences\ University of California\ Berkeley, CA 947-0\ ", ["popl/data/00001417.pdf"] = "PLAN2D SYNTACTIC ANALYSIS OF PRECEDENCE GRAPH GRAMMARS\ by Reinhold Technical University of Berlin, Franck Department of Cybernetics", ["popl/abstract/00001394.pdf"] = "", ["popl/data/00001696.pdf"] = "PRINCIPLES\ OF PROVING,CONCURRENT\ PROGRAMS IN\ GYPSY\ Donald I. Good Richard M. Cohen James Keeton-Williams\ Institute\ for\ CERTIFIABLE MINICOMPUTER PROJECT Computing Science and Computer Applications The University of Texas at Austin Austin, Texas 78712", ["neal-glew/mcrt/Non-blocking data structures/p35-michael.pdf"] = "Scalable Lock­Free Dynamic Memory Allocation\ Maged M. Michael\ IBM Thomas J. Watson Research Center\ P.O. Box 218, Yorktown Heights, NY 10598, USA\ magedm@us.ibm.com", ["john-hughes/pretty.ps.gz"] = "The Design of a Pretty­printing Library\ John Hughes\ Chalmers Tekniska H¨ogskola, G¨oteborg, Sweden.\ 1 Introduction\ On what does the power of functional programming depend? Why are functional\ programs so often a fraction of the size of equivalent programs in other languages?\ Why are they so easy to write? I claim: because functional languages support soft­\ ware reuse extremely well.\ Programs are constructed by putting program components together. When we\ ", ["popl/data/00001466.pdf"] = "COIIfierenCfi?\ Record\ of\ the\ Fifth\ AnnUal\ ACM\ Symposium\ on\ Principles", ["sigplan/2003/pdfs/sigp/944746/frontmatter.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ ICFP'03\ Proceedings of the\ Eighth ACM SIGPLAN International Conference on Functional Programming\ August 25-29, 2003 Uppsala, Sweden\ Sponsored by the\ Association for Computing Machinery Special Interest Group on Programming Languages (SIGPLAN)", ["soner-onder/iccl98a.ps"] = "Automatic Generation of Microarchitecture Simulators -Lambda\ Soner ¨\ Onder Rajiv Gupta\ Department of Computer Science\ University of Pittsburgh\ Pittsburgh PA 1--60\ fsoner,guptag@cs.pitt.edu\ ", ["popl/data/00001372.pdf"] = "MODE MODULES AS REPRESENTATIONS OF -- PRELIMINARY REPORT\ Alice Waltharn,\ E. Fischer Massachusetts and\ Massachusetts\ Institute\ Michael J. l?ischefi of Technology,\ Cambridge,\ Introduction High level programming languages tend to free a programmer from concern about the underlying machine structure ad permit him to talk about his problem domain in more direct terms. Thus, he may imagine that objects such as real numbers, character strings, and linear arrays really exist in the machine as atomic entities and he need not understand the details of how they are actually Of course represented in the machine. what distintiwishes various kinds of are the operations that may b objects performed on them, so when talking about the domain of real numbers, we should include the basic arithmetic operations and constants, and for strings, operations such as length, concatenation and indexing. existing languages do Unfortunately, not permit a programmer to ignore completely questions of representation, domain does not happen for if his problem\ to be included already in the repertoire of domains supported by the language, the programmer must figure out a representation himself and remember it throughout his programming effort. For example, a FORTRAN programmer may know that it is not meaningful to multiply two integers that happen to re resent gut he has no policy numbers, insurance way of informing the compiler of this fact . Many extensible languages do provide a wide range of data types including structured types, enabling a programmer", ["sigplan/2003/pdfs/topl/641909/p360-fournet.pdf"] = "Main TOC\ Transactions TOC\ Search\ Stack Inspection: Theory and Variants\ ´ CEDRIC FOURNET and ANDREW D. GORDON Microsoft Research\ Stack inspection is a security mechanism implemented in runtimes such as the JVM and the CLR to accommodate components with diverse levels of trust. Although stack inspection enables the fine-grained expression of access control policies, it has rather a complex and subtle semantics. We present a formal semantics and an equational theory to explain how stack inspection affects program behavior and code optimisations. We discuss the security properties enforced by stack inspection, and also consider variants with stronger, simpler properties. Categories and Subject Descriptors: D.3.1 [Programming Languages]: Formal Definitions and Theory; D.3.3 [Programming Languages]: Language Constructs and Features; F.3.1 [Logics and Meanings of Programs]: Specifying and Verifying and Reasoning about Programs; F.3.2 [Logics and Meanings of Programs]: Semantics of Programming Languages; F.3.3 [Logics and Meanings of Programs]: Studies of Program Constructs; K.6.5 [Management of Computer and Information Systems]: Security and Protection General Terms: Languages, Security, Theory Additional Key Words and Phrases: Access control, contextual equivalence, equational reasoning, operational semantics, stack inspection\ 1. SECURITY BY STACK INSPECTION? Stack inspection is a software-based access control mechanism. Its purpose is to allow components with diverse origins to share the same runtime and access its resources in a controlled manner, according to their respective levels of trust. It is a key security mechanism in typed runtime environments such as the JVM [Lindholm and Yellin 1997; Gong 1999] and the CLR [Box 2002; LaMacchia et al. 2002] that support distributed computation based on mobile code. It enables the fine-grained expression of access control policies, and hence is more liberal and flexible than a strict sandboxing mechanism. It has received much attention in the literature [Jensen et al. 1999; Erlingsson and Schneider", ["popl/abstract/00001692.pdf"] = "", ["norman-ramsey/c--rtia4.ps"] = "Machine­Independent Support for Garbage Collection,\ Debugging, Exception Handling, and Concurrency\ (Draft)\ Simon Peyton Jones\ University of Glasgow\ Norman Ramsey\ University of Virginia\ August 7, 1998\ ", ["sjaak-smetsers/bare93-typinggrs.ps.gz"] = "a#aaa\ Conventional and Uniqueness Typing\ in Graph Rewrite Systems\ Erik Barendsen Sjaak Smetsers\ University of Nijmegen \\Lambda", ["andrew-johnson/noweb_lj.pdf"] = "Literate Programming using noweb \ Andrew L. Johnson and Brad C. Johnson\ December 19, -000\ Introduction\ Let us change our traditional attitude to the construction of pro­\ grams: Instead of imagining that our main task is to instruct a com­\ puter what to do, let us concentrate rather on explaining to humans\ what we want the computer to do. (Donald E. Knuth, 1984).\ In essence, this is the purpose of literate programming (LP for short). Such\ ", ["popl/abstract/00001461.pdf"] = "", ["popl/data/00001639.pdf"] = "Structur'iil\ semantics for polymorphic (prclinlinilry rwport)\ data types\ Daniel\ l.eivtmt\ Computer\ Scicncc Dcpartrncnt Univctsity\ Carnegie-Mellon\ Introduction. lhcscmanti the ncd grmving cmodclin go fdatatypcshasbccn of applicative structured thcsubjcct ofincrcascd intcrcst ovcrthclastfcw\ years, cnhanccd by the dcvclopmcnt for flexible highly", ["jim-larus/eel.pdf"] = "EE\ L:\ M\ a\ c\ h\ i\ n\ e\ ", ["popl/data/00001719.pdf"] = "PROGRAM\ COMMITTEE'S\ REPORT\ The\ papers\ in this sponsored\ volume jointly\ were\ presented\ at the", ["jens-knoop/basic-dino.ps"] = "UNIVERSITaT PASSAU\ Fakult¨at f¨ur Mathematik und Informatik\ P\ Basic­block Graphs: Living Dinosaurs?\ Jens Knoop 1 , Dirk Kosch¨utzki, Bernhard Steffen\ Fakult¨at f¨ur Mathematik und Informatik\ Universit¨at Passau\ Innstraße 33\ D--9403- Passau\ ", ["popl/data/00001410.pdf"] = "TECHNIQUES FOR THE AUTOMATIC SLECTION OF DATA STRUCTURES James Low and Paul Rovner Computer Science Department University of Rochester Rochester, New York 14627", ["popl/data/00001497.pdf"] = "EFFICIENT\ ALGORITHMS", ["norman-ramsey/oxform.ps"] = "A Transformational Approach to\ Binary Translation of Delayed Branches\ (4980­word technical summary)\ Norman Ramsey\ Department of Computer Science\ University of Virginia, Charlottesville, VA --903 USA\ nr@cs.virginia.edu\ Cristina Cifuentes\ Department of Computer Science and Electrical Engineering\ ", ["steven-muchnick/dbxtool.djvu"] = "SOFTWARE--PRACTICE AND EXPERIENCE, VOL. 16(7), 653-669 (JULY 1986) \ Dbxtool: A \ Debugger \ Window-Based Symbolic \ for Sun Workstations* \ EVAN ADAMS AND STEVEN S. MUCHNICK \ Sun 3Iicrosystems, Inc., 2550 Garcia Average, Mountain 17ew, C4 94043, U.S.A. \ SUMMARY \ Dbxtool is a window- and mouse-based debugger for C, Pascal and FORTRAN programs running \ on Sun workstations. Its use of the mouse as the primary input mechanism eliminates the need ", ["simon-peyton-jones/fc-icfp.ps"] = "System F with Type Equality Coercions\ Martin Sulzmann\ School of Computing\ National University of Singapore\ sulzmann@comp.nus.edu.sg\ Manuel Chakravarty\ Programming Languages and Systems\ Computer Science & Engineering\ chak@cse.unsw.edu.au\ ", ["popl/data/00001376.pdf"] = "PROCEDURELINKAGE OPTIMIZATION WORKING PAPER A. Nlaggiolo-Schettini Laboratorio 80072 Arco B. K, Rmen di Cibernetica Felice, ITALY and l!. R. Strong\ IBM `Ihomas J. Watson Research Center Yorktown Heights, New York 10598, U.S.A.\ ABsTRAcr:\ This paper discusses the desirability of procedure linkage optimization and sketches a general theory of interpretive semantics which is motivated by technical problems in specifying and validating program transfonnations that optimize One particular transformation procedure linkages. is treated in detail. Recursive ALGOL 60 procedures sometimes pass parameters by name in such away that the general thunk mxhanism is unnecessary and inefficient. We present an optimization which detects this kind of call-by-name and implements it thanklessly. We prove that the transformation preserves semantics and we discuss the effect on running time and menm-y management.\ some mathematical representation of programs both before and after application of optimizing The mathematical framework transfonnations. should be helpful in proving that \"optimized\" programs really do compute what the progranuner intended. None of the available semantic theories are suite right for Drocedure linkage optimization, sowe have assembled yet another interpretive semantics from ideas present in various places in the literature, particularly [2, 8, 13]. This theory of semantics is in Section 3, after a condensed discussion sketched of an unusual representation of programs in Section 2. Section 4 deals with one particular Section optimization: thunkless call-by-name, Section 5 sketches further work in progress. 6 conpares the semantic theory used here with other work. 2. TREE STFUCIVREI)WPJ3S.\ 1.\ M.YTIVATION AND OVERVIEW.\ in procedural languages Programs written can devote a substantial portion of their running time to procedure entry and exit, In a language with recursion and block structure the linkages producedby a straightforward compilation may be unnecessarily costly, For example, a variable local to a procedure may be conscientiously stacked during a recursive but then not be used anywhere after call the call, An optimizing compiler should detect and remove many instances of unnecessary stacking and similar inefficiencies. Procedure linkage optimization is especially important for large progrming tasks where Parnas [9] mdularization is critical. has shown that the goals of modularization are often best served when the modules do not correspond to the boxes in a flowchart ~the process being progr.snnned, He points out that the \"information hiding\" criterion has one major drawback: without he proposes intensive optimization of procedure linkages, a system modularized according to this criterion is \"much less efficient\" than one modularized according to major stages in processing [9, To this we add that the procedures page 1057]. in a system modularized according to \"information hiding\" are likely to be recursive. Recursive procedures cannot be eliminated by simple macroexpansion of calls, so other means of optimization mustbe explored. A theory of optimization requires\ o-f statements and expressions The nesting within each other and the roles of each part in the whole are naturally expressed by a tree structure with labelled nodes and an ordering on the children of each node, as in\ text:", ["sigplan/2003/pdfs/sigp/773039/p163-dice.pdf"] = "Main TOC\ Newsletter TOC Search Accepted for publication in ISMM `02. File=lfmalloc-ismm02-camera-c Last Revised\ 02.05.23 1:17 AM\ Select text and change font color to \"WHITE\" to make invisible for final camera-ready copy. Paper #02.\ Mostly Lock-Free Malloc\ Dave Dice\ Sun Microsystems, Inc. Burlington, MA dice@computer.org\ Alex Garthwaite\ Sun Microsystems Laboratories Burlington, MA alex.garthwaite@sun.com", ["sigplan/2003/pdfs/sigp/944579/p12-christopher.pdf"] = "Main TOC\ Newsletter TOC\ Search\ In Parallel\ AMDC Implementation\ Editor: Thomas W. Christopher, 1140 Portland Place #205, Boulder, CO 80304 ; tc@toolsofcomputing.com\ Details On A Simple Parallel System\ Thomas W. Christopher\ In the previous column, we gave an overview of AMDC (\"Active-Message-Driven Computing\"), a completely message-driven parallel computing system. This column, we look more closely at an implementation requiring under four pages of Python. The underlying idea is that messages are sent to locations where they execute a script, operating on the data they have brought and whatever data has been left there by previous messages. In the pure form, there are no user level processes sending the messages, only the scripts the messages themselves execute at locations. (In practical terms, at least one user process would be involved to start the system running and send the first messages. That and other processes or threads would be used for tasks that can be programmed more easily sequentially, such as I/O and human interaction.) The locations are named with structured names. The locations of a distributed, two dimensional array can have names composed of triples (arrayName, rowIndex, columnIndex). The locations are dynamic, coming into existence when the first message arrives and remaining as long as there is any reason to keep them, e.g. there are messages or data present. In our prototype, sequential implementation in Python, a location name can be any object that can be used as a key in a dictionary. When a location is present, it is represented by an object of class Mailbox which has five components: name, the name of the location; inQ, a queue of arriving messages; delayQ, a queue of messages that are to be submitted for execution later; mstore, a dictionary of data left at the location by previous messages; and in use, a count used to lock the location in existence. Messages are of subclasses of the class Message. They override the method script(mbox) to specify their behavior at a location. When a message is sent to a location with name N, the system looks up the mailbox with name N. If name N does not already exist in the system's mailboxes dictionary, an empty mailbox is inserted for it. The message is placed at the end of the location's inQ. If the inQ was previously empty, the location has become executable, so it is placed on the system's dispatch queue. The dispatch loop (slightly simplified) is: while dispatchQ : mb=dispatchQ.get() msg=mb.inQ.get() try: msg.script(mb) except: traceback.print_exc() if mb._needsScheduling(): dispatchQ.put(mb) elif not mb._needsPreserving(): del mailboxes[mb.name] The dispatcher repeatedly removes the first mailbox from the dispatch queue, removes the first message from its inQ, and calls the message's script() method, passing it the mailbox as a parameter. The try-except handles the case where the script crashes. Finally, if the mailbox needs to be rescheduled (its inQ is not empty), it is reinserted in the dispatch queue, or if there is no reason to preserve the mailbox, it is deleted. Since the fields of mailboxes are accessible to their users, it is possible to get pointers to the queues and mstore and manipulate them directly, but mailboxes have a number of methods to deal with their customary use. The method deliver(msg) places nessage msg at the end of inQ. This is used by the system to deliver messages and by message scripts themselves, for example, to send messages to their own location or to resubmit themselves for further processing later. Method dispatch(msg) places message at the head of inQ, giving it priority over incoming messages. Method delay(msg) inserts msg at the end of delayQ to be processed later. Method redispatchAll() removes all messages from delayQ and inserts them at the front\ ACM SIGPLAN Notices", ["sigplan/2003/pdfs/proceeding/888251/p67-damiani.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Rank 2 Intersection Types for Modules\ Ferruccio Damiani\ Dipartimento di Informatica, Universita di Torino ` Corso Svizzera 185 10149 Torino, Italy", ["popl/abstract/00001411.pdf"] = "", ["popl/abstract/00001506.pdf"] = "", ["norman-ramsey/widen.ps"] = "Widening Integer Arithmetic\ Kevin Redwine and Norman Ramsey\ Division of Engineering and Applied Sciences\ Harvard University\ {redwine,nr}@eecs.harvard.edu\ Reprinted from the 13th International Conference on Compiler Construction\ Abstract. Some codes require computations to use fewer bits of preci­\ sion than are normal for the target machine. For example, Java requires\ 3-­bit arithmetic even on a 64­bit target. To run narrow codes on a wide\ ", ["popl/abstract/00001633.pdf"] = "", ["norman-ramsey/match.pdf"] = "When Do Match-Compilation Heuristics Matter?\ Kevin Scott and Norman Ramsey Department of Computer Science University of Virginia jks6b@cs.virginia.edu nr@cs.virginia.edu May 2000", ["popl/data/00001505.pdf"] = "Program\ Improvement WNiam\ by Internal L. Scherlis *\ Specialization\ Computer Science Department Stanford University", ["sigplan/2003/pdfs/sigp/640136/backmatter.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Author Index\ Ahmed, A......................................................... 74 Amtoft, T.......................................................... 86 Calcagno, C...................................................... 62 Cardelli, L. ....................................................... 62 Cheng, P........................................................... 98 Crary, K.................................................... 98, 109 Dreyer, D.......................................................... 98 Elsman, M. ..................................................... 123 Flanagan, C. ....................................................... 1 Gordon, A. D.................................................... 62 Grossman, D. ................................................... 13 Harper, R.......................................................... 98 Jones, S. P. ....................................................... 26 Kobayashi, N.................................................... 50 Lämmel, R........................................................ 26 Muller, R. ......................................................... 86 Park, S.............................................................. 38 Petersen, L........................................................ 98 Qadeer, S............................................................ 1 Vanderwaart, J. C..................................... 98, 109 Walker, D......................................................... 74\ 135", ["popl/abstract/00001466.pdf"] = "", ["jack-davidson/po-corr.pdf"] = "C\ O\ R\ R\ I\ G\ E\ N\ D\ ", ["popl/data/00001440.pdf"] = "GENERALIZED\ LEFT\ CORNER\ PARSING\ Alan\ Cornell Ithacar\ J.\ N.\ Demers University Y. 14853\ 1. -- Brosgol that by rules each before in its read; corner\" these specify rule to the special conventional grammar ponent others in In [AU] This Section GLC LR(k) large. to background defines parsing to ably attention the resulting splitting grammars parsed . paper 2 and technique we be LR, the an right and has techniques arbitrarily position left LL, cases. LC, the rule the LR parsing positions are", ["david-detlefs/pldi98.ps.gz"] = "Garbage Collection and Local Variable Type­Precision and Liveness\ in Java TM Virtual Machines\ Ole Agesen and David Detlefs\ Sun Microsystems Laboratories\ - Elizabeth Drive\ Chelmsford, MA 018-4, USA\ ole.agesen@sun.com, david.detlefs@sun.com\ J. Eliot B. Moss\ Department of Computer Science\ ", ["sigplan/2003/pdfs/proceeding/944705/p263-shinwell.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ FreshML: Programming with Binders Made Simple\ Mark R. Shinwell Andrew M. Pitts Murdoch J. Gabbay\ {Mark.Shinwell,Andrew.Pitts,Murdoch.Gabbay}@cl.cam.ac.uk\ Cambridge University Computer Laboratory, Cambridge, CB3 0FD, UK", ["simon-peyton-jones/conc-ffi.ps"] = "Extending the Haskell Foreign Function Interface with\ Concurrency\ Simon Marlow and Simon Peyton Jones\ Microsoft Research Ltd., Cambridge, U.K.\ fsimonmar,simonpjg@microsoft.com\ Wolfgang Thaller\ wolfgang.thaller@gmx.net\ ", ["popl/abstract/00001390.pdf"] = "", ["benjamin-pierce/choice.ps.gz"] = "Decoding Choice Encodings -Lambda\ Uwe Nestmann y Benjamin C. Pierce z\ April 1996\ ", ["bernhard-westfechtel/CW96a.ps.gz"] = "Version Models for Software Configuration\ Management\ Reidar Conradi, Trondheim -Lambda\ Bernhard Westfechtel, Aachen y\ Technical Report AIB 96­10, RWTH Aachen\ October --, 1996\ ", ["popl/abstract/00001410.pdf"] = "", ["cristina-cifuentes/callrecovery.ps.gz"] = "The UQ Retargetable Binary Translator\ Principal Investigators\ Cristina Cifuentes\ Centre for Software Maintenance\ Department of Computer Science and Electrical Engineering\ The University of Queensland\ Norman Ramsey\ Department of Computer Science\ University of Virginia\ ", ["popl/abstract/00001514.pdf"] = "", ["matthew-flatt/Jiazzi.pdf"] = "Jiazzi: New­Age Components for Old­Fashioned Java\ Sean McDirmid, Matthew Flatt, Wilson C. Hsieh\ School of Computing\ University of Utah\ #mcdirmid,mflatt,wilson#@cs.utah.edu\ ", ["sigplan/2003/pdfs/sigp/944579/p55-stephens.pdf"] = "Main TOC\ Newsletter TOC\ Search\ XVF: C++ Introspection by Extensible Visitation", ["chris-van-wyk/p1000-van_wyk.pdf"] = "l\ i\ t\ e\ r\ a\ t\ e\ M\ ", ["andrew-appel/appel92critique.ps.gz"] = "A Critique of Standard ML\ Andrew W. Appel\ 3\ Princeton University\ revised version of CS­TR­364­9-\ November 1-, 199-\ ", ["popl/abstract/00001713.pdf"] = "", ["norman-ramsey/concurrent.ps"] = "Concurrent programming in ML\ Norman Ramsey -Lambda\ Department of Computer Science, Princeton University\ 3- Olden Street\ Princeton, New Jersey 08-44\ April 1990\ ", ["popl/data/00001445.pdf"] = "MINIMAL\ AND OPTIMAL\ COMPUTATIONS\ OF RECURSIVE\ PROGRAMS.\ G6rard\ Berry,\ Ecole L6vy, Chesnay,\ des\ Mines", ["neal-glew/mcrt/Id/p230-ariola.pdf"] = "P\ ­\ T\ A\ C\ :\ A\ P\ a\ r", ["popl/data/00001412.pdf"] = "BINDING\ TIME\ OPTIMIZATION\ IN\ PROGRAMMING OF AN IDEAL\ LANGUAGES: LANGUAGE*\ SOME THOUGHTS\ TOWARD THE DESIGN\ Neil D. Jones Department The Lawrence,\ & Steven S. Muchnick of Computer Science of Kansas Kansas 66045", ["popl/data/00001695.pdf"] = "An Efficient Way to Find the Side Effects of Procedure Calls and the Aliases of Variables\ ~\ John Stanford Linear ~tanford,\ P.\ Banning\ + Center 94305\ Accelerator California\ Introduction\ Often when we are analyzing a program, for instance to gather information for optimizing transformations, we need to know the effect of executing some element of the program on the program's variables. In the simplest might want to case, we know what variables might be modified or referenced by the execution of a statement. The presence of procedures and procedure calls in a language complicates this analysis in two ways. The first and most obvious way is that it is not apparent from looking at a call on a procedure what effect executing that call will have on variables. This is determined by the procedures which might be executed as a result of making the call. Thus the execution of a procedure can have a side effect on variables at the point from ah the procedure is called. The passing second way is that mechanisms associated the parameter with proce-\ thods will find, using one pass over the text a program, flow insensitive side effects (defined below) and @ssible aliases. They will do this p~ecisely up to symbolic execution for block-structured programs which have recursion and reference parameters. The basic methods can be to cover flow sensitive side efextended fects (with some 10ss of precision), exits from procedures (at the expense of an additional pass over the program), procedure parameters (with some restrictions), and a number of other features and constructs including dynamic naming, structured variables, and certain kinds of pointer variables. We will discuss flow sensitive side effects here; remaining the extensions are covered in [BAN781. The basic method for finding side effects involves solving a flow problem on s graph. The graph's nodes correspond to to calls between procedures and the edges procedures. Associated with each edge is a function which describes how the calling procedure's side effect depends on the of the called procedure. By side effect solving this problem (by any of a number of well known methods used in global flow - see [uLL751) analysis we assign to each a generalized procedure for side effect the corresponding procedure. The side efa procedure can easily fects of a call on be derived from the procedure's generalized side effect. The basic method for finding aliases, which is completely separate from the side calculation, involves a single effect global computation which finds all pairs of possible aliases. As explained in Section 1.3, pairs of aliases are either (e. g. x is an alias of x) or they trivial derive from another pair of aliases through the action of a call. The heart of method is a recursive the routine which, given a pair of variables which are possible aliases, finds the other all pairs of possible aliases which are created from the original pair (and calls itthese new pairs). self with The routine is started by calling it the with all trivial pairs of aliases.", ["jwd/CS-94-42.ps.gz"] = "Target­specific Global Code Improvement: Principles and Applications\ Department of Computer Science\ University of Virginia\ Charlottesville, VA --903\ Current and future high-performance systems require language processors that can generate code that fully exploits\ the power of the underlying architecture. A key and necessary component of such language processors is a global code\ improver. This article describes the key principles behind the design and implementation of a global code improver\ that has been use to construct several high-quality compilers and other program transformation and analysis tools. The\ code improver, called vpo, employs a paradigm of compilation that has proven to be flexible and adaptable---all code\ ", ["michael-summers/minority.djvu"] = "ITY \ ring \ Engineers \ Scientists \ eting high-achieving \ Of \ .Other \ d \ .on \ sional programs (41% to Ph.D.' or M.D.-Ph.D., ", ["popl/abstract/00001542.pdf"] = "", ["sigplan/2003/pdfs/proceeding/604131/p224-xi.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Guarded Recursive Datatype Constructors\ Hongwei Xi Chiyan Chen Boston University\ {hwxi, chiyan, gangchen}@cs.bu.edu\ Gang Chen", ["popl/abstract/00001384.pdf"] = "", ["popl/data/00001457.pdf"] = "Conference\ Record\ of\ the\ Fifth\ Annual\ ACM\ Symposium\ on\ Principles", ["sigplan/2003/pdfs/proceeding/604131/p50-schmitt.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ The M-calculus: A Higher-Order Distributed Process Calculus\ Alan Schmitt\ INRIA\ Jean-Bernard Stefani\ INRIA\ alan.schmitt@inria.fr", ["andreas-zeller/tr-96-01.pdf"] = "Unified Versioning through Feature Logic\ Andreas Zeller and Gregor Snelting\ Informatik­Bericht No. 96­01\ ˜\ Uberarbeitete Fassung, 1-. Februar 1997\ Copyright c 1997 Institut f˜ur Programmiersprachen und Informationssysteme\ Abteilung Softwaretechnologie\ Technische Universit˜at Braunschweig\ B˜ultenweg 88\ ", ["dawson-engler/tse-magik.ps.gz"] = "Interface Compilation:\ Steps toward Compiling Program Interfaces as Languages\ Dawson R. Engler\ Computer Science Laboratory\ Stanford University\ Stanford, CA 9430-, U.S.A\ engler@stanford.edu\ ", ["popl/abstract/00001556.pdf"] = "", ["popl/data/00001701.pdf"] = "THE\ LOGIC\ OF A RELATIONAL\ DATA\ MANIPULATION\ LANGUAGE\ Marco\ A.\ Casanova* Aiken Harvard Cambridge,\ and", ["popl/data/00001411.pdf"] = "A Methodology\ for LISP\ Program\ Construction\ from\ Examplesl'\ Phlllip D. Summers Computer Sciences Department\ IBM Thomas J. Watson Research Center P. O. Box218 Heights, New York 10598\ Yorktown\ 1. Introduction:", ["popl/data/00001503.pdf"] = "Paths:", ["popl/abstract/00001452.pdf"] = "", ["popl/abstract/00001445.pdf"] = "", ["marie-desjardins/advice.ps.gz"] = "How to Succeed in Graduate School:\ A Guide for Students and Advisors\ Submitted to Crossroads, October 1994\ Marie desJardins\ marie@erg.sri.com\ ", ["popl/abstract/00001709.pdf"] = "", ["popl/data/00001690.pdf"] = "FOREWORD\ The Symposium\ papers on\ in\ this of\ volume\ were\ contributed Languages,\ for\ presentation", ["popl/abstract/00001428.pdf"] = "", ["sigplan/2003/pdfs/proceeding/944705/p1-knight.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Invited Talk\ Conservation of Information: Applications in Functional, Reversible, and Quantum Computing\ Thomas Knight, Jr.\ Massachusetts Institute of Technology tk@ai.mit.edu", ["popl/data/00001549.pdf"] = "A Semantics-Directed\ Compiler\ Generator\ Lawrence Paulson Department of Computer Science Stanford University\ Current address: Computer Laboratory, University of Cambridge, CambridgeCB23QG, U. K,\ Work supported in pat by Advanced Reseazch Projects Agency Corstr@ MDA 903-76-C-02306and Joint ServicesElectronics Progrsru Cmrtmt DAAG 2979-C4047.\ 1. Introduction", ["rob-ocallahan/hybrid.ps"] = " \ \ \ \ \ \ \ \ \ ", ["sigplan/2003/pdfs/sigp/949343/backmatter.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Author Index\ Allen, E.............................................................96 Azatchi, H.......................................................269 Bacon, D. F.....................................................241 Bannet, J. ..........................................................96 Barabash, K. ...................................................255 Bäumer, D. .......................................................13 Black, A. P........................................................47 Blackburn, S. M..............................................344 Boyapati, C.....................................................403 Cahill, V. ............................................................1 Caromel, D. ......................................................27 Cartwright, R. ...................................................96 Chambers, C. ..........................................205, 224 Chen, G...........................................................282 Clarke, D. .......................................................374 Cointe, P. ..........................................................27 Corwin, J. .......................................................241 De Bosschere, K. ............................................169 Demsky, B. .......................................................78 Diwan, A. .......................................................359 Driesen, K.......................................................149 Ducasse, S. .................................................47, 65 Dufour, B........................................................149 Eeckhout, L. ...................................................169 Fähndrich, M. .................................................302 Fraser, K. ........................................................388 Garcia, R.........................................................115 Georges, A......................................................169 Gohda, O. .......................................................187 Grove, D. ........................................................241 Harris, T. ........................................................388 Hendren, L......................................................149 Hertz, M. ........................................................359 Hirzel, M. .......................................................359 Inagaki, T........................................................187 Irwin, M. J. .....................................................282 Ishizaki, K. .....................................................187 Järvi, J.............................................................115 Kandemir, M. .................................................282 Kawachiya, K. ................................................187 Kawahito, M...................................................187 Kiezun, A..........................................................13 Komatsu, H.....................................................187 Koseki, A........................................................187 Lafferty, D. .........................................................1 LaMarca, A.....................................................205 Lee, K. ............................................................205 Leino, K. R. M................................................302 Levanoni, Y. ...................................................269 Liskov, B. .......................................................403 Lumsdaine, A. ................................................115 Marinov, D. ....................................................313 Mathiske, B.....................................................282 McKinley, K. S...............................................344 Millstein, T. ....................................................224 Moh, C.-H.......................................................403 Moss, J. E. B...................................................326 Mougin, P. ........................................................65 Murthy, C. ......................................................241 Nakatani, T. ....................................................187 Noble, J...........................................................374 Noyé, J..............................................................27 O'Callahan, R. ................................................313 Ogasawara, T..................................................187 Ogata, K..........................................................187 Onodera, T......................................................187 Ossia, Y. .........................................................255 Palsberg, J.......................................................135 Paz, H. ............................................................269 Petrank, E. ..............................................255, 269 Reay, M. .........................................................224 Richman, S. ....................................................403 Richmond, M..................................................374 Rinard, M..........................................................78 Rustan M. Leino, K. .......................................302 Sachindran, N. ................................................326 Schärli, N..........................................................47 Shrira, L..........................................................403 Siek, J. ............................................................115 Suganuma, T...................................................187 Takeuchi, M....................................................187 Tanter, É. .........................................................27 Tip, F. ...............................................................13 Verbrugge, C. .................................................149 Vijaykrishnan, N.............................................282 Vitek, J............................................................135 Willcock, J......................................................115 Wolczko, M. ...................................................282 Yasue, T..........................................................187 Zhao, T. ..........................................................135\ 418", ["popl/abstract/00001509.pdf"] = "", ["popl/abstract/00001413.pdf"] = "", ["popl/data/00001560.pdf"] = "IS\ THE\ INTERESTING\ pART\ OF\ PROCESS\ LOGIC\ UNINTERESTING?:\ A\ TRANSLATION", ["sigplan/2003/pdfs/proceeding/944705/p79-page.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Software is Discrete Mathematics\ Rex L Page\ University of Oklahoma School of Computer Science Norman OK 73019 USA +1 405-325-5408", ["caroline-tice/thesis.pdf"] = "Non­Transparent Debugging of Optimized Code\ Caroline Mae Tice\ Report No. UCB//CSD­99­1077\ November 1999\ Computer Science Division (EECS)\ University of California\ Berkeley, California 947-0\ \ Non­Transparent Debugging of Optimized Code\ ", ["mixins/zucca.ps"] = "", ["norman-ramsey/lpsimp.pdf"] = "", ["guido-araujo/expression.ps.gz"] = "O conteudo do presente relatorio e de unica responsabilidade do(s) autor(es).\ The contents of this report are the sole responsibility of the author(s).\ Expression Tree Based Algorithms for Code\ Compression on Embedded RISC\ Architectures\ Guido Araujo Paulo Centoducatte\ Rodolfo Azevedo Ricardo Pannain\ Relatorio Tecnico IC{00-01\ Janeiro de -000\ ", ["sigplan/2003/pdfs/topl/945885/p876-choi.pdf"] = "Main TOC\ Transactions TOC\ Search\ Stack Allocation and Synchronization Optimizations for Java Using Escape Analysis\ JONG-DEOK CHOI, MANISH GUPTA, MAURICIO J. SERRANO, and VUGRANAM C. SREEDHAR IBM SAMUEL P. MIDKIFF Purdue University", ["todd-proebsting/case.ps.gz"] = "Correction to\ Producing Good Code for the Case Statement\ Sampath Kannan and Todd A. Proebsting\ Department of Computer Science\ University of Arizona\ Tucson, Arizona 8-7-1 U.S.A.\ Summary\ An O(n - ) algorithm for splitting a case statement's jump table into the minimum number of sub­tables (of\ a given density) is presented. Previously, the problem was thought to be NP­complete.\ ", ["popl/abstract/00001482.pdf"] = "", ["popl/abstract/00001486.pdf"] = "", ["john-ellis/gc.ps.gz"] = "Safe, Efficient Garbage Collection for C++\ John R. Ellis and David L. Detlefs\ June 1, 1993\ \ Copyright ã 1993 by Digital Equipment Corporation and Xerox Corporation.\ This work may not be copied or reproduced in whole or in part for any commercial purpose.\ Permission to copy in whole or in part without payment of fee is granted for nonprofit\ educational and research purposes provided that all such whole or partial copies include the\ following: a notice that such copying is by permission of the Systems Research Center of Digital\ ", ["popl/abstract/00001522.pdf"] = "", ["norman-ramsey/custom.ps"] = "Submitted to Proceedings of the ACM SIGPLAN '03 Conference on Programming Language Design and Implementation\ Custom Calling Conventions in a Portable Assembly Language\ Norman Ramsey Christian Lindig\ Division of Engineering and Applied Sciences\ Harvard University\ nr@eecs.harvard.edu lindig@eecs.harvard.edu\ ", ["emmett-witchel/simos.ps.gz"] = "Complete Computer System Simulation: The SimOS Approach Page 1\ ACCEPTED FOR PUBLICATION IN IEEE Parallel and Distributed Technology ­ This is not the final version.\ Complete Computer System Simulation: The SimOS Approach\ Mendel Rosenblum, Stephen A. Herrod, Emmett Witchel, and Anoop Gupta\ Computer Systems Laboratory\ Stanford University\ {mendel, herrod, witchel, gupta}@cs.stanford.edu\ Abstract:\ The complexity of modern computer systems, coupled with the diverse workloads that they must support, pre­\ ", ["don-batory/tosem92.ps"] = "To Appear, ACM Transactions on Software Engr. and Methodology, October 199-.\ The Design and Implementation of Hierarchical\ Software Systems With Reusable Components +\ Don Batory and Sean O'Malley\ Department of Computer Sciences\ The University of Texas\ Austin, Texas 7871-\ ", ["popl/data/00001550.pdf"] = "Semantics-Directed\ Machine by Mitchell Wand\ Architecture\ Computer Science Department Indiana University Bloomington, Indiana 47405", ["popl/abstract/00001393.pdf"] = "", ["popl/abstract/00001546.pdf"] = "", ["sigplan/2003/pdfs/proceeding/774833/p57-reiss.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Visualizing Java in Action\ Steven P. Reiss Department of Computer Science Brown University Providence, RI 02912-1910 401-863-7641, FAX: 401-863-7657 spr@cs.brown.edu", ["popl/abstract/00001534.pdf"] = "", ["jack-davidson/po.pdf"] = "T\ h\ e\ D\ s\ i\ g\ n\ a\ ", ["popl/abstract/00001385.pdf"] = "", ["popl/abstract/00001535.pdf"] = "", ["mads-tofte/kit.ps"] = "APPENDIX B. THE STATE OF THE SYSTEM 11-\ probably be done for exception and data constructors printed at top­level. Similarly,\ we could insist that values whose data constructors are completely inaccessible be\ printed opaquely; this would implement abstype properly.\ Redefinition of ref. The Kit currently allows redefinition of ref as a data constructor\ (which is a problem since application of ref must be treated specially) and also as a\ type constructor (which is a problem since equality admission regards ref specially).\ Treatment of Match and Bind. Although Match and Bind are defined in the prelude,\ they are not raised by inexhaustive pattern matches and bindings.\ ", ["matthias-felleisen/prompts.djvu"] = "The Theory and Practice of First-Class Prompts \ Matthias Felleisen \ Indiana University \ Computer Science Department \ Lindley Hall 101 \ Bloomington, IN 47405 ", ["andrew-appel/simple-gen.ps"] = "Simple Generational Garbage Collection and Fast Allocation\ Andrew W. Appel\ Department of Computer Science\ Princeton University\ Princeton, NJ 08-44\ March 1988\ revised September 1988\ ", ["stephen-gilmore/tutorial.ps.gz"] = "Programming in Standard ML '97:\ A Tutorial Introduction\ Stephen Gilmore\ Laboratory for Foundations of Computer Science\ The University of Edinburgh\ September 1997\ (Revised: July 1998, April -000)\ \ Copyright notice\ ", ["sigplan/2003/pdfs/proceeding/871895/p88-faxen.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Haskell and Principal Types\ Karl-Filip Faxen ´\ Dept. of Microelectronics and Information Technology, KTH, Stockholm\ kff@it.kth.se", ["sigplan/2003/pdfs/sigp/844091/p13-frenger.pdf"] = "Main TOC\ Newsletter TOC\ Search\ Forth\ Forth Report\ Editor: Paul Frenger, P.O. Box 820506, Houston, TX 77282; pfrenger@alumni.rice.edu\ Evaluating Forth in the Windows Environment\ Paul Frenger\ 1\ Forth (At Last) Does Windows", ["rex-page/EngrSwFDPE05.pdf"] = "© ACM, -00-. This is the author's version of the work.\ It is posted here by permission of ACM for your personal use. Not for redistribution.\ The definitive version was published in Proceedings of FDPE 0-, {Sep -00-} http://doi.acm.org/10.114-/108-114.108-1-3\ Engineering Software Correctness\ Rex Page\ University of Oklahoma\ School of Computer Science\ Norman OK USA\ 1 40- 3-- -048\ ", ["popl/abstract/00001479.pdf"] = "", ["phil-wadler/failure.djvu"] = "How to Replace Failure by a List of Successes \ A method for exception handling backtracking and pattern matching \ in lazy functional languages \ Philip Wadler \ Programming Research Group, Oxford University \ 11 Keble Road, Oxford, OX1 3QD ", ["popl/data/00001444.pdf"] = "soclAL\ pROCESSES\ AND\ pROOFS A.\ OF THEOREMS DeMillo* of Technology Alan J.\ AND\ PROGRAMS\ +\ Georgia Richard\ Richard Institute J. Lipton Yale", ["stephen-gilmore/ECS-LFCS-97-378.dvi"] = "\ Dynamic ML without Dynamic Types\ Stephen Gilmore, Dilsun Kirli and Christopher Walton\ \ Laboratory for Foundations of Computer Science\ \ Department of Computer Science\ \ The University of Edinburgh\ ", ["sigplan/2003/pdfs/proceeding/781498/p61-kim.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Exploiting Task-level Concurrency in a Programmable Network Interface\ Hyong-youb Kim, Vijay S. Pai, and Scott Rixner Rice University\ hykim, vijaypai, rixner @rice.edu", ["sigplan/2003/pdfs/sigp/885638/p40-ortin.pdf"] = "Main TOC\ Newsletter TOC\ Search", ["sigplan/2003/pdfs/proceeding/871895/p84-ennals.pdf"] = "Main TOC\ Proceedings TOC\ Search\ HsDebug : Debugging Lazy Programs by Not Being Lazy\ Robert Ennals\ Computer Laboratory, University of Cambridge\ Simon Peyton Jones\ Microsoft Research Ltd, Cambridge\ Robert.Ennals@cl.cam.ac.uk\ simonpj@microsoft.com", ["frank-pfenning/handbook00.ps.gz"] = "Chapter 1\ Logical frameworks\ Frank Pfenning\ Second readers: Robert Harper, Don Sannella, and Jan Smith.\ Contents\ 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3\ - Abstract syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . -\ -.1 Uni­typed representations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6\ -.- Simply­typed representation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8\ ", ["popl/data/00001486.pdf"] = "Prime\ Subprogram\ Robert Computer\ Parsing\ E. Ta~an t\ of a Program\ Science\ Department\ Stanford Jacobo Department of Electrical\ University Valdesfl and Computer Science", ["popl/abstract/00001485.pdf"] = "", ["olivier-danvy/BRICS-RS-98-12.dvi"] = "\ Functional Unparsing *\ Olivier Danvy\ \ BRICS y\ \ Department of Computer Science\ \ University of Aarhus z\ ", ["sigplan/2003/pdfs/proceeding/604131/p213-boyapati.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Ownership Types for Object Encapsulation\ Chandrasekhar Boyapati\ Laboratory for Computer Science Massachusetts Intitute of Technology Cambridge, MA 02139 chandra@lcs.mit.edu\ Barbara Liskov\ Laboratory for Computer Science Massachusetts Intitute of Technology Cambridge, MA 02139 liskov@lcs.mit.edu\ Liuba Shrira", ["sigplan/2003/pdfs/proceeding/949305/p388-harris.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Language Support for Lightweight Transactions\ Tim Harris\ University of Cambridge Computer Laboratory 15 JJ Thomson Avenue Cambridge, UK, CB3 0FD\ Keir Fraser\ University of Cambridge Computer Laboratory 15 JJ Thomson Avenue Cambridge, UK, CB3 0FD\ tim.harris@cl.cam.ac.uk", ["norman-ramsey/developing.ps"] = "Developing Formally Verified Ada Programs -Lambda\ Norman Ramsey y\ Odyssey Research Associates\ October 10, 1988\ ", ["sigplan/2003/pdfs/proceeding/888251/p160-hirschowitz.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Compilation of Extended Recursion in Call-by-Value Functional Languages\ Tom Hirschowitz INRIA Rocquencourt\ Tom.Hirschowitz@inria.fr\ Xavier Leroy INRIA Rocquencourt\ Xavier.Leroy@inria.fr\ J. B. Wells Heriot-Watt University\ jbw@macs.hw.ac.uk", ["sigplan/2003/pdfs/proceeding/780732/p59-ananian.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Data Size Optimizations for Java Programs\ Laboratory for Computer Science Massachusetts Institute of Technology Cambridge, MA 02139\ C. Scott Ananian\ Laboratory for Computer Science Massachusetts Institute of Technology Cambridge, MA 02139\ Martin Rinard", ["sigplan/2003/pdfs/proceeding/949305/p115-garcia.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ A Comparative Study of Language Support for Generic Programming\ Ronald Garcia Jaakko Jarvi Andrew Lumsdaine ¨ Jeremy Siek Jeremiah Willcock\ Open Systems Lab Indiana University Bloomington Bloomington, IN USA\ {garcia,jajarvi,lums,jsiek,jewillco}@osl.iu.edu", ["jeffrey-chase/user-level.ps.gz"] = "User­Level Threads and Interprocess Communication\ Michael J. Feeley, Jeffrey S. Chase, and Edward D. Lazowska\ Department of Computer Science and Engineering, FR­3-\ University of Washington\ Seattle, WA 9819-\ Technical Report 93­0-­03\ ", ["neal-glew/mcrt/Polyphonic C#/polyphonypaged.pdf"] = "################# ############ ### # #\ #### ######\ ## ######## ####### #######\ ######### ########\ ########## ##\ ############### ######## # #\ ########\ ########### # ## ## ######### ##\ #### # ######## #### ###\ ############ ########### ########### ##### ## ### ####", ["sigplan/2003/pdfs/sigp/944579/p37-iliasov.pdf"] = "Main TOC\ Newsletter TOC\ Search\ Templates-based portable Just-In-Time compiler", ["norman-ramsey/relocating-pldi.ps"] = "Reprinted from Proceedings of the ACM SIGPLAN '96 Conference on Programming Language Design and Implementation\ Relocating Machine Instructions by Currying\ Norman Ramsey\ Department of Computer Sciences, Purdue University\ 1398 Computer Science Building, West Lafayette, IN 47907\ nr@cs.purdue.edu http://www.cs.purdue.edu/homes/nr\ ", ["bob-harper/hom-popl.ps"] = "A Type System for Higher­Order Modules #\ Derek Dreyer Karl Crary Robert Harper\ School of Computer Science\ Carnegie Mellon University\ Pittsburgh, PA 1--13\ {dreyer,crary,rwh}@cs.cmu.edu\ ", ["sigplan/2003/pdfs/sigp/772970/frontmatter.pdf"] = "Main TOC\ Newsletter TOC\ Search\ Table of Contents\ Editor:\ Jay Fenwickand Cindy Norris, Department of Computer Science, Appalachian State University; sigplan@cs.appstate.edu\ Activities\ FCRC '03 Educators' Travel Grant Program by Kathleen Fisher and Evelyn\ 1\ Duesterwald", ["norman-ramsey/widen.pdf"] = "Reprinted from the 13th International Conference on Compiler Construction\ Widening Integer Arithmetic\ Kevin Redwine and Norman Ramsey\ Division of Engineering and Applied Sciences Harvard University {redwine,nr}@eecs.harvard.edu", ["sigplan/2003/pdfs/sigp/966051/p20-avvenuti.pdf"] = "Main TOC\ Newsletter TOC\ Search\ Java bytecode verification for secure information flow \ Marco Avvenuti , Cinzia Bernardeschi and Nicoletta De Francesco\ Dipartimento di Ingegneria dell'Informazione Universita di Pisa ` Via Diotisalvi 2, I-56126 Pisa, Italy\ {m.avvenuti,c.bernardeschi,n.defrancesco}@iet.unipi.it", ["popl/data/00001509.pdf"] = "Forward\ Debate:\ The Role Compilers\ of Global\ Optimization\ in\ of the Future\ At\ previous\ POPL$s, and compiler", ["popl/abstract/00001373.pdf"] = "", ["walid-taha/thesis.pdf"] = "Multi­Stage Programming:\ Its Theory and Applications\ Walid Taha\ B.S. Computer Science and Engineering, 1993, Kuwait University.\ A dissertation submitted to the faculty of the\ Oregon Graduate Institute of Science and Technology\ in partial fulfillment of the\ requirements for the degree\ Doctor of Philosophy\ ", ["popl/abstract/00001548.pdf"] = "", ["paul-hudak/visionpaper.ps.gz"] = "Submitted to the 1999 International Conference on Software Engineering\ Prototyping Real­Time Vision Systems:\ An Experiment in DSL Design\ Alastair Reid, John Peterson, Greg Hager, Paul Hudak\ Yale University\ P.O Box -08-8-\ New Haven, CT 06--0\ freid­alastair, peterson­john, hager­greg, hudak­paulg@cs.yale.edu\ ", ["sigplan/2003/pdfs/proceeding/781498/p179-pozniansky.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ Efficient On-the-Fly Data Race Detection in Multithreaded C++ Programs", ["popl/abstract/00001419.pdf"] = "", ["andrew-birrell/035-Threads.pdf"] = "d i g i t a l\ Systems Research Center\ 130 Lytton Avenue\ Palo Alto, California 94301\ 3 -\ An Introduction to Programming\ with Threads\ by Andrew D. Birrell\ January 6, 1989\ ", ["ralf-hinze/HFolds.ps.gz"] = "EÆcient Generalized Folds\ Ralf Hinze\ Institut fur Informatik III, Universitat Bonn\ ralf@informatik.uni-bonn.de\ http://www.informatik.uni-bonn.de/~ralf/\ Abstract. Fold operators capture a common recursion pattern over al-\ gebraic datatypes. A fold essentially replaces constructors by functions.\ However, if the datatype is parameterized, the corresponding fold op-\ erates on polymorphic functions which severely limits its applicability.\ ", ["sigplan/2003/pdfs/sigp/966051/p28-aycock.pdf"] = "Main TOC\ Newsletter TOC\ Search\ The ART of Compiler Construction Projects\ John Aycock Department of Computer Science University of Calgary 2500 University Drive N.W. Calgary, Alberta, Canada T2N 1N4 aycock@cpsc.ucalgary.ca", ["sigplan/2003/pdfs/sigp/885638/frontmatter.pdf"] = "Main TOC\ Newsletter TOC\ Search\ ACM\ SIGPLAN Notices\ Table of Contents\ Editor: Jay Fenwick and Cindy Norris, Department of Computer Science, Appalachian State University; sigplan@cs.appstate.edu\ Activities\ Letter from the Editors by Jay Fenwick and Cindy Norris 1 2 6\ Conference Corner", ["popl/abstract/00001686.pdf"] = "", ["john-hughes/whyfp.ps.gz"] = "Why Functional Programming Matters -Lambda\ John Hughes, Institutionen f¨or Datavetenskap,\ Chalmers Tekniska H¨ogskola,\ 41-96 G¨oteborg,\ SWEDEN. rjmh@cs.chalmers.se\ ", ["sigplan/2003/pdfs/proceeding/888251/p264-wu.pdf"] = "Main TOC\ Proceedings TOC\ Search\ Foundational Proof Checkers with Small Witnesses\ Dinghao Wu Andrew W. Appel Aaron Stump\ Washington University in St. Louis stump@cs.wustl.edu\ Princeton University {dinghao,appel}@cs.princeton.edu", ["manuel-benitez/9404.ps.Z"] = "Register Allocation\ and\ Phase Interactions\ in\ Retargetable Optimizing Compilers\ A Dissertation\ Presented to\ the Faculty of the School of Engineering and Applied Science\ at the\ ", ["neal-glew/mcrt/Id/p169-flanagan.pdf"] = "p\ H\ l\ u\ i\ d\ :\ T\ h\ e", ["popl/abstract/00001637.pdf"] = "", ["sigplan/2003/pdfs/proceeding/781131/p312-suganuma.pdf"] = "Main TOC\ Proceedings TOC\ Newsletter TOC\ Search\ A Region-Based Compilation Technique for a Java Just-In-Time Compiler\ Toshio Suganuma Toshiaki Yasue Toshio Nakatani\ IBM Tokyo Research Laboratory 1623-14 Shimotsuruma, Yamato-shi, 242-8502 Japan", ["popl/abstract/00001650.pdf"] = "", ["henk-barendregt/barendregt92lambda.pdf.gz"] = " \ \  -3-79 1368  \  \ 4-9 13680 \ 9 99 \ -1040 \ -9 13680 \ 9 9999 9999 9999 9999 9999 9\ ", }