Yu Zhang, David Nowak  Home/Search
Context Related
| lsv.enscachan.fr/~nowak/csl03.ps lsv.enscachan.fr/Publi...ZNcsl2003.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lsv.enscachan.fr...publisen.php (more) Homepages: Y.Zhang D.Nowak |
Rate this article:      (best)Comment on this article |
Abstract: Pitts and Stark's nu-calculus is a typed lambda-calculus which forms a basis for the study of interaction between higher-order functions and dynamically created names. A similar approach has received renewed attention recently through Sumii and Pierce's cryptographic lambda-calculus, which deals with security protocols. Logical relations are a powerful tool to prove properties of such a calculus, notably observational equivalence. While Pitts and Stark construct a logical relation for the... (Update)
Cited by: More
Complete Lax Logical Relations for Cryptographic.. - Goubault-Larrecq.. (2004) (Correct)
Similar documents (at the sentence level):
10.0%: Logical Relations for Names - Zhang (2002) (Correct)
Active bibliography (related documents): More All
0.5: On the Geometry of Intuitionistic S4 Proofs - Goubault-Larrecq, Goubault (2002) (Correct)
0.4: Logical Relations for Monadic Types - Goubault-Larrecq, Lasota, Nowak (2002) (Correct)
0.2: On a Semantic Definition of Data Independence - Lazic, Nowak (2003) (Correct)
Similar documents based on text: More All
0.7: Towards a Theory of Bisimulation for Local Names - Jeffrey, Rathke (1999) (Correct)
0.7: Reasoning about Local Variables with Operationally-Based Logical.. - Pitts (1996) (Correct)
0.7: Names, Equations, Relations: Practical Ways to Reason about `new' - Stark (1997) (Correct)
Related documents from co-citation: More All
3: Proof techniques for cryptographic processes - Boreale, De Nicola et al. - 1999
3: A characterization of lambda definability in categorical models of implicit poly.. - Alimohamed - 1995
3: Lax logical relations - Plotkin, Power et al. - 2000
BibTeX entry: (Update)
Y. Zhang and D. Nowak. Logical relations for dynamic name creation. In Proc. 17th Int. Workshop Computer Science Logic (CSL) and 8th Kurt Gdel Coll. (KGL), volume 2803 of Lecture Notes in Computer Science, pages 575--588. Springer, Aug. 2003. http://citeseer.ist.psu.edu/zhang03logical.html More
@inproceedings{ zn03:logrdn,
author = {Yu Zhang and David Nowak},
title = {Logical Relations for Dynamic Name Creation},
booktitle = {Proceedings of the 12th Annual Conference of
the European Association for
Computer Science Logic (CSL'03)},
month = Aug,
year = 2003,
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
url = {citeseer.ist.psu.edu/zhang03logical.html} }
Citations (may not include all citations):369 Information and Computation (context) - Moggi, computation - 1991
359 Introduction to Higher Order Categorical Logic (context) - Lambek, Scott - 1986
291 Computational lambda-calculus and monads - Moggi - 1989
229 Foundations of Programming Languages (context) - Mitchell - 1996
106 Observable properties of higher order functions that dynamic.. - Pitts, Stark - 1993
72 An abstract view of programming languages (context) - Moggi - 1990
41 Kripke-style models for typed lambda calculus - Mitchell, Moggi - 1987
31 Names and Higher-Order Functions - Stark - 1994
31 Lisp and Symbolic Computation (context) - Stark, for - 1996
28 Notes on sconing and relators - Mitchell, Scedrov - 1993
22 Distributive laws (context) - Beck - 1969
21 Logical relations for encryption - Sumii, Pierce - 2001
9 relations: Practical ways to reason about new (context) - Stark, equations - 1998
4 A characterization of lambda de nability in categorical mode.. (context) - Alimohamed - 1995
2 Logical relations for monadic types - Goubault-Larrecq, Lasota et al. - 2002
1 Logical relations for names - Zhang - 2002
Documents on the same site (http://www.lsv.ens-cachan.fr/~nowak/publis-en.php): More
Logical Relations for Monadic Types - Goubault-Larrecq, Lasota, Nowak (2002) (Correct)
Toward Symbolic Verification of Programs Handling Pointers - Bardin, Finkel, Nowak (2004) (Correct)
Logical Relations for Monadic Types - Goubault-Larrecq, Lasota, Nowak (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC