Second CFP: Types in Compilation 2000 (TIC 2000)

Robert Harper <>
5 Apr 2000 22:40:32 -0400

          From comp.compilers

Related articles
Second CFP: Types in Compilation 2000 (TIC 2000) (Robert Harper) (2000-04-05)
| List of all articles for this month |

From: Robert Harper <>
Newsgroups: comp.compilers
Date: 5 Apr 2000 22:40:32 -0400
Organization: Carnegie Mellon, Pittsburgh, PA
Keywords: conference, types, CFP

>>> Please note the change in dates and submission procedure! <<<


The Third ACM SIGPLAN Workshop on

Types in Compilation (TIC 2000)

Montreal, Canada
September 21, 2000

Co-located with PLI 2000

Types play a central role in many of the advanced compilation
techniques developed for modern programming languages. Standard or
non-standard type systems and type analyses have been found to be
useful for optimizing dynamic method dispatch in object-oriented
languages, for reducing run-time tests in dynamically typed languages,
for guiding data representations and code generation, for program
analysis and transformation, for compiler verification and debugging,
and for establishing safety properties of distributed or mobile code.
The TIC workshops bring together researchers to share new ideas and
results in this area. The next workshop, TIC 2000, will take place as
part of the colloquium on Principles, Logics, and Implementations of
high-level programming languages (PLI 2000).

Submissions are invited on all areas of interaction between advanced
compilation techniques and type systems or type analyses, including
both practical applications and theoretical aspects. Research
contributions on both dynamically- and statically-typed approaches are
explicitly encouraged. Topics of interest include:

            - Type-directed compilation and typed intermediate languages.
            - Analysis and transformations for efficient implementation of
                parametric and subtype polymorphism.
            - Compiling and optimizing dynamic dispatch and related issues
                in object-oriented languages.
            - Elimination of run-time type tests in dynamically-typed
            - Flow analysis for reconstructing type information, including
                control-flow analyses, set-based analyses, and soft typing.
            - Type-based data representation analysis.
            - Type-based interoperability between languages.
            - Types and the correctness of program transformations.
            - Type-safe, mobile intermediate representations such as
                proof-carrying code or Java-style safe bytecodes.
            - Interactions between types and run-time systems such as
                garbage collectors.
            - Compile-time and run-time representations of type
            - Type-directed partial evaluation; type-based multi-level

This is not meant to be an exhaustive list; papers on novel uses of
type information in compilers are welcome. Authors concerned about
the suitability of a topic are encouraged to inquire via electronic
mail to the program chair prior to submission.

General chair:
                Karl Crary
                Computer Science Department
                Carnegie Mellon University
                5000 Forbes Avenue
                Pittsburgh, PA 15213

Organizing committee:
                Craig Chambers, University of Washington
                Robert Harper, Carnegie Mellon University
                Xavier Leroy, INRIA Rocquencourt
                Robert Muller, Boston College
                Atsushi Ohori, Kyoto University
                Simon Peyton Jones, Microsoft Corporation

Program chair:
                Robert Harper
                Computer Science Department
                Carnegie Mellon University
                5000 Forbes Avenue
                Pittsburgh, PA 15213

Program committee:
Dominic Duggan, Stevens Institute of Technology
Robert Harper (chair), Carnegie Mellon University
Trevor Jim, AT&T
Andrew Kennedy, Microsoft Corporation
Atsushi Ohori, Kyoto University
Franklyn Turbak, Wellesley College

Important dates:
            Submission deadline June 1, 2000
Notification of acceptance August 15, 2000
Final paper September 1, 2000
            Workshop September 21, 2000

Submission procedure:

We solicit submissions on original research not published or submitted
for publication elsewhere. Technical summaries, in English and not to
exceed 5000 words, should be submitted by Monday, June 1, 2000 using
the submission form at Persons
for whom electronic submission poses a hardship may make special
arrangements with the program chair.


The workshop proceedings will be published after the workshop by
Springer-Verlag as part of their Lecture Notes in Computer Science
series ( The proceedings
will also be available as part of the LNCS Online Digital Library
( An informal proceedings will
be available at the workshop.

Post a followup to this message

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