PLDI/PEPM/FPCA'95 advance program (California, June 1995) (Peter Sestoft)
Fri, 10 Mar 1995 19:54:23 GMT

          From comp.compilers

Related articles
PLDI/PEPM/FPCA'95 advance program (California, June 1995) (1995-03-10)
| List of all articles for this month |

Newsgroups: comp.compilers
From: (Peter Sestoft)
Keywords: conference, courses
Organization: Compilers Central
Date: Fri, 10 Mar 1995 19:54:23 GMT

--- ----------- --------- ------ ------------

June 18-28, 1995, La Jolla, California

PLDI'95: ACM SIGPLAN Conference on Programming Language
                  Design and Implementation June 18-21

Tutorials June 18

                  Second Workshop on Language, Compiler, and
Tool Support for Real-Time Systems June 21-22

PEPM'95: ACM SIGPLAN Symposium on Partial Evaluation
and Semantics-Based Program Manipulation June 21-23

   Haskell Workshop June 25

FPCA'95: SIGPLAN/SIGARCH/WG2.8 Conference on Functional
Programming Languages and Computer Architecture June 25-28

Postscript and ASCII versions of this message are available from
and via ftp in the directory*

==== PLDI'95 ===========================================================

PLDI '95 Tutorial Program

On Sunday 18 June, PLDI '95 presents a day of tutorials on recent
work in programming language design. We hope it will be of interest
to both researchers and practitioners.

8:30-10:00: Type-Driven Language Design
        Luca Cardelli (Digital, Systems Research Center)

        Over the decades, the focus of program development has shifted from
        the design of algorithms to the design of structures. Progress has
        been marked by the introduction of new structuring mechanisms,
        culminating (for now) in concepts such as data abstraction, objects,
        and modules. The overall goal has been to make program components
        increasingly reusable.

        A similar evolutionary path can be traced for programming languages:
        from the early algorithmic languages, to increasingly data-centric
        and object-centric ones. The overall technique has been the
        introduction of new type structures: advances in program structuring
        were progressively embedded into type structures; conversely, new
        type structures enhanced our ability to structure programs.

        As an interesting result of this feedback loop, language features
        have become clustered according to types, so that the type structure
        largely determines the flavor of the language. These clusters of
        features have become increasingly modular and "reusable" from one
        language to the next.

        It seems natural to turn this trend into a conscious goal.
        Type-oriented clustering of features is an effective technique
        for language analysis and design; one that emphasizes orthogonality.
        It can be used both to understand existing (deficient) languages,
        and to produce new (wonderful) ones. Show me your types, and I'll
        show you your language.

10:30-12:00: A View on Standard ML
        Mads Tofte (University of Copenhagen)

        Standard ML came about in a process which involved close interaction
        between experimentation, design, implementation and formal language
        definition. In this talk we discuss certain principles and values
        which we claim had a profound influence on the development of
        Standard ML. We give examples of how these principles and values
        manifest themselves in the language in terms of what became -- and
        what did not become -- part of Standard ML. Finally, we discuss the
        pragmatics of the formal definition: why was it written and what use
        was it to write a formal definition?

        The talk includes a brief overview of the most important aspects of
        ML: the functional part, the imperative part and the modules system.

1:30-3:00: Multiparadigm Programming in Leda
        Tim Budd (Oregon State University)

        The advocates for logic programming, functional programming, and
        object-oriented programming have each in the past several years
        made convincing arguments as to the benefits of their style of
        software development. The basic idea of multiparadigm programming
        is to provide a framework in which these benefits can each be
        realized, and in which each of the different paradigms draws power
        from features provided by the others. In this talk I will introduce
        the basic ideas of multiparadigm programming, using the programming
        language Leda. I will illustrate how programming features from each
        of the different paradigms I have named can be integrated together
        in programs designed to address a number of common programming

