30. POPL 2003:
New Orleans, Louisisana, USA
Alex Aiken, Greg Morrisett (Eds.):
Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, New Orleans, Louisisana, USA, January 15-17, 2003.
ACM 2003, ISBN 1-58113-628-5
- ACM SIGPLAN Notices 38(1), January 2003
- Jérôme Siméon, Philip Wadler:
The essence of XML.
1-13, (ACM SIGPLAN Notices 38(1), January 2003)

- Umut A. Acar, Guy E. Blelloch, Robert Harper:
Selective memoization.
14-25, (ACM SIGPLAN Notices 38(1), January 2003)

- Walid Taha, Michael Florentin Nielsen:
Environment classifiers.
26-37, (ACM SIGPLAN Notices 38(1), January 2003)

- Ole Høgh Jensen, Robin Milner:
Bigraphs and transitions.
38-49, (ACM SIGPLAN Notices 38(1), January 2003)

- Alan Schmitt, Jean-Bernard Stefani:
The m-calculus: a higher-order distributed process calculus.
50-61, (ACM SIGPLAN Notices 38(1), January 2003)

- Ahmed Bouajjani, Javier Esparza, Tayssir Touili:
A generic approach to the static analysis of concurrent programs with procedures.
62-73, (ACM SIGPLAN Notices 38(1), January 2003)

- Sumit Gulwani, George C. Necula:
Discovering affine equalities using random interpretation.
74-84, (ACM SIGPLAN Notices 38(1), January 2003)

- Sriraman Tallam, Rajiv Gupta:
Bitwidth aware global register allocation.
85-96, (ACM SIGPLAN Notices 38(1), January 2003)

- Thomas Ball, Mayur Naik, Sriram K. Rajamani:
From symptom to cause: localizing errors in counterexample traces.
97-105, (ACM SIGPLAN Notices 38(1), January 2003)

- Larry Carter, Jeanne Ferrante, Clark D. Thomborson:
Folklore confirmed: reducible flow graphs are exponentially larger.
106-114, (ACM SIGPLAN Notices 38(1), January 2003)

- Venkatesan T. Chakaravarthy:
New results on the computability and complexity of points - to analysis.
115-125, (ACM SIGPLAN Notices 38(1), January 2003)

- Yoav Zibin, Joseph Gil:
Incremental algorithms for dispatching in dynamically typed languages.
126-138, (ACM SIGPLAN Notices 38(1), January 2003)

- Hayo Thielecke:
From control effects to typed continuation passing.
139-149, (ACM SIGPLAN Notices 38(1), January 2003)

- Gang Chen:
Coercive subtyping for the calculus of constructions.
150-159, (ACM SIGPLAN Notices 38(1), January 2003)

- Yoav Zibin, Joseph Gil, Jeffrey Considine:
Efficient algorithms for isomorphisms of simple types.
160-171, (ACM SIGPLAN Notices 38(1), January 2003)

- Leaf Petersen, Robert Harper, Karl Crary, Frank Pfenning:
A type theory for memory allocation and data layout.
172-184, (ACM SIGPLAN Notices 38(1), January 2003)

- Martin Hofmann, Steffen Jost:
Static prediction of heap space usage for first-order functional programs.
185-197, (ACM SIGPLAN Notices 38(1), January 2003)

- Karl Crary:
Toward a foundational typed assembly language.
198-212, (ACM SIGPLAN Notices 38(1), January 2003)

- Chandrasekhar Boyapati, Barbara Liskov, Liuba Shrira:
Ownership types for object encapsulation.
213-223, (ACM SIGPLAN Notices 38(1), January 2003)

- Hongwei Xi, Chiyan Chen, Gang Chen:
Guarded recursive datatype constructors.
224-235, (ACM SIGPLAN Notices 38(1), January 2003)

- Derek Dreyer, Karl Crary, Robert Harper:
A type system for higher-order modules.
236-249, (ACM SIGPLAN Notices 38(1), January 2003)

- Gilles Barthe, Horatiu Cirstea, Claude Kirchner, Luigi Liquori:
Pure patterns type systems.
250-261, (ACM SIGPLAN Notices 38(1), January 2003)

- Hans-Juergen Boehm:
Destructors, finalizers, and synchronization.
262-272, (ACM SIGPLAN Notices 38(1), January 2003)

- Ovidiu Gheorghioiu, Alexandru Salcianu, Martin C. Rinard:
Interprocedural compatibility analysis for static object preallocation.
273-284, (ACM SIGPLAN Notices 38(1), January 2003)

- David F. Bacon, Perry Cheng, V. T. Rajan:
A real-time garbage collector with low overhead and consistent utilization.
285-298, (ACM SIGPLAN Notices 38(1), January 2003)

Last update Thu May 23 17:50:39 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page