| OOPSLA 2002 |
| Alias annotations for program understanding | Jonathan Aldrich, Valentin Kostadinov, Craig Chambers |
| Towards a formalization for COM part I: the primitive calculus | Riccardo Pucella |
| OOPSLA 2001 |
| A core calculus for Java exceptions | D. Ancona, G. Lagorio, E. Zucca |
| OOPSLA 2000 |
| An efficient class and object encoding | Neal Glew |
| ICFP 2002 |
| Modular typechecking for hierarchically extensible datatypes and functions | Todd Millstein, Colin Bleckner, Craig Chambers |
| PDLI 2001 |
| Asynchronous exceptions in Haskell | Simon Marlow, Simon Peyton Jones, Andrew Moran, John Reppy |
| PDLI 1999 |
| A theory of type qualifiers | Jeffrey S. Foster, Manuel Fahndrich, Alexander Aiken |
| POPL 2003 |
| The m-calculus: a higher-order distributed process calculus | Alan Schmitt, Jean-Bernard Stefani |
| A type theory for memory allocation and data layout | Leaf Petersen, Robert Harper, Karl Crary, Frank Pfenning |
| POPL 2002 |
| Analyzing security protocols with secrecy types and logic programs | Martin Abadi, Bruno Blanchet |
| A type system for certified binaries | Zhong Shao, Bratin Saha, Valery Trifonov, Nikolaos Papaspyrou |
| POPL 2001 |
| Combining subsumption and binary methods: an object calculus with views | Jerome Vouillon |
| POPL 1999 |
| Type-based analysis of uncaught exceptions | Francois Pessaux, Xavier Leroy |