Alex Aiken, Greg Morrisett
Conference Record of the 30th Symposium on Principles of Programming Languages
POPL, 2003.

@proceedings{POPL-2003,
	acmid         = "604131",
	address       = "Louisisana, USA",
	editor        = "Alex Aiken and Greg Morrisett",
	isbn          = "1-58113-628-5",
	publisher     = "{ACM}",
	title         = "{Conference Record of the 30th Symposium on Principles of Programming Languages}",
	volume        = "ACM SIGPLAN Notices 38(1), January 2003",
	year          = 2003,
}

Contents (25 items)

4 ×#type system
2 ×#algorithm
2 ×#analysis
2 ×#calculus
2 ×#graph
2 ×#higher-order
2 ×#source code

POPL-2003-SimeonW #xml

The essence of XML (JS, PW), pp. 1–13.

POPL-2003-AcarBH

Selective memoization (UAA, GEB, RH), pp. 14–25.

POPL-2003-TahaN #classification

Environment classifiers (WT, MFN), pp. 26–37.

POPL-2003-JensenM #graph

Bigraphs and transitions (OHJ, RM), pp. 38–49.

POPL-2003-SchmittS #calculus #distributed #higher-order #process

The m-calculus: a higher-order distributed process calculus (AS, JBS), pp. 50–61.

POPL-2003-BouajjaniET #approach #concurrent #source code #static analysis

A generic approach to the static analysis of concurrent programs with procedures (AB, JE, TT), pp. 62–73.

POPL-2003-GulwaniN #random #using

Discovering affine equalities using random interpretation (SG, GCN), pp. 74–84.

POPL-2003-TallamG

Bitwidth aware global register allocation (ST, RG), pp. 85–96.

POPL-2003-BallNR #fault

From symptom to cause: localizing errors in counterexample traces (TB, MN, SKR), pp. 97–105.

POPL-2003-CarterFT #graph

Folklore confirmed: reducible flow graphs are exponentially larger (LC, JF, CDT), pp. 106–114.

POPL-2003-Chakaravarthy #analysis #complexity

New results on the computability and complexity of points — to analysis (VTC), pp. 115–125.

POPL-2003-ZibinG #algorithm #incremental

Incremental algorithms for dispatching in dynamically typed languages (YZ, JYG), pp. 126–138.

POPL-2003-Thielecke #continuation

From control effects to typed continuation passing (HT), pp. 139–149.

POPL-2003-Chen #calculus #type system

Coercive subtyping for the calculus of constructions (GC), pp. 150–159.

POPL-2003-ZibinGC #algorithm #morphism #performance

Efficient algorithms for isomorphisms of simple types (YZ, JYG, JC), pp. 160–171.

POPL-2003-PetersenHCP #layout #memory management #type system

A type theory for memory allocation and data layout (LP, RH, KC, FP), pp. 172–184.

POPL-2003-HofmannJ #first-order #functional #predict #source code

Static prediction of heap space usage for first-order functional programs (MH, SJ), pp. 185–197.

POPL-2003-Crary #assembly #towards

Toward a foundational typed assembly language (KC), pp. 198–212.

POPL-2003-BoyapatiLS #encapsulation

Ownership types for object encapsulation (CB, BL, LS), pp. 213–223.

POPL-2003-XiCC #data type #recursion

Guarded recursive datatype constructors (HX, CC, GC), pp. 224–235.

POPL-2003-DreyerCH #higher-order #type system

A type system for higher-order modules (DD, KC, RH), pp. 236–249.

POPL-2003-BartheCKL #type system

Pure patterns type systems (GB, HC, CK, LL), pp. 250–261.

POPL-2003-Boehm

Destructors, finalizers, and synchronization (HJB), pp. 262–272.

POPL-2003-GheorghioiuSR #analysis #interprocedural

Interprocedural compatibility analysis for static object preallocation (OG, AS, MCR), pp. 273–284.

POPL-2003-BaconCR #consistency #garbage collection #realtime

A real-time garbage collector with low overhead and consistent utilization (DFB, PC, VTR), pp. 285–298.