Static Name Control for FreshML

FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable side effect. In practice, this means that FreshML allows writing programs that create fresh names and unintentionally fail to bind them. Following in the steps of early work by Pitts and Gabbay, this paper defines Pure FreshML, a subset of FreshML equipped with a static proof system that guarantees purity. Pure FreshML relies on a rich binding specification language, on user-provided assertions, expressed in a logic that allows reasoning about values and about the names that they contain, and on a conservative, automatic decision procedure for this logic. It is argued that Pure FreshML can express non-trivial syntaxmanipulating algorithms.

• Type: Conference
• Year: 2007
• Where: LICS
• Authors: François Pottier
• Keywords: Computer Science, Freshml Extends Ml, LICS 2007, Pure FreshML, Pure FreshML Relies