Research papers
-
Jon G. Riecke and Anders Sandholm.
A Relational Account of Call-by-Value Sequentiality.
Information and Computation, 2000. To appear.
-
Jon G. Riecke and Christopher A. Stone.
Privacy via subsumption.
Information and Computation, 2000. To appear.
Abstract
Postscript
-
Kathleen Fisher, John Reppy, and Jon G. Riecke.
A calculus for compiling and linking classes.
In Proceedings, European Symposium on Programming,
Lecture Notes in Computer Science.
Springer-Verlag, 2000.
Abstract
Postscript
(extended abstract)
-
Jon G. Riecke and Ramesh Subrahmanyam.
Conditions for the Completeness of Functional and Algebraic
Equational Reasoning.
Mathematical Structures in Computer Science, volume 9,
number 6, pages 651-685. Cambridge University Press, 1999.
Abstract
Older
version
-
The ML2000 Working Group.
Principles and a preliminary design for ML2000.
Submitted for publication, 1999.
Abstract
Postscript (extended abstract)
-
Jon G. Riecke and Hayo Thielecke.
Typed exceptions and continuations cannot macro-express each other.
In Proceedings, International Conference on Automata,
Languages, and Programming,
volume 1644 of
Lecture Notes in Computer Science.
Springer-Verlag, 1999.
© Copyright 1999 by Springer-Verlag.
Abstract
Postscript
-
Anindya Banerjee, Nevin Heintze, and Jon G. Riecke.
Region analysis and the polymorphic lambda calculus.
In Proceedings, Fourteenth IEEE
Symposium on Logic in Computer Science, pages 88-97. IEEE Computer
Society Press, 1999.© Copyright 1999 by IEEE,
Inc.
Abstract
Postscript
-
Martín Abadi, Anindya Banerjee, Nevin Heintze, and Jon G. Riecke.
A core calculus of dependency.
In Twenty-Sixth ACM Conference on Principles of Programming
Languages, pages 147-160. ACM Press, 1999.© Copyright 1999 by ACM,
Inc.
Abstract
Postscript
-
Nevin Heintze and Jon G. Riecke.
The SLam Calculus: Programming with Secrecy and Integrity.
In Twenty-Fifth ACM Conference on Principles of Programming
Languages, pages 365-377. ACM Press, 1998. © Copyright 1998 by ACM,
Inc.
Abstract
Postscript
Older version.
-
Jon G. Riecke and Christopher A. Stone.
Privacy via subsumption.
In Fifth Workshop on Foundations of Object-Oriented Languages,
San Diego, CA, 1998.
Abstract
Postscript
-
Jon G. Riecke and Ramesh Subrahmanyam.
Semantic Orthogonality of Type Disciplines.
Submitted for publication, 1997.
Abstract
Postscript
-
Carl A. Gunter, Didier Rémy, and Jon G. Riecke.
Return Types for Functional Continuations.
Submitted for publication, 1997.
Abstract
Postscript
-
Jon G. Riecke and Anders Sandholm.
A Relational Account of Call-by-Value Sequentiality.
In Proceedings, Twelfth IEEE
Symposium on Logic in Computer Science, pages 258-267. IEEE Computer
Society Press, 1997.
Abstract
Postscript
-
Jon G. Riecke.
The Analysis of Programming Structure.
In ACM SIGACT News, 28(2), pages 24-31, June 1997.
Abstract
Postscript
-
Jon G. Riecke.
Semantics: The Description of Computational Structures.
In ACM Computing Surveys 28A(4), December 1996.
© Copyright 1996 by ACM, Inc.
Abstract
Postscript
-
John H. Reppy and Jon G. Riecke.
Classes in Object ML via Modules.
In Third Workshop on Foundations
of Object-Oriented Languages. July, 1996.
Abstract
Postscript
-
John H. Reppy and Jon G. Riecke.
Simple Objects for Standard ML.
In 1996 Conference on Programming
Language Design and Implementation, pages 171-180. ACM Press, 1996.
© Copyright 1996 by ACM, Inc.
Abstract
Postscript
-
Jawahar Chirimar, Carl A. Gunter, and Jon G. Riecke.
Reference Counting as a Computational Interpretation of Linear Logic.
In Journal of Functional Programming, 6(2), pages 195-244, March 1996.
Abstract
-
Achim Jung, Marcelo Fiore, Eugenio Moggi, Peter O'Hearn, Jon G. Riecke,
Giuseppe Rosolini, and Ian Stark.
Domains and Denotational Semantics: History, Accomplishments,
and Open Problems.
In Bulletin of the European
Association for Theoretical Computer Science. 1996.
Abstract
Postscript
-
Peter W. O'Hearn and Jon G. Riecke.
Kripke Logical Relations and PCF.
In Information and Computation, 120(1), pages 107-116, July 1995.
Abstract
-
Carl A. Gunter, Didier Rémy, and Jon G. Riecke.
A Generalization of Exceptions and Control in ML-like Languages.
In
1995 Conference on Functional Programming and Computer Architecture,
pages 12-23. ACM Press, 1995. © Copyright
1995 by ACM, Inc.
Abstract
Postscript
-
Jon G. Riecke.
Statman's 1-Section Theorem.
In Information and Computation, volume 116, pages 275-293.
Academic Press, 1995.
Abstract
-
Jon G. Riecke and Ramesh Viswanathan.
Isolating Side Effects in Sequential Languages.
In Twenty-Second
ACM Conference on Principles of Programming Languages, pages 1-12.
ACM Press, 1995. © Copyright 1995
by ACM, Inc.
Abstract
Postscript
-
Jon G. Riecke and Ramesh Subrahmanyam.
Extensions to Type Systems Can Preserve Operational Equivalences.
In Proceedings of
the International Symposium on Theoretical Aspects of Computer Software,
volume 789 of Lecture Notes in Computer Science, pages 76-95. Springer
Verlag, 1994.
Abstract
-
Peter W. O'Hearn and Jon G. Riecke.
Fully Abstract Translations and Parametric Polymorphism.
In Proceedings of the
Fifth European Symposium on Programming, volume 788 of Lecture Notes
in Computer Science, pages 454-468. Springer Verlag, 1994.
Abstract
-
Jon G. Riecke.
Delimiting the Scope of Effects.
In Proceedings of the 1993 Conference on
Functional Programming and Computer Architecture, pages 146-158. ACM
Press, 1993. © Copyright 1993 by ACM,
Inc.
Abstract
Postscript
-
Jon G. Riecke.
Fully Abstract Translations between Functional Languages.
In Mathematical Structures in Computer Science,
volume 3, pages 387-415. Cambridge University Press, 1993.
Abstract
-
Jon G. Riecke and Ramesh Subrahmanyam.
Algebraic Reasoning and Completeness in Typed Languages.
In Twentieth ACM
Conference on Principles of Programming Languages, pages 185-195. ACM
Press, 1993. © Copyright 1993 by ACM,
Inc.
Abstract
Postscript
-
Jawahar Chirimar, Carl A. Gunter, and Jon G. Riecke.
Proving Memory Management Invariants for a Language Based on Linear Logic.
In Proceedings
of the 1992 ACM Conference on Lisp and Functional Programming, pages
139-150. ACM Press, 1992. © Copyright
1992 by ACM, Inc.
Abstract
Postscript
-
Jon G. Riecke.
The Logic and Expressibility of Simply-typed Call-by-value and Lazy Languages.
PhD thesis, Massachusetts Institute of Technology. Available
as Technical Report MIT/LCS/TR-523.
Abstract
Postscript
-
Jon G. Riecke.
Fully Abstract Translations between Functional Languages
(Preliminary Report).
In Eighteenth ACM Conference on Principles
of Programming Languages, pages 245-254. ACM Press, 1991. ©
Copyright 1991 by ACM, Inc.
Abstract
Postscript
-
Bard Bloom and Jon G. Riecke.
LCF Should Be Lifted.
In Proceedings of Conference
on Algebraic Methodology and Software Technology, Teodor Rus, editor,
pages 133-136. Department of Computer Science, University of Iowa,
1989.
Abstract
Postscript
-
Jon G. Riecke.
Should a Function Continue?
Master's thesis, Massachusetts Institute of Technology.
Available as Technical Report MIT/LCS/TR-523.
Abstract
Postscript
Last updated: 14 August 1998
riecke@bell-labs.com