Jon G. Riecke - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2002

A Relational Account of Call-by-Value SequentialityJon G. Riecke, Anders Sandholm. iandc, 179(2):296-331, 2002. [doi]

Privacy via SubsumptionJon G. Riecke, Christopher A. Stone. iandc, 172(1):2-28, 2002. [doi]

2001

Design and Correctness of Program Transformations Based on Control-Flow AnalysisAnindya Banerjee, Nevin Heintze, Jon G. Riecke. tacs 2001: 420-447 [doi]

Stability issues in OSPF routingAnindya Basu, Jon G. Riecke. sigcomm 2001: 225-236 [doi]

2000

A Calculus for Compiling and Linking ClassesKathleen Fisher, John H. Reppy, Jon G. Riecke. ESOP 2000: 135-149 [doi]

1999

1998

The SLam Calculus: Programming with Secrecy and IntegrityNevin Heintze, Jon G. Riecke. POPL 1998: 365-377 [doi]

1997

The analysis of programming structureJohn C. Mitchell, Jon G. Riecke. sigact, 28(2):24-31, 1997. [doi]

A Relational Account of Call-by-Value SequentialityJon G. Riecke, Anders Sandholm. lics 1997: 258-267 [doi]

Program Language Semantics: The Description of Computational StructuresJon G. Riecke. SIGPLAN, 32(1):106-109, 1997.

1996

Reference Counting as a Computational Interpretation of Linear LogicJawahar Chirimar, Carl A. Gunter, Jon G. Riecke. JFP, 6(2):195-244, 1996.

Simple Objects for Standard MLJohn H. Reppy, Jon G. Riecke. PLDI 1996: 171-180

Semantics: The Description of Computational StructuresJon G. Riecke. ACM Comput. Surv., 28(4es):173, 1996.

1995

A Generalization of Exceptions and Control in ML-like LanguagesCarl A. Gunter, Didier Rémy, Jon G. Riecke. fpca 1995: 12-23

Kripke Logical Relations and PCFPeter W. O Hearn, Jon G. Riecke. iandc, 120(1):107-116, July 1995.

Statman s 1-Section TheoremJon G. Riecke. iandc, 116(2):294-303, February 1995.

Isolating Side Effects in Sequential LanguagesJon G. Riecke, Ramesh Viswanathan. POPL 1995: 1-12

1994

Fully Abstract Translations and Parametric PolymorphismPeter W. O Hearn, Jon G. Riecke. ESOP 1994: 454-468

Extensions to Type Systems Can Preserve Operational EquivalencesJon G. Riecke, Ramesh Subrahmanyam. tacs 1994: 76-95

1993

Algebraic Reasoning and Completeness in Typed LanguagesJon G. Riecke, Ramesh Subrahmanyam. POPL 1993: 185-195

Delimiting the Scope of EffectsJon G. Riecke. fpca 1993: 146-158

Fully Abstract Translations Between Functional LanguagesJon G. Riecke. mscs, 3(4):387-415, 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, 24(2):24-25, 1993. [doi]

1992

Proving Memory Management Invariants for a Language Based on Linear LogicJawahar Chirimar, Carl A. Gunter, Jon G. Riecke. lfp 1992: 139-150 [doi]

1991

Fully Abstract Translations between Functional LanguagesJon G. Riecke. POPL 1991: 245-254

1990

Completeness for typed lazy inequalitiesStavros S. Cosmadakis, Albert R. Meyer, Jon G. Riecke. lics 1990: 312-320

A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report)Jon G. Riecke. icalp 1990: 20-31

1988

Continuations May be UnreasonableAlbert R. Meyer, Jon G. Riecke. lfp 1988: 63-71 [doi]

1987

The Semantics of Miranda s Algebraic TypesKim B. Bruce, Jon G. Riecke. mfps 1988: 455-473

Sign in or sign up to see more results.

runs on WebDSL