The Semantics of Miranda's Algebraic Types. - Kim B. Bruce; Jon G. Riecke (MFPS, 1987)

Continuations May be Unreasonable. - Albert R. Meyer; Jon G. Riecke (LISP and Functional Programming, 1988)

A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report). - Jon G. Riecke (ICALP, 1990)

Completeness for typed lazy inequalities - Stavros S. Cosmadakis; Albert R. Meyer; Jon G. Riecke (LICS, 1990)

Proving Memory Management Invariants for a Language Based on Linear Logic. - Jawahar Chirimar; Carl A. Gunter; Jon G. Riecke (LISP and Functional Programming, 1992)

Delimiting the Scope of Effects. - Jon G. Riecke (FPCA, 1993)

Algebraic Reasoning and Completeness in Typed Languages. - Jon G. Riecke; Ramesh Subrahmanyam (POPL, 1993)

Fully Abstract Translations Between Functional Languages. - Jon G. Riecke (Math. Struct. Comput. Sci., 1993)

BOOK REVIEW: Action Semantics. By Peter D. Mosses. (Cambridge University Press, 1992. xx+372pp. ISBN 0-521-40347-2. $49.95). - Jon G. Riecke (SIGACT News, 1993)

Fully Abstract Translations and Parametric Polymorphism. - Peter W. O'Hearn; Jon G. Riecke (ESOP, 1994)

Extensions to Type Systems Can Preserve Operational Equivalences. - Jon G. Riecke; Ramesh Subrahmanyam (TACS, 1994)

A Generalization of Exceptions and Control in ML-like Languages. - Carl A. Gunter; Didier Rémy; Jon G. Riecke (FPCA, 1995)

Isolating Side Effects in Sequential Languages. - Jon G. Riecke; Ramesh Viswanathan (POPL, 1995)

Statman's 1-Section Theorem - Jon G. Riecke (Inf. Comput., 1995)

Kripke Logical Relations and PCF - Peter W. O'Hearn; Jon G. Riecke (Inf. Comput., 1995)

Simple Objects for Standard ML. - John H. Reppy; Jon G. Riecke (PLDI, 1996)

Semantics: The Description of Computational Structures. - Jon G. Riecke (ACM Comput. Surv., 1996)

Reference Counting as a Computational Interpretation of Linear Logic. - Jawahar Chirimar; Carl A. Gunter; Jon G. Riecke (J. Funct. Program., 1996)

The analysis of programming structure. - John C. Mitchell; Jon G. Riecke (SIGACT News, 1997)

Program Language Semantics: The Description of Computational Structures. - Jon G. Riecke (ACM SIGPLAN Notices, 1997)

The SLam Calculus: Programming with Secrecy and Integrity. - Nevin Heintze; Jon G. Riecke (POPL, 1998)

Typed Exeptions and Continuations Cannot Macro-Express Each Other. - Jon G. Riecke; Hayo Thielecke (ICALP, 1999)

Region Analysis and the Polymorphic Lambda Calculus. - Anindya Banerjee 001; Nevin Heintze; Jon G. Riecke (LICS, 1999)

A Core Calculus of Dependency. - Martín Abadi; Anindya Banerjee 001; Nevin Heintze; Jon G. Riecke (POPL, 1999)

Conditions for the completeness of functional and algebraic equational reasoning. - Jon G. Riecke; Ramesh Subrahmanyam (Math. Struct. Comput. Sci., 1999)

Report on POPL 1999. - Jon G. Riecke (SIGACT News, 1999)

A Calculus for Compiling and Linking Classes. - Kathleen Fisher; John H. Reppy; Jon G. Riecke (ESOP, 2000)

Stability issues in OSPF routing. - Anindya Basu; Jon G. Riecke (SIGCOMM, 2001)

Design and Correctness of Program Transformations Based on Control-Flow Analysis. - Anindya Banerjee 001; Nevin Heintze; Jon G. Riecke (TACS, 2001)

Privacy via Subsumption. - Jon G. Riecke; Christopher A. Stone (Inf. Comput., 2002)

A Relational Account of Call-by-Value Sequentiality. - Jon G. Riecke; Anders Sandholm 001 (Inf. Comput., 2002)