Chris Stone's Publications
Programming Language Theory
- Equational Theories with Recursive Types
Christopher A. Stone and Andrew P. Schoonmaker
Journal version
Submitted for publication.
Extended version
Contains more proof details.
- Specifications via Realizability
Andrej Bauer and Christopher A. Stone
Extended abstract
Presented at the ETAPS 2005 Workshop on
Constructive Logic for Automated Software Engineering
(CLASE).
- Extensional Equivalence and Singleton Types
Christopher A. Stone and Robert Harper
Journal version (incorporates major technical improvements over the dissertation and the POPL 2000 paper below)
ACM Transactions on Computational Logic, to appear .
- Type Definitions
Christopher A. Stone
Book Chapter
In "Advanced Topics in Types and Programming Languages",
Benjamin C. Pierce, Ed., MIT Press, 2005.
- Extensible Objects Without Labels
Christopher A. Stone
Journal version
ACM Transactions on Programming Languages and Systems, September 2004.
Extended abstract
Ninth Workshop on Foundations of Object-Oriented Languages (FOOL 9), 2002.
- Privacy via Subsumption
Jon G. Riecke and Christopher A. Stone
Journal version
Information and Computation 172, page 2-28, 2002.
Extended abstract
Fifth Workshop on Foundations of Object Oriented Languages (FOOL 5), 1998.
- Deciding Type Equivalence in a Language with Singleton Kinds
Christopher A. Stone and Robert Harper
Journal version (includes major improvements over POPL version)
ACM Transactions on Computational Logic, to appear .
Extended abstract
2000 SIGPLAN Conference on Principles of Programming Languages (POPL '00).
Technical report
CMU Technical Report CMU-CS-99-155 (extended version of POPL paper)
- Singleton Types and Singleton Kinds
Christopher A. Stone
Ph.D. Dissertation
Also appears as CMU Technical Report CMU-CS-00-153, August 2000.
- A Type-Theoretic Interpretation of Standard
ML
Robert Harper and Chris Stone
Book chapter
In "Proof, Language and Interaction: Essays in Honour
of Robin Milner",
Gordon Plotkin, Colin Stirling, and
Mads Tofte Eds., MIT Press, 2000.
Technical report : "An Interpretation
of Standard ML in Type Theory"
Carnegie Mellon Department of Computer
Science, CMU-CS-97-147.
Also appears as Fox Memorandum
CMU-CS-FOX-97-01.
- Transparent and Opaque Interpretations of
Datatypes
Karl Crary, Robert Harper, Perry Cheng, Leaf Petersen,
and Chris Stone
Technical report
Carnegie Mellon Department of Computer
Science, CMU-CS-98-177.
Compilers
- Implementing the TILT Internal Language
Leaf Petersen, Perry Cheng, Robert Harper, Chris
Stone
Technical report
Carnegie Mellon Department of Computer
Science, CMU-CS-00-180
- Elaboration and Phase-Splitting in the TIL/ML
Compiler
Chris Stone
Abstract
1997 CMU Computer Science IC
Research Symposium
- The TIL/ML Compiler: Performance and Safety Through
Types
G. Morrisett, D. Tarditi, P. Cheng, C. Stone, R.
Harper, P. Lee
Extended abstract
1996 Workshop on Compiler Support for
Systems Software.
- TIL: A Type-Directed Optimizing Compiler for
ML
D. Tarditi, G. Morrisett, P. Cheng, C. Stone, R.
Harper, P. Lee
Extended abstract
1996 SIGPLAN Conference on Programming
Language Design and Implementation.
(Selected for the upcoming PLDI
Retrospective)
Other Computer Science
- Safe-for-Space Threads in Standard ML
Edoardo Biagioni, Ken Cline, Peter Lee, Chris Okasaki,
and Chris Stone
Journal version
Higher-order and Symbolic Computation,
11(2), 1998.
Extended abstract
Second ACM SIGPLAN Workshop on
Continuations, 1997.
- Systematic Detection of Subtle Spatio-Temporal
Patterns in Time-Lapse Imaging. II. Particle
Migrations
R.E. Valdes-Perez and C.A. Stone
Journal
version
Bioimaging 6(2), pages 71-78, 1998.
Miscellaneous
- The donation paradox for peremptory
challenges
J. Kadane, C. Stone, and G. Wallstrom
Journal version
Theory and Decision, Volume 47, Issue 2,
pages 139--155, October 1999.
Technical report
: "Optimal Use of Peremptory Challenges Reconsidered"
Carnegie Mellon Department of
Statistics, 575.
Last modified
February 12, 2005
by stone@cs.hmc.edu