bibliography riecke



  1. Kim B. Bruce and Jon G. Riecke, The Semantics of M iranda s Algebraic Types, Mathematical Foundations of Programming Language Semantics: it 3 rd Workshop, Ed. M. Main and A. Melton and M. Mislove and D. Schmidt, pp. 455--475, Lecture Notes in Computer Science.
  2. Meyer Albert R. and Jon G. Riecke, Continuations may be unreasonable (preliminary report), Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, pp. 63--71, ACM.
  3. Jon G. Riecke, Should a Function Continue?, Massachusetts Institute of Technology, 1989, (Available as technical report MIT LCS TR-459 (MIT Laboratory for Computer Science).) .
  4. Bard Bloom and Jon G. Riecke, LCF Should Be Lifted, Proc. Conf. Algebraic Methodology and Software Technology, Ed. Teodor Rus, pp. 133--136, Department of Computer Science University of Iowa, 1989.
  5. Stavros S. Cosmadakis and Albert R. Meyer and Jon G. Riecke, Completeness for typed lazy inequalities (preliminary report), Proceedings Fifth Annual IEEE Symposium on Logic in Computer Science, pp. 312--320.
  6. Jon G. Riecke, A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report), Automata Languages and Programming: it 17 th International Colloquium, Ed. Michael S. Paterson, pp. 20--31, Springer-Verlag, Lecture Notes in Computer Science.
  7. Jon G. Riecke, Fully Abstract Translations between Functional Languages (Preliminary Report), Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pp. 245--254, ACM Press.
  8. Jon G. Riecke, The Logic and Expressibility of Simply-Typed Call-by-Value and Lazy Languages, Massachusetts Institute of Technology, (Available as technical report MIT LCS TR-523 (MIT Laboratory for Computer Science).) .
  9. Jawahar Chirimar and Carl A. Gunter and Jon G. Riecke, Proving Memory Management Invariants for a Language Based on Linear Logic, Proceedings of the 1992 ACM Conference on Lisp and Functional Programming, pp. 139--150, ACM.
  10. Jon G. Riecke and Ramesh Subrahmanyam, Algebraic Reasoning and Completeness in Typed Languages, Conference Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages, pp. 185--195, ACM.
  11. Jon G. Riecke, R eview of P eter M osses em A ction S emantics, SIGACT News, ACM, Spring 1993.
  12. Jon G. Riecke, Delimiting the scope of effects, Proceedings of the 1993 Conference on Functional Programming and Computer Architecture, pp. 146--158, ACM.
  13. Jon G. Riecke, Fully Abstract Translations between Functional Languages, Mathematical Structures in Computer Science, pp. 387--415, (Preliminary version appeared in it Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages pages 245--254 ACM 1991.) .
  14. Peter W. O Hearn and Jon G. Riecke, Fully abstract translations and parametric polymorphism, Programming Languages and Systems---ESOP 94, Ed. Donald Sannella, 788, pp. 454--468, Springer-Verlag, Lecture Notes in Computer Science, 1994.
  15. Jon G. Riecke and Ramesh Subrahmanyam, Extensions to Type Systems Can Preserve Operational Equivalences, Proceedings of 1994 International Symposium on Theoretical Aspects of Computer Software, Ed. Masami Hagiya and John C. Mitchell, pp. 76--95, Springer-Verlag, Lecture Notes in Computer Science.
  16. Jon G. Riecke and Ramesh Viswanathan, Isolating side effects in sequential languages, Conference Record of the Twenty-Second Annual ACM Symposium on Principles of Programming Languages, pp. 1--12, ACM.
  17. Peter W. O Hearn and Jon G. Riecke, Kripke Relations and PCF, Information and Computation, pp. 107--116.
  18. Jon G. Riecke, Statman s 1-Section Theorem, it Information and Computation, pp. 275--293.
  19. Carl A. Gunter and Didier R e my and Jon G. Riecke, A Generalization of Exceptions and Control in ML-like Languages, 1995 Conference on Functional Programming and Computer Architecture, pp. 12--23, ACM Press.
  20. Jawahar Chirimar and Carl A. Gunter and Jon G. Riecke, Reference Counting as a Computational Interpretation of Linear Logic, Journal of Functional Programming, pp. 195--244.
  21. John H. Reppy and Jon G. Riecke, Simple Objects for Standard ML, 1996 Conference on Programming Language Design and Implementation, pp. 171--180, ACM Press.
  22. Achim Jung and Marcelo Fiore and Eugenio Moggi and Peter O Hearn and Jon G. Riecke and Giuseppe Rosolini and Ian Stark, Domains and Denotational Semantics: History Accomplishments and Open Problems, Bulletin of the European Association for Theoretical Computer Science, pp. 227--256.
  23. John H. Reppy and Jon G. Riecke, Classes in Object ML via Modules, Third Workshop on Foundations of Object-Oriented Languages.
  24. Jon G. Riecke, Semantics: The Description of Computational Structures, ACM Computing Surveys, Vol. 28A, (http: www.acm.org surveys 1996 RieckeSemantics) .
  25. Jon G. Riecke, The Analysis of Programming Structure, ACM SIGACT News, pp. 24--31.
  26. Jon G. Riecke and Anders Sandholm, A Relational Account of Call-by-value Sequentiality, Proceedings Twelfth Annual IEEE Symposium on Logic in Computer Science, pp. 258--267, IEEE Computer Society Press.
  27. Jon G. Riecke and Ramesh Subrahmanyam, Semantic Orthogonality of Type Disciplines, (Submitted for publication. Manuscript available from tt http: www.cs.bell-labs.com who riecke) .
  28. Nevin Heintze and Jon G. Riecke, The SLam calculus: programming with secrecy and integrity, Conference Record of the Twenty-Fifth Annual ACM Symposium on Principles of Programming Languages, pp. 365--377, ACM.
  29. Carl A. Gunter and Didier R e my and Jon G. Riecke, Return Types for Functional Continuations, (Submitted for publication. Manuscript available from tt http: www.cs.bell-labs.com who riecke) .
  30. Mart i n Abadi and Anindya Banerjee and Nevin Heintze and Jon G. Riecke, A Core Calculus of Dependency, Conference Record of the Twenty-Sixth Annual ACM Symposium on Principles of Programming Languages, pp. 147--160, ACM.
  31. Jon G. Riecke and Christopher A. Stone, Privacy via Subsumption, Theory and Practice of Object Systems, (To appear.) .
  32. Jon G. Riecke and Ramesh Subrahmanyam, Conditions for the Completeness of Functional and Algebraic Equational Reasoning, Mathematical Structures in Computer Science, (To appear. Preliminary version appeared as Algebraic Reasoning and Completeness in Typed Languages in it Conference Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages pages 185-195. ACM Press 1993.) .
  33. Anindya Banerjee and Nevin Heintze and Jon G. Riecke, Region analysis and the polymorphic lambda calculus, Proceedings Fourteenth Annual IEEE Symposium on Logic in Computer Science, pp. 88--97.
  34. Jon G. Riecke and Hayo Thielecke, Typed exceptions and continuations cannot macro-express each other, Proceedings International Conference on Automata Languages and Programming, Springer-Verlag, Lecture Notes in Computer Science, 1999.
  35. The ML2000 Working Group, Principles and a preliminary design for ML2000, (Unpublished manuscript) .
  36. Kathleen Fisher and John Reppy and and Jon G. Riecke, A calculus for compiling and linking classes, (Unpublished manuscript) .

Go to the Computing Sciences Research Center home page.
Modified: December, 1997.
Copyright © 1997 Lucent Technologies. All rights reserved.