Jon G. Riecke

According to our database, Jon G. Riecke authored at least 31 papers between 1987 and 2002.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2002

A Relational Account of Call-by-Value Sequentiality.

Jon G. Riecke, Anders Sandholm

Inf. Comput., 2002

Privacy via Subsumption.

Jon G. Riecke, Christopher A. Stone

Inf. Comput., 2002

2001

Design and Correctness of Program Transformations Based on Control-Flow Analysis.

Anindya Banerjee, Nevin Heintze, Jon G. Riecke

Proceedings of the Theoretical Aspects of Computer Software, 4th International Symposium, 2001

Stability issues in OSPF routing.

Anindya Basu, Jon G. Riecke

Proceedings of the ACM SIGCOMM 2001 Conference on Applications, 2001

2000

A Calculus for Compiling and Linking Classes.

Kathleen Fisher, John H. Reppy, Jon G. Riecke

Proceedings of the Programming Languages and Systems, 2000

1999

Report on POPL 1999.

Jon G. Riecke

SIGACT News, 1999

Conditions for the completeness of functional and algebraic equational reasoning.

Jon G. Riecke, Ramesh Subrahmanyam

Math. Struct. Comput. Sci., 1999

A Core Calculus of Dependency.

Martín Abadi, Anindya Banerjee, Nevin Heintze, Jon G. Riecke

Proceedings of the POPL '99, 1999

Region Analysis and the Polymorphic Lambda Calculus.

Anindya Banerjee, Nevin Heintze, Jon G. Riecke

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

Typed Exeptions and Continuations Cannot Macro-Express Each Other.

Jon G. Riecke, Hayo Thielecke

Proceedings of the Automata, 1999

1998

The SLam Calculus: Programming with Secrecy and Integrity.

Nevin Heintze, Jon G. Riecke

Proceedings of the POPL '98, 1998

1997

Program Language Semantics: The Description of Computational Structures.

Jon G. Riecke

ACM SIGPLAN Notices, 1997

The analysis of programming structure.

John C. Mitchell, Jon G. Riecke

SIGACT News, 1997

1996

Reference Counting as a Computational Interpretation of Linear Logic.

Jawahar Chirimar, Carl A. Gunter, Jon G. Riecke

J. Funct. Program., 1996

Semantics: The Description of Computational Structures.

Jon G. Riecke

ACM Comput. Surv., 1996

Simple Objects for Standard ML.

John H. Reppy, Jon G. Riecke

Proceedings of the ACM SIGPLAN'96 Conference on Programming Language Design and Implementation (PLDI), 1996

1995

Kripke Logical Relations and PCF

Peter W. O'Hearn, Jon G. Riecke

Inf. Comput., July, 1995

Statman's 1-Section Theorem

Jon G. Riecke

Inf. Comput., February, 1995

Isolating Side Effects in Sequential Languages.

Jon G. Riecke, Ramesh Viswanathan

Proceedings of the Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995

A Generalization of Exceptions and Control in ML-like Languages.

Carl A. Gunter, Didier Rémy, Jon G. Riecke

Proceedings of the seventh international conference on Functional programming languages and computer architecture, 1995

1994

Extensions to Type Systems Can Preserve Operational Equivalences.

Jon G. Riecke, Ramesh Subrahmanyam

Proceedings of the Theoretical Aspects of Computer Software, 1994

Fully Abstract Translations and Parametric Polymorphism.

Peter W. O'Hearn, Jon G. Riecke

Proceedings of the Programming Languages and Systems, 1994

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 Between Functional Languages.

Jon G. Riecke

Math. Struct. Comput. Sci., 1993

Algebraic Reasoning and Completeness in Typed Languages.

Jon G. Riecke, Ramesh Subrahmanyam

Proceedings of the Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1993

Delimiting the Scope of Effects.

Jon G. Riecke

Proceedings of the conference on Functional programming languages and computer architecture, 1993

1992

Proving Memory Management Invariants for a Language Based on Linear Logic.

Jawahar Chirimar, Carl A. Gunter, Jon G. Riecke

Proceedings of the Conference on Lisp and Functional Programming, 1992

1990

Completeness for typed lazy inequalities

Stavros S. Cosmadakis, Albert R. Meyer, Jon G. Riecke

Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report).

Jon G. Riecke

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1988

Continuations May be Unreasonable.

Albert R. Meyer, Jon G. Riecke

Proceedings of the 1988 ACM Conference on LISP and Functional Programming, 1988

1987

The Semantics of Miranda's Algebraic Types.

Kim B. Bruce, Jon G. Riecke

Proceedings of the Mathematical Foundations of Programming Language Semantics, 1987