A Fresh Calculus for Name Management

We define a basic calculus for name management, which combines three ingredients: extensible records (in a simplified form), names (as in FreshML), computational types (to allow computational effects, including generation of fresh names). The calculus supports the use of symbolic names for programming in-the-large, eg it subsumes Ancona and Zucca\u2019s calculus for module systems, and for meta-programming (but not the intensional analysis of object level terms supported by FreshML), eg it subsumes (and improves) Nanevski and Pfenning\u2019s calculus for meta-programming with names and necessity. Moreover, it models some aspects of Java\u2019s class loaders