| 2002 |
|---|
| 30 | EE | Jon G. Riecke,
Christopher A. Stone:
Privacy via Subsumption.
Inf. Comput. 172(1): 2-28 (2002) |
| 29 | EE | Jon G. Riecke,
Anders Sandholm:
A Relational Account of Call-by-Value Sequentiality.
Inf. Comput. 179(2): 296-331 (2002) |
| 2001 |
|---|
| 28 | EE | Anindya Basu,
Jon G. Riecke:
Stability issues in OSPF routing.
SIGCOMM 2001: 225-236 |
| 27 | EE | Anindya Banerjee,
Nevin Heintze,
Jon G. Riecke:
Design and Correctness of Program Transformations Based on Control-Flow Analysis.
TACS 2001: 420-447 |
| 2000 |
|---|
| 26 | EE | Kathleen Fisher,
John H. Reppy,
Jon G. Riecke:
A Calculus for Compiling and Linking Classes.
ESOP 2000: 135-149 |
| 1999 |
|---|
| 25 | EE | Jon G. Riecke,
Hayo Thielecke:
Typed Exeptions and Continuations Cannot Macro-Express Each Other.
ICALP 1999: 635-644 |
| 24 | EE | Anindya Banerjee,
Nevin Heintze,
Jon G. Riecke:
Region Analysis and the Polymorphic Lambda Calculus.
LICS 1999: 88-97 |
| 23 | EE | Martín Abadi,
Anindya Banerjee,
Nevin Heintze,
Jon G. Riecke:
A Core Calculus of Dependency.
POPL 1999: 147-160 |
| 22 | | Jon G. Riecke,
Ramesh Subrahmanyam:
Conditions for the completeness of functional and algebraic equational reasoning.
Mathematical Structures in Computer Science 9(6): 651-685 (1999) |
| 1998 |
|---|
| 21 | EE | Nevin Heintze,
Jon G. Riecke:
The SLam Calculus: Programming with Secrecy and Integrity.
POPL 1998: 365-377 |
| 1997 |
|---|
| 20 | EE | Jon G. Riecke,
Anders Sandholm:
A Relational Account of Call-by-Value Sequentiality.
LICS 1997: 258-267 |
| 19 | | Jon G. Riecke:
Program Language Semantics: The Description of Computational Structures.
SIGPLAN Notices 32(1): 106-109 (1997) |
| 1996 |
|---|
| 18 | | John H. Reppy,
Jon G. Riecke:
Simple Objects for Standard ML.
PLDI 1996: 171-180 |
| 17 | | Jon G. Riecke:
Semantics: The Description of Computational Structures.
ACM Comput. Surv. 28(4es): 173 (1996) |
| 16 | | Jawahar Chirimar,
Carl A. Gunter,
Jon G. Riecke:
Reference Counting as a Computational Interpretation of Linear Logic.
J. Funct. Program. 6(2): 195-244 (1996) |
| 1995 |
|---|
| 15 | | Carl A. Gunter,
Didier Rémy,
Jon G. Riecke:
A Generalization of Exceptions and Control in ML-like Languages.
FPCA 1995: 12-23 |
| 14 | | Jon G. Riecke,
Ramesh Viswanathan:
Isolating Side Effects in Sequential Languages.
POPL 1995: 1-12 |
| 13 | | Jon G. Riecke:
Statman's 1-Section Theorem
Inf. Comput. 116(2): 294-303 (1995) |
| 12 | | Peter W. O'Hearn,
Jon G. Riecke:
Kripke Logical Relations and PCF
Inf. Comput. 120(1): 107-116 (1995) |
| 1994 |
|---|
| 11 | | Peter W. O'Hearn,
Jon G. Riecke:
Fully Abstract Translations and Parametric Polymorphism.
ESOP 1994: 454-468 |
| 10 | | Jon G. Riecke,
Ramesh Subrahmanyam:
Extensions to Type Systems Can Preserve Operational Equivalences.
TACS 1994: 76-95 |
| 1993 |
|---|
| 9 | | Jon G. Riecke:
Delimiting the Scope of Effects.
FPCA 1993: 146-158 |
| 8 | | Jon G. Riecke,
Ramesh Subrahmanyam:
Algebraic Reasoning and Completeness in Typed Languages.
POPL 1993: 185-195 |
| 7 | | Jon G. Riecke:
Fully Abstract Translations Between Functional Languages.
Mathematical Structures in Computer Science 3(4): 387-415 (1993) |
| 1992 |
|---|
| 6 | EE | Jawahar Chirimar,
Carl A. Gunter,
Jon G. Riecke:
Proving Memory Management Invariants for a Language Based on Linear Logic.
LISP and Functional Programming 1992: 139-150 |
| 1991 |
|---|
| 5 | | Jon G. Riecke:
Fully Abstract Translations between Functional Languages.
POPL 1991: 245-254 |
| 1990 |
|---|
| 4 | | Jon G. Riecke:
A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report).
ICALP 1990: 20-31 |
| 3 | | Stavros S. Cosmadakis,
Albert R. Meyer,
Jon G. Riecke:
Completeness for typed lazy inequalities
LICS 1990: 312-320 |
| 1988 |
|---|
| 2 | EE | Albert R. Meyer,
Jon G. Riecke:
Continuations May be Unreasonable.
LISP and Functional Programming 1988: 63-71 |
| 1987 |
|---|
| 1 | | Kim B. Bruce,
Jon G. Riecke:
The Semantics of Miranda's Algebraic Types.
MFPS 1987: 455-473 |