3:30-5:00: Is Safe C++ an Oxymoron?
        John R. Ellis (Xerox Palo Alto Research Center)

        Both advocates and detractors think C++ is an inherently unsafe
        language. But in fact, Dave Detlefs and I have designed a
        pointer-safe subset of C++ that, in conjunction with garbage
        collection, ensures the safe use of pointers. The subset requires no
        language changes, has minimal impact on the language's expressiveness
        and efficiency, and is easily implemented in compiler front ends. The
        programmer retains complete control over which components use garbage
        collection and the safe subset, letting her make her own tradeoffs of
        design time, safety, correctness, and performance. The ideas in the
        subset are not new -- they were stolen from Cedar and Modula-2+/3.

5:15-6:00: Q & A Panel Session
        Tim Budd (Oregon State University)
        Luca Cardelli (Digital, Systems Research Center)
        John R. Ellis (Xerox Palo Alto Research Center)
        Mads Tofte (University of Copenhagen)
        Moderated by Anne Rogers (Princeton University)

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

PLDI '95 Conference Program

Session 1: 9:00-10:30, Monday 19 June. Chair: Laurie Hendren

        Efficient context-sensitive pointer analysis for C programs
        Robert P. Wilson and Monica S. Lam (Stanford University)

        Context-insensitive alias analysis reconsidered
        Erik Ruf (Microsoft Research)

        Flow-sensitive interprocedural constant propagation
        Paul R. Carini (IBM T. J. Watson Research Center)
        and Michael Hind (State University of New York at New Paltz
        and IBM T. J. Watson Research Center)

