Christopher A. Stone
Christopher A. Stone


  Affiliation history
Bibliometrics: publication history
Average citations per article18.07
Citation Count253
Publication count14
Publication years1996-2011
Available for download7
Average downloads per article319.57
Downloads (cumulative)2,237
Downloads (12 Months)64
Downloads (6 Weeks)13
Arrow RightAuthor only

See all colleagues of this author

See all subject areas


14 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 14 of 14
Sort by:

1 published by ACM
October 2011 OOPSLA '11: Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion
Publisher: ACM
Citation Count: 3
Downloads (6 Weeks): 2,   Downloads (12 Months): 10,   Downloads (Overall): 108

Full text available: PDFPDF
Observationally Cooperative Multithreading (OCM) is a new approach to shared-memory parallelism. It addresses a key problem of mainstream concurrency control mechanisms - they can be prohibitively hard to reason about and debug. Programmers using OCM simply write code as if they were using the cooperative multithreading model (CM) for uniprocessors. ...
Keywords: cooperative multithreading, lock inference, observationally cooperative multithreading, parallel debugging, parallel model, transactional memory

2 published by ACM
March 2009 SIGCSE '09: Proceedings of the 40th ACM technical symposium on Computer science education
Publisher: ACM
Citation Count: 2
Downloads (6 Weeks): 2,   Downloads (12 Months): 5,   Downloads (Overall): 212

Full text available: PDFPDF
Assignments determine much of what students actually take away from a course. Sadly, creating successful assignments is difficult and error prone. With that in mind, the Nifty Assignments session is about promoting and sharing successful assignment ideas, and more importantly, making the assignment materials available for others to adopt.
Keywords: assignment, education, homework, library, nifty, object oriented programming, project, repository
Also published in:
March 2009  ACM SIGCSE Bulletin - SIGCSE '09: Volume 41 Issue 1, March 2009

February 2009 Journal of Logic and Computation: Volume 19 Issue 1, February 2009
Publisher: Oxford University Press
Citation Count: 1

Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce code interfaces for the data structure corresponding to a mathematical theory. Our tool, called RZ, serves as a bridge between the worlds ...

June 2007 CiE '07: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Publisher: Springer-Verlag
Citation Count: 2

Realizability theory can produce interfaces for the data structure corresponding to a mathematical theory. Our tool, called RZ, serves as a bridge between constructive mathematics and programming by translating specifications in constructive logic into annotated interface code in Objective Caml. The system supports a rich input language allowing descriptions of ...

5 published by ACM
October 2006 ACM Transactions on Computational Logic (TOCL): Volume 7 Issue 4, October 2006
Publisher: ACM
Citation Count: 11
Downloads (6 Weeks): 2,   Downloads (12 Months): 4,   Downloads (Overall): 272

Full text available: PDFPDF
We study the λ ΠΣ S ≤ calculus, which contains singleton types S ( M ) classifying terms of base type provably equivalent to the term M . The system includes dependent types for pairs and functions (Σ and Π) and a subtyping relation induced by regarding singletons as subtypes ...
Keywords: Singleton types, equivalence algorithms, logical relations

March 2006 Electronic Notes in Theoretical Computer Science (ENTCS): Volume 153 Issue 1, March, 2006
Publisher: Elsevier Science Publishers B. V.
Citation Count: 1

We present a system, called RZ, for automatic generation of program specifications from mathemat- ical theories. We translate mathematical theories to specifications by computing their realizability interpretations in the ML language augmented with assertions (as comments). While the system is best suited for descriptions of those data structures that can ...
Keywords: ML, Realizability, Constructive Logic

7 published by ACM
September 2004 ACM Transactions on Programming Languages and Systems (TOPLAS): Volume 26 Issue 5, September 2004
Publisher: ACM
Citation Count: 2
Downloads (6 Weeks): 1,   Downloads (12 Months): 6,   Downloads (Overall): 462

Full text available: PDFPDF
Typed object calculi that permit adding new methods to existing objects must address the problem of name clashes: what happens if a new method is added to an object already having one with the same name but a different type? Most systems statically forbid such clashes by restricting the allowable ...
Keywords: Extensible objects, object calculi

8 published by ACM
April 2004 ACM SIGPLAN Notices - 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999: A Selection: Volume 39 Issue 4, April 2004
Publisher: ACM
Citation Count: 3
Downloads (6 Weeks): 1,   Downloads (12 Months): 12,   Downloads (Overall): 282

Full text available: PDFPDF
The goal of the TIL project was to explore the use of Typed Intermediate Languages to produce high-performance native code from Standard ML (SML). We believed that existing SML compilers were doing a good job of conventional functional language optimizations, as one might find in a LISP compiler, but that ...

February 2002 Information and Computation - FOOL V: Volume 172 Issue 1, January 10, 2002
Publisher: Academic Press, Inc.
Citation Count: 16

We describe an object calculus allowing object extension and structural subtyping. Each object has a "dictionary" to mediate the connection between names and components. This extra indirection yields the first object calculus combining both object extension and full width subtyping in a type-safe manner. If class inheritance is modeled with ...

July 2000 Proof, language, and interaction: essays in honour of Robin Milner
Publisher: MIT Press
Citation Count: 33

11 published by ACM
January 2000 POPL '00: Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Publisher: ACM
Citation Count: 25
Downloads (6 Weeks): 4,   Downloads (12 Months): 8,   Downloads (Overall): 368

Full text available: PdfPdf
Work on the TILT compiler for Standard ML led us to study a language with singleton kinds : S ( A ) is the kind of all types provably equivalent to the type A . Singletons are interesting because they provide a very general form of definitions for type variables, ...

January 2000
Citation Count: 9

In this dissertation I study the properties of singleton kinds and singleton types . These are extremely precise classifiers for types and values, respectively: the kind of all types equal to [a given type], and the type of all values equal to [a given value]. Singletons are interesting because they ...

September 1998 Higher-Order and Symbolic Computation: Volume 11 Issue 2, September 1998
Publisher: Kluwer Academic Publishers
Citation Count: 6

Threads can easily be implemented using first-class continuations, but the straightforward approaches for doing so lead to space leaks, especially in a language with exceptions like Standard ML. We show how these space leaks arise and give a new implementation for threads that is safe for space.
Keywords: coroutines, space safety, threads, continuations, Standard ML

14 published by ACM
May 1996 PLDI '96: Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Publisher: ACM
Citation Count: 139
Downloads (6 Weeks): 1,   Downloads (12 Months): 19,   Downloads (Overall): 533

Full text available: PDFPDF
Also published in:
May 1996  ACM SIGPLAN Notices: Volume 31 Issue 5, May 1996

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us