Pitts and Stark have proposed the n-calculus as a language for investigating the interaction of unique name generation and higherorder functions. They developed a sound model based on logical relations, but left completeness as an open problem. In this paper, we develop a complete model based on bisimulation for a labelled transition system semantics. We show that bisimulation is complete, but not sound, for the n-calculus. We also show that by adding assignment to the n-calculus, bisimulation becomes sound and complete. The analysis used to obtain this result illuminates the difficulties involved in finding fully abstract models for n-calculus proper. Keywords: semantics, bisimulation, nominal calculi. 1 Introduction The use of localised information in computing is endemic. In a workplace, where the prevalence of networks and mobile agents is increasing, the concepts of private and public data are of great importance, and the question of how secrecy can be maintained is a significan...
user correction - Legacy Corrections
In 14th Annual Symposium on Logic in Computer Science