Andrew W. Appel, Alex Aiken
Proceedings of the 26th Symposium on Principles of Programming Languages
POPL, 1999.

@proceedings{POPL-1999,
	acmid         = "292540",
	address       = "San Antonio, Texas, USA",
	editor        = "Andrew W. Appel and Alex Aiken",
	isbn          = "1-58113-095-3",
	publisher     = "{ACM}",
	title         = "{Proceedings of the 26th Symposium on Principles of Programming Languages}",
	year          = 1999,
}

Contents (25 items)

4 ×#type system
2 ×#analysis
2 ×#calculus
2 ×#composition
2 ×#constraints
2 ×#java
2 ×#mobile
2 ×#named

POPL-1999-EidorffHMNST #named #type system

AnnoDomini: From Type Theory to Year 2000 Conversion Tool (PHE, FH, CM, HN, MHS, MT), pp. 1–14.

POPL-1999-WansbroughJ #polymorphism

Once Upon a Polymorphic Type (KW, SLPJ), pp. 15–28.

POPL-1999-Kobayashi

Quasi-Linear Types (NK), pp. 29–42.

POPL-1999-MoranS #call-by #lazy evaluation

Improvement in a Lazy Context: An Operational Theory for Call-by-Need (AM, DS), pp. 43–56.

POPL-1999-Yelland #composition #java #virtual machine

A Compositional Account of the Java Virtual Machine (PMY), pp. 57–69.

POPL-1999-OCallahn #bytecode #java #type system

A Simple, Comprehensive Type System for Java Bytecode Subroutines (RO), pp. 70–78.

POPL-1999-CardelliG #mobile

Types for Mobile Ambients (LC, ADG), pp. 79–92.

POPL-1999-RielyH #mobile #trust #type system

Trust and Partial Typing in Open Systems of Mobile Agents (JR, MH), pp. 93–104.

POPL-1999-SagivRW #analysis #logic #parametricity

Parametric Shape Analysis via 3-Valued Logic (SS, TWR, RW), pp. 105–118.

POPL-1999-RamalingamFT #identification #program analysis

Aggregate Structure Identification and Its Application to Program Analysis (GR, JF, FT), pp. 119–132.

POPL-1999-ChatterjeeRL

Relevant Context Inference (RC, BGR, WL), pp. 133–146.

POPL-1999-AbadiBHR #calculus #dependence

A Core Calculus of Dependency (MA, AB, NH, JGR), pp. 147–160.

POPL-1999-KfouryW #decidability #type inference

Principality and Decidable Type Inference for Finite-Rank Intersection Types (AJK, JBW), pp. 161–174.

POPL-1999-Filinski #monad #representation

Representing Layered Monads (AF), pp. 175–188.

POPL-1999-GuptaJP #concurrent #constraints #probability #process #source code

Stochastic Processes as Concurrent Constraint Programs (VG, RJ, PP), pp. 189–202.

POPL-1999-WaddellD #abstraction

Extending the Scope of Syntactic Abstraction (OW, RKD), pp. 203–215.

POPL-1999-XiP #dependent type #programming

Dependent Types in Practical Programming (HX, FP), pp. 214–227.

POPL-1999-Myers #data flow #named

JFlow: Practical Mostly-Static Information Flow Control (ACM), pp. 228–241.

POPL-1999-Ertl #graph

Optimal Code Selection in DAGs (MAE), pp. 242–249.

POPL-1999-GlewM #assembly #composition #type safety

Type-Safe Linking and Modular Assembly Language (NG, JGM), pp. 250–261.

POPL-1999-CraryWM #calculus #memory management

Typed Memory Management in a Calculus of Capabilities (KC, DW, JGM), pp. 262–275.

POPL-1999-PessauxL #analysis #exception #type system

Type-Based Analysis of Uncaught Exceptions (FP, XL), pp. 276–290.

POPL-1999-WandS #constraints

Constraint Systems for Useless Variable Elimination (MW, IS), pp. 291–302.

POPL-1999-Ruckert

Continuous Grammars (MR), pp. 303–310.

POPL-1999-CollbergT #modelling

Software Watermarking: Models and Dynamic Embeddings (CSC, CDT), pp. 311–324.