University of Sussex
Browse

A program logic for fresh name generation

Download (540.45 kB)
journal contribution
posted on 2024-05-31, 09:20 authored by Harold Pancho Gordon Eliott, Martin BergerMartin Berger

We present a program logic for Pitts and Stark's ν-calculus, an extension of the call-by-value simply-typed λ-calculus with a mechanism for the generation of fresh names. Names can be compared for equality and inequality, producing programs with subtle observable properties. Hidden names produced by interactions between generation and abstraction are captured logically with a second-order quantifier over type contexts. We illustrate usage of the logic through reasoning about well-known difficult cases from the literature.

History

Publication status

  • Published

File Version

  • Published version

Journal

Science of Computer Programming

ISSN

0167-6423

Publisher

Elsevier

Volume

223

Article number

102860

Department affiliated with

  • Informatics Publications

Institution

University of Sussex

Full text available

  • Yes

Peer reviewed?

  • Yes