Pitts, Andrew M. and Shinwell, Mark R. - Generative Unbinding of Names

lmcs:916 - Logical Methods in Computer Science, March 18, 2008, Volume 4, Issue 1
Generative Unbinding of Names

Authors: Pitts, Andrew M. and Shinwell, Mark R.

This paper is concerned with the form of typed name binding used by the FreshML family of languages. Its characteristic feature is that a name binding is represented by an abstract (name,value)-pair that may only be deconstructed via the generation of fresh bound names. The paper proves a new result about what operations on names can co-exist with this construct. In FreshML the only observation one can make of names is to test whether or not they are equal. This restricted amount of observation was thought necessary to ensure that there is no observable difference between alpha-equivalent name binders. Yet from an algorithmic point of view it would be desirable to allow other operations and relations on names, such as a total ordering. This paper shows that, contrary to expectations, one may add not just ordering, but almost any relation or numerical function on names without disturbing the fundamental correctness result about this form of typed name binding (that object-level alpha-equivalence precisely corresponds to contextual equivalence at the programming meta-level), so long as one takes the state of dynamically created names into account.


Source : oai:arXiv.org:0801.1251
DOI : 10.2168/LMCS-4(1:4)2008
Volume: Volume 4, Issue 1
Published on: March 18, 2008
Submitted on: April 19, 2007
Keywords: Computer Science - Programming Languages,Computer Science - Logic in Computer Science,D.3.1,D.3.3,F.3.2


Share

Consultation statistics

This page has been seen 44 times.
This article's PDF has been downloaded 16 times.