Session 2: 11:00-12:00, Monday 19 June. Chair: Michael Burke

        APT: A data structure for optimal control dependence computation
        Keshav Pingali (Cornell University)
        and Gianfranco Bilardi (Universita' di Padova)

        Efficient building and placing of gating functions
        Peng Tu and David Padua (University of Illinois)

Session 3: 1:30-3:00, Monday 19 June. Chair: John Ellis

        Avoiding conditional branches by code replication
        Frank Mueller and David B. Whalley (Florida State University)

        Accurate static branch prediction by value range propagation
        Jason R. C. Patterson (Queensland University of Technology)

        Corpus-based static branch prediction
        Brad Calder, Dirk Grunwald, Donald Lindsay,
        James Martin, Michael Mozer, and Benjamin Zorn (University of Colorado)

Session 4: 3:30-5:00, Monday 19 June. Chair: Mark Linton

        Selective specialization for object-oriented languages
        Jeffrey Dean, Craig Chambers, and David Grove (University of Washington)

        Simple and effective link-time optimization of Modula-3 programs
        Mary F. Fernandez (Princeton University)

        A type-based compiler for Standard ML
        Zhong Shao (Yale University) and Andrew W. Appel (Princeton University)

Report by the Program Chair: 5:00-5:30, Monday 19 June

Student Research Forum: 7:30-9:30pm, Monday 19 June

Session 5: 9:00-10:30, Tuesday 20 June. Chair: David Wall

        Register allocation using lazy saves, eager restores, and greedy shuffling
        Robert G. Burger, Oscar Waddell, and R. Kent Dybvig (Indiana University)

        Scheduling and mapping: software pipelining in the presence
of structural hazards
        Erik R. Altman, R. Govindarajan, and Guang R. Gao (McGill University)

        Improving balanced scheduling with compiler optimizations
that increase instruction-level parallelism
        Jack L. Lo and Susan J. Eggers (University of Washington)

Session 6: 11:00-12:30, Tuesday 20 June. Chair: John Reppy

        Implementation of the data-flow synchronous language SIGNAL
        Pascalin Amagbegnon, Loic Besnard, and Paul Le Guernic (INRIA)

        Implementation of the typed call-by-value lambda-calculus without
a stack of regions
        Alexander Aiken, Manuel Fahndrich,
        and Raph Levien (University of California at Berkeley)

        Storage assignment to decrease code size
        Stan Liao, Srinivas Devadas (MIT),
        Kurt Keutzer, Steve Tjiang, and Albert Wang (Synopsys)

Session 7: 2:00-3:30, Tuesday 20 June. Chair: Steven Lucco

        Optimizing parallel programs with explicit synchronization
        Arvind Krishnamurthy and Katherine Yelick
        (University of California at Berkeley)

        Unifying data and control transformations for distributed shared
memory machines
        Michal Cierniak and Wei Li (University of Rochester)

        The LRPD Test: speculative run-time parallelization of loops with
privatization and reduction parallelization
        Lawrence Rauchwerger and David Padua (University of Illinois)

Session 8: 4:00-5:30, Tuesday 20 June. Chair: David Chase

        The power of assignment motion
        Jens Knoop (University of Passau, FMI),
        Oliver Ruthing (University of Kiel, CAU),
        and Bernhard Steffen (University of Passau, FMI)

        Global code motion/global value numbering
        Cliff Click (Hewlett-Packard Laboratories)

        Interprocedural partial redundancy elimination
and its application to distributed memory compilation
        Gagan Agrawal, Joel Saltz, and Raja Das (University of Maryland)

Open SIGPLAN meeting: 5:30-6:00, Tuesday 20 June

Catered Gab-Fest: 7:30-9:30, Tuesday 20 June
        A chance to mingle without missing talks. Extra-tasty
        hors d'oeuvres, a place to sit, and the complete absence
        of entertainment guaranteed!

Session 9: 9:00-10:00, Wednesday 21 June. Chair: David Hanson

        Elimination of redundant array subscript range checks
        Priyadarshan Kolte and Michael Wolfe
        (Oregon Graduate Institute of Science and Technology)

        Tile size selection using cache organization and data layout
        Stephanie Coleman and Kathryn S. McKinley
        (University of Massachusetts, Amherst)

Session 10: 10:30-12:00, Wednesday 21 June. Chair: Todd Proebsting

        EEL: machine-independent executable editing
        James R. Larus and Eric Schnarr (University of Wisconsin)

        Garbage collection using a dynamic threatening boundary
        David A. Barrett and Benjamin G. Zorn (University of Colorado)

        Stack caching for interpreters
        M. Anton Ertl (Technische Universitat Wien)

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

PLDI '95 Student Research Forum

Monday, 19 June 1995, 7:30-9:30pm

The Student Research Forum provides an opportunity for graduate
students attending PLDI '95 to discuss their research at poster
sessions. This two hour evening event will feature concurrent
short presentations by student participants organized in poster
formats. Each student will be allowed a 3' by 4' space on an
easel for the presentation. PLDI '95 attendees, including
non-students, will be able to wander among the posters and
talk to the students about their research. Refreshments will
be provided.

Students who wish to present a poster display of their
research must send the following information to David Wall
( by April 15, 1995.

        a title and 500 word abstract of their proposed presentation
        their email address, phone number and surface mail address
        name of their department and school

The student's faculty research advisor should also send a short
e-mail note in support of their participation. Selected participants
will be notified by 15 May 1995.

If there is more interest in this program than can be accommodated
easily, each school will be asked to select its student presenter(s)
on the basis of the size of their annual Ph.D. class, with limited
representation from each Computer Science department.

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

PLDI '95 Conference Committee

General Chair: David W. Wall, Digital - Western Research Lab
Treasurer: David B. Whalley, Florida State University
Tutorials: Anne Rogers, Princeton University
Publicity: Peter Sestoft, Technical University of Denmark
Exhibits: Fritz Henglein, DIKU, University of Copenhagen
Program Chair: David Hanson, Princeton University

Program Committee:
        Alan Borning, University of Washington
        Michael Burke, IBM T. J. Watson Research Center
        David Chase, Centerline Software
        John Ellis, Xerox Palo Alto Research Center
        Benjamin Goldberg, New York University
        David Hanson, Princeton University
        Laurie Hendren, McGill University
        Mark Linton, Silicon Graphics
        Steven Lucco, Carnegie Mellon University
        Lori Pollock, University of Delaware
        Todd Proebsting, University of Arizona
        John Reppy, AT&T Bell Laboratories

==== Real-time systems =================================================

Second ACM SIGPLAN Workshop on
Languages, Compilers, and Tools for Real-Time Systems

Wednesday, 21 June 1995, 2:00pm - 6:00pm
Thursday, 22 June 1995, 8:30am - 5:00pm

The need for large, flexible, powerful, and robust real-time systems,
and for modular and reusable real-time code, creates new challenges
for the designers of real-time languages and environments, requiring
rethinking of standard approaches to real-time systems. Techniques,
approaches and tools from the programming languages and compilers
community appear applicable, but are complicated by the need to
respect temporal constraints on program behavior. LCT-RTS is
intended to promote this technology transfer.

        Thomas Marlowe (Seton Hall Univ & NJIT)
        Rich Gerber (University of Maryland)

        Alan Burns (University of York)
        Rajiv Gupta (University of Pittsburgh)
        Mary Hall (California Inst of Technology)
        Connie Heitmeyer (Naval Research Lab)
        Insup Lee (University of Pennsylvania)
        Al Mok (University of Texas at Austin)
        Steve Tjiang (Synopsys Inc.)

==== PEPM'95 ===========================================================

PEPM '95 Conference Program

Session 1: 2:00-3:30, Wednesday 21 June. Chair: Mitchell Wand

        Shape analysis as a generalized path problem
        Thomas Reps (University of Wisconsin)

        A symbolic constraint solving framework for analysis of logic programs
        C. R. Ramakrishnan, I. V. Ramakrishnan (SUNY at Stony Brook), and
        R. C. Sekar (Bellcore)

Special address: 4:00-5:00, Wednesday 21 June

        MIX ten years after
        Neil Jones (University of Copenhagen)

Session 2: 5:00-6:20, Wednesday 21 June. Chair: John Launchbury

        Self-applicable online partial evaluation of pure lambda calculus
        Torben Mogensen (University of Copenhagen)

        Effect systems with subtyping
        Yan mei Tang and Pierre Jouvelot (Ecole des Mines de Paris)

Session 3: 8:20-10:20, Thursday 22 June. Chair: Julia Lawall

        Polyvariant constructor specialisation
        Dirk Dussart, Eddy Bevers, and Karel De Vlaminck (Katholieke
        Universiteit Leuven)

        Polyvariant specialisation for higher-order, block-structured languages
        Karoline Malmkjaer (Aarhus University)

        Implementation of multiple specialization in logic programs
        German Puebla and Manuel Hermenegildo (Technical University of Madrid)

Session 4: 10:50-12:10, Thursday 22 June. Chair: Radhia Cousot

        Proving properties of programs defined over recursive data structures
        Daniel Le Metayer (IRISA/INRIA)

        Semantic foundations of binding time analysis for imperative programs
        Manuvir Das, Thomas Reps (University of Wisconsin), and
        Pascal Van Hentenryck (Brown University)

Invited talk: 2:00-3:00, Thursday 22 June

        Abstract interpretation and low-level code optimization
        Saumya K. Debray (University of Arizona)

Session 5: 3:00-4:20, Thursday 22 June. Chair: Neil Jones

        Using abstract interpretation to define a strictness type inference system
        Bruno Monsuez (Ecole Normale Superieure)

        Abstract interpretation for schedulers
        Eric Goubault (Ecole Normale Superieure)

Session 6: 4:50-6:10, Thursday 22 June. Chair: Robert Gluck

        The essence of LR parsing
        Michael Sperber and Peter Thiemann (Universitat Tubingen)

        Clock analysis of synchronous dataflow programs
        Thomas P. Jensen (Ecole Polytechnique)

Session 7: 8:20-10:20, Friday 23 June. Chair: David A. Schmidt

        Optimization of CLP modules via replacement
        Sandro Etalle and Maurizio Gabbrielli
        (Centrum voor Wiskunde en Informatica)

        Higher order expression procedures
        David Sands (University of Copenhagen)

        Caching intermediate results for program improvement
        Yanhong A. Liu and Tim Teitelbaum (Cornell University)

Session 8: 10:50-12:10, Friday 23 June. Chair: Tim Griffin

        Analyzing the communication topology of concurrent programs
        Christopher Colby (Carnegie Mellon University)

        Semantic analysis of Concurrent Pascal using abstract model-checking
        Regis Cridlig (Ecole Normale Superieure)

Invited talk: 2:00-3:00, Friday 23 June

        An overview of semantic models and static analysis techniques for
inductive data structures and pointers
        Alain Deutsch (INRIA Rocquencourt)

Session 9: 3:00-5:00, Friday 23 June. Chair: Olivier Danvy

        Action transformation by partial evaluation
        Kyung-Goo Doh (University of Aizu)

        Type analysis of logic programs in the presence of type definitions
        Lunjin Lu (University of Birmingham)

        Towards creating specialised integrity checks through partial
evaluation of meta-interpreters
        Michael Leuschel and Danny De Schreye (Katholieke Universiteit Leuven)

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

PEPM '95 Conference Committee

General Chair: Neil Jones, DIKU
Treasurer: Tim Sheard, Oregon Graduate Institute
Publicity: Peter Sestoft, Technical University of Denmark
Exhibits: Fritz Henglein, DIKU, University of Copenhagen
Program Chair: William L. Scherlis, Carnegie Mellon University

Program Committee:
        Craig Chambers, University of Washington
        John Launchbury, Oregon Graduate Institute
        Radhia Cousot, CNRS & Ecole Polytechnique
        Julia Lawall, Brandeis University
        Olivier Danvy, Aarhus University
        Erik Ruf, Microsoft Research
        Robert Gluck, Vienna University of Technology
        William L. Scherlis, Carnegie Mellon University
        Benjamin Goldberg, New York University
        David A. Schmidt, Kansas State University
        Tim Griffin, AT&T Bell Laboratories
        Harald Sondergaard, University of Melbourne
        Paul Hudak, Yale University
        Mitchell Wand, Northeastern University

==== Haskell Workshop ==================================================

Haskell Workshop

Sunday, 25 June 1995
9:30am - 4:30pm

The functional language Haskell is approaching its 5th birthday.
There are now several robust and popular implementations of Haskell,
and it has been used in a variety of applications, big and small,
academic and industrial. This informal workshop is aimed at
discussing the future of Haskell: what have we learned, what should be
different, and what is the process for change? The forum will consist
of invited talks on particular aspects of Haskell, specific proposals
for change, and open discussions on the most interesting topics.

(Note: Admittance to the workshop requires registration.)

Chair: Paul Hudak (Yale University)

==== FPCA'95 ===========================================================

FPCA '95 Conference Program

Tutorial: 5:00pm - 6:30pm, Sunday 25 June

        Regularity => Parallelism
        Christian Lengauer (University of Passau)

        This tutorial will give an overview of a method for the
        parallelization of functional programs that correspond to nested
        do loops. The programs must fulfill certain regularity conditions.

        The method has the following properties:

          1. It is static and automatic, i.e., it can be incorporated into
a compiler.

          2. It is based on a multi-dimensional geometric model in which
individual computations are mapped to space-time. This makes
the generation of target code with explicit parallel statements
and communication commands easy.

          3. It can generate maximal parallelism with respect to the data
dependences in the program.

          4. It gives the user (compiler) the ability to trade off time
versus space, i.e., it can be targeted towards optimizing
other performance aspects than the number of execution steps
like the number of processors, the number of communication
channels, the amount of communication, memory usage, etc.

        The method was invented for systolic array design and has recently
        been applied to parallelizing compilation. Its basis on functional
        specifications and recent advances in target code generation make it
        of interest to the functional programming community.

Reception: 6:30-9:00, Sunday 25 June. Beverages only.

Session 1: 9:00-10:30, Monday 26 June

        Once upon a type
        D. N. Turner (University of Glasgow), P. L. Wadler (University of Glasgow),
        and C. Mossin (University of Copenhagen)

        A generalization of exceptions and control in ML-like languages
        C. A. Gunter (University of Pennsylvania), D. Remy (INRIA Rocquencourt),
        and J. G. Riecke (AT&T Bell Labs)

        Unboxed values and polymorphic typing revisited
        P. J. Thiemann (Universitat Tubingen)

Session 2: 11:00-12:30, Monday 26 June

        Deriving imperative code from functional programs
        P. Quinton (IRISA), S. Rajopadhye (IRISA and Oregon State University),
        and D. Wilde (Oregon State University)

        Using a language of functions and relations for VLSI specification
        R. Sharp and O. Rasmussen (Technical University of Denmark)

        The functional side of logic programming
        M. Marchiori (University of Padova)

Session 3: 2:00-3:30, Monday 26 June

        Abstract models of memory management
        G. Morrisett (Carnegie Mellon University), M. Felleisen (Rice University),
        and R. Harper (Carnegie Mellon University)

        First-class schedules and virtual maps
        R. Mirani and P. Hudak (Yale University)

        Purely functional random-access lists
        C. Okasaki (Carnegie Mellon University)

Session 4: 4:00-5:30, Monday 26 June

        Pi-calculus, dialogue games and full abstraction for PCF
        J. M. E. Hyland (University of Cambridge) and C. H. L. Ong
        (University of Oxford and National University of Singapore)

        Making choices lazily
        R. J. M. Hughes and A. Moran (Chalmers University of Technology)

        Compiler correctness for parallel languages
        M. Wand (Northeastern University)

Session 5: 9:00-10:30, Tuesday 27 June

        A second look at overloading
        M. Odersky (Universitaet Karlsruhe), P. L. Wadler (University of Glasgow),
        and M. Wehr (Universitaet Karlsruhe)

        Dimension inference under polymorphic recursion
        M. Rittri (Chalmers University of Technology)

        Simplifying and improving qualified types
        M. P. Jones (University of Nottingham)

Session 6: 11:00-12:30, Tuesday 27 June

        Formal language, grammar and set-constraint-based program analysis by
abstract interpretation
        Patrick Cousot (Ecole Normale Superieure)
        and Radhia Cousot (CNRS & Ecole Polytechnique)

        Dynamic typing and subtype inference
        Alex Aiken and M. Fahndrich (University of California, Berkeley)

        Safe polymorphic type inference for a dynamically typed language:
Translating Scheme to ML
        F. Henglein and J. Rehof (DIKU, University of Copenhagen)

Session 7: 2:00-3:30, Tuesday 27 June

        Semantics of barriers in a non-strict, implicitly-parallel language
        S. Aditya (MIT), Arvind (MIT), and Joseph Stoy (Oxford University)

        How much non-strictness do lenient programs require?
        K. E. Schauser (University of California, Santa Barbara)
        and S. C. Goldstein (University of California, Berkeley)

        Parallelism in sequential functional languages
        G. Blelloch and J. Greiner (Carnegie Mellon University)

Session 8: 4:00-5:30, Tuesday 27 June

        Polytypic pattern matching
        J. Jeuring (Chalmers University of Technology)

        Lambdas in the liftshaft: functional programming and
an embedded architecture
        M. Wallace and C. Runciman (University of York)

        Constructing functional programs for grammar analysis problems
        J. Jeuring (Chalmers University of Technology)
        and D. Swierstra (Utrecht University)

Session 9: 9:00-10:30, Wednesday 28 June

        Interprocedural register allocation for lazy functional languages
        U. Boquist (Chalmers University of Technology)

        Highlights from nhc - a space-efficient Haskell compiler
        N. Rojemo (Chalmers University of Technology)

        Cache performance of fast-allocating programs
        M. J. R. Goncalves and A. W. Appel (Princeton University)

Session 10: 11:00-12:30, Wednesday 28 June

        Deforestation in calculational form
        A. Takano (Hitachi Advanced Research Lab)
        and E. Meijer (Utrecht University)

        Warm fusion
        J. Launchbury and T. Sheard (Oregon Graduate Institute)

        Bananas in space: extending fold and unfold to exponential types
        E. Meijer and G. Hutton (Utrecht University)

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

FPCA '95 Conference Committee

General Chair: John Williams, IBM Almaden Research Center
Treasurer and Local Arrangements:
Dennis Volpano, Naval Postgraduate School
Publicity: Peter Sestoft, Technical University of Denmark
Exhibits: Fritz Henglein, DIKU, University of Copenhagen
Program Chair: Simon Peyton Jones, Glasgow University

Program Committee:
        Lennart Augustsson, Chalmers University
        Henry Baker, Nimble Inc
        Guy Blelloch, Carnegie Mellon University
        Wim Bohm, Colorado State University
        Andrew Gordon, University of Cambridge
        Pieter Hartel, University of Amsterdam
        Mark Jones, University of Nottingham
        John Launchbury, Oregon Graduate Institute
        Christian Lengauer, University of Passau
        Xavier Leroy, INRIA
        John Mitchell, Stanford University
        John O'Donnell, Glasgow University

==== La Jolla ===========================================================

La Jolla, California

        Contained within the city limits of San Diego, La Jolla is a popular
        resort graced with a rocky coast and fine beaches. Summers are
        beautiful; temperatures reach about 76 F (24 C) during the day and
        drop to about 64 F (18 C) at night. Summertime rain is uncommon.

        The Hyatt Regency La Jolla is ten minutes from the coast, and has
        a health club, pool, and lighted tennis courts. Nearby Mission Bay
        Park features Sea World, home of Shamu the Killer Whale. The San
        Diego Zoo is one of the largest in the world, displaying more than
        4000 animals of 800 different species in open, natural surroundings.

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

PLDI/PEPM/FPCA '95 Transportation Information

Air travel

        La Jolla is served by Lindbergh Field, which is accessible via
        domestic flights from numerous locations in the U.S. and by
        connections from international flights. The nearest international
        airport is LAX in Los Angeles.

        United Airlines is pleased to offer the attendees of ACM PLDI/PEPM/FPCA
        a 5% discount off any United or United Express published fare in
        effect when tickets are purchased subject to all applicable
        restrictions, or a 10% discount off applicable BUA fares in effect
        when tickets are purchased 7 days in advance.
        Reservations and schedule information may be obtained by calling the
        United Meetings desk at 1-800-521-4041 and referencing Meeting ID 591TN.
        The Meeting Desk hours are Monday through Sunday, 7:00 am to 10:00 pm
        Eastern Time.

Local transport

        Cloud 9 Shuttle provides 24-hour transportation from Lindbergh Field
        to the Hyatt Regency for $8; the trip takes about 15 minutes. Taxi
        service is also available for about $20. If you're hardy you can
        get there on the city bus for $1: the trip takes 30--45 minutes and
        requires two changes.

==== Hotels ===========================================================

PLDI/PEPM/FPCA '95 Hotel Reservations

Mention "Association for Computing Machinery" to receive the conference
rates, valid if you register by 28 May 1995.

          By Mail By Phone

Hyatt Regency La Jolla Voice: (800) 233--1234
3777 La Jolla Village Drive +1 (619) 552--1234
San Diego, CA 92122 Fax: +1 (619) 552--6066

Single, Twin, or Double rate: $107 (+ 9% state tax)





Phone:____________________________ Fax:__________________________________

Arrival date________________________________ Number of nights____________

Number of rooms________________________ Number of people_________________

Room type (Single bed, Double bed, Twin beds)____________________________

Smoking or Non-smoking?__________________________________________________

Special Needs:___________________________________________________________

Guarantee room by credit card? (VISA, MC, AMEX, Diners, Discover)

                  ___Visa ___Mastercard ___American Express

                                ___Diners Club ___Discover

Card number:_______________________________________ Expires______________


==== Registration =======================================================

Registration Information

Submit one photocopy of the form for each attendee. Please print
or type all information to avoid errors on your badge.

To qualify for the lower rates, registration forms with full payment
must be postmarked by May 25, 1995.

    * Please make checks and money orders payable in U. S. dollars to
            ACM SIGPLAN '95.
    * Phone, e-mail, and faxed registrations must be paid by Visa,
            MasterCard, or American Express. American Express users, please
            provide your billing address if it is different from the address
            on the registration form.
    * Government vouchers and purchase orders are not accepted.

Requests for refunds must be postmarked by June 7, 1995. After this
date, cancellations and no-shows are liable for the full fees.

PLDI '95 registration includes a copy of the PLDI proceedings,
Tuesday night's catered Gab-Fest, 3 continental breakfasts,
coffee breaks, and lunch Monday and Tuesday of the conference.

PEPM '95 registration includes a copy of the PEPM proceedings,
the banquet, 2 continental breakfasts, coffee breaks, and
lunch Thursday and Friday of the conference.

FPCA '95 registration includes a copy of the FPCA proceedings,
admission to the FPCA Tutorial, the Sunday evening reception,
3 continental breakfasts, coffee breaks, and lunch Monday and
Tuesday of the conference.

PLDI Tutorial registration includes a copy of the notes,
lunch Sunday, and coffee breaks.

Real-Time Workshop registration includes a copy of the notes,
lunch Thursday, and coffee breaks.

Haskell Workshop registration includes a copy of the notes
and coffee breaks.

Send registration form and full payment to:

P. O. Box 8304
Maitland, FL 32794-8304

                                                                  For overnight mail:
        or Fax to: (407) 628-3186 Carole Mann
        Phone: (407) 628-3602 ACM SIGPLAN '95
        E-mail: Registration Systems Lab
                                                                  2060 Goldwater Court
                                                                  Maitland, FL 32751

Name: ___________________________________________________________________

Name tag should read:____________________________________________________

Affiliation: ____________________________________________________________

Address: ________________________________________________________________


Phone: ______________________________ Fax: _____________________________

Electronic mail: ________________________________________________________

ACM Membership Number: __________________________________________________

The list of attendees will be sent electronically, only to attendees.

May we include you on this list? ___yes ___no

Dietary preference? ___Vegetarian (may contain dairy, eggs)

___Vegan (no animal products) ___Kosher

Special needs or accommodations: ________________________________________

                                      Fee Schedule (in U. S. dollars)
please circle ALL applicable fees

Tutorial PLDI '95 Real-Time
Early Late Early Late Workshop
ACM & SIGPLAN member 150 175 275 300 90
ACM or SIGPLAN member 175 200 300 325 90
Non-member 175 200 325 350 100
full-time student 60 60 125 125

                                                      PEPM '95 FPCA '95 Haskell
Early Late Early Late Workshop
ACM & SIGPLAN member 310 385 310 310 30
ACM or SIGPLAN member 310 385 325 325 30
Non-member 385 460 350 450 30
full-time student 150 150 150 150

Students are welcome at the workshops, but there is no reduced fee.

Total (Conferences, Tutorial, Workshops):________________________________

___check (US$, payable to SIGPLAN '95)

___Visa ___MasterCard ___American Express

Card #: _________________________________________ Expires _______________

Signature: ______________________________________________________________

Signature of e-mail registrants will be required at the conference.

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.