## Names, Equations, Relations: Practical Ways to Reason about new (1996)

### Cached

### Download Links

- [www.brics.dk]
- [www.brics.dk]
- [homepages.inf.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- [homepages.inf.ed.ac.uk]
- [www.dcs.ed.ac.uk]
- DBLP

### Other Repositories/Bibliography

Citations: | 6 - 0 self |

### BibTeX

@MISC{Stark96names,equations,,

author = {Ian Stark},

title = {Names, Equations, Relations: Practical Ways to Reason about new},

year = {1996}

}

### OpenURL

### Abstract

The nu-calculus of Pitts and Stark is a typed lambda-calculus, extended with state in the form of dynamically-generated names. These names can be created locally, passed around, and compared with one another. Through the interaction between names and functions, the language can capture notions of scope, visibility and sharing. Originally motivated by the study of references in Standard ML, the nu-calculus has connections to other kinds of local declaration, and to the mobile processes of the π-calculus. This

### Citations

1613 | The Definition of Standard ML - Milner, Tofte, et al. - 1990 |

815 | A calculus for cryptographic protocols: The spi calculus
- Abadi, Gordon
- 1999
(Show Context)
Citation Context ...oncurrency, the π-calculus [20] uses dynamically-generated names to describe the behaviour of mobile processes, whose communication topology may change over time. The spi-calculus of Abadi and Gordon =-=[1]-=- uses generative names to model cryptographic keys in the verification of security protocols. In functional programming, the language Standard ML [21] extends typed lambda-calculus with a number of fe... |

759 | Notions of computation and monads - Moggi - 1991 |

429 | Isabelle: A Generic Theorem Prover - Paulson - 1994 |

267 | A revised report on the syntactic theories of sequential control and state - Felleisen, Hieb - 1992 |

243 | The lazy lambda calculus
- Abramsky
- 1990
(Show Context)
Citation Context ...lence but are easier to work with. One possibility is to define such relations directly from the operational semantics of the language, as with the applicative bisimilarity variously used by Abramsky =-=[2]-=-, Howe [13], Gordon [9], and others. Denotational semantics provides another route: if two expressions have equal interpretation in some adequate model, then they are contextually equivalent. For the ... |

221 | Call-by-name, call-by-value and the ‚-calculus - PLOTKIN - 1975 |

197 | A calculus of mobile processes, part - Milner, Parrow, et al. - 1992 |

125 | Primitive recursion for higher-order abstract syntax
- Schürmann, Despeyroux, et al.
(Show Context)
Citation Context ...vers. Perhaps the most demanding aspect would be that the nu-calculus uses name abstraction as well as lambda abstraction. Reasoning about binding mechanisms like these is still a delicate area — see =-=[5, 11, 18]-=- for some approaches — and concentrating attention onto pure names may provide some useful insights. Note that we are not concerned here with an implementation of the proof that the reasoning system i... |

124 | Bisimilarity as a theory of functional programming - Gordon |

117 | Observable properties of higher order functions that dynamically create local names, or: What’s new - Pitts, Stark - 1993 |

113 | Equivalence in functional languages with effects - Mason, Talcott - 1991 |

111 | Proving congruence of bisimulation in functional programming languages - Howe - 1996 |

111 | Operational reasoning for functions with local state - Pitts, Stark - 1998 |

108 | Functional Programming and Input/Output - Gordon - 1994 |

91 | Categorical logic - Pitts - 1996 |

55 | Names and Higher-Order Functions - Stark - 1994 |

49 | A Variable Typed Logic of Effects - Honsell, Mason, et al. - 1995 |

46 | Fully Abstract Models of Typed -calculi - Milner - 1977 |

40 | Categorical Models for Local Names - Stark - 1996 |

30 | References, local variables and operational reasoning - Mason, Talcott |

29 | Fully abstract models of typed λ-calculi - Milner - 1977 |

26 | Inferring the equivalence of functional programs that mutate data - Mason, Talcott - 1992 |

23 | The Semantics of Destructive Lisp - Mason - 1986 |

19 | A semantics for evaluation logic - Moggi - 1995 |

14 | Reasoning about functions with effects - Talcott |

11 | Higher Order Operational Techniques in Semantics - Gordon, Pitts, et al. - 1998 |

6 | A Logic of Effects - Mason - 1995 |

5 |
et al. The Coq Proof Assistant
- Barras
- 1996
(Show Context)
Citation Context ... of equivalence between processes. Leaving aside such extensions, there is also the challenge of mechanising the relational logic within a general automated reasoning system like Isabelle [26] or Coq =-=[3]-=-. For example, Frost and Mason have already begun to do this for a fragment of VTLoE [7]. In our case the task is aided by the fact that all our definitions are inductive, and packages to reason about... |

5 | A complete and decidable proof system for call-by-value equalities (preliminary report - Riecke - 1990 |

3 | Representing Program Logics in Evaluation Logic, Unpublished manuscript, available electronically - Moggi - 1994 |

1 |
Mobile ambients. To appear
- Cardelli, Gordon
- 1998
(Show Context)
Citation Context ... and sufficient [25]; but second and higher-order calculi like CHOCS [38] and HOπ [34] might benefit from a relational treatment. Other possibilities are the spi-calculus [1] and the ambient calculus =-=[4]-=-, both of which rely explicitly on the detailed behaviour of names. Consider for example the spi-calculus, which uses names as a foundation for reasoning about security protocols. In order to test for... |

1 | Mobile ambients. Preprint, available electronically from http://www.cl.cam.ac.uk/users/adg/Research/Ambit - Cardelli, Gordon - 1997 |