A program logic for fresh name generation

01/26/2021
by   Harold Pancho Eliott, et al.
0

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 (in)-equality, 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.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

12/16/2021

On Up-to Context Techniques in the π-calculus

We present a variant of the theory of compatible functions on relations,...
12/21/2021

L-types for resource awareness: an implicit name approach

Since the early work of Church on λI-calculus and Gentzen on structural ...
05/10/2018

When Names Are Not Commonly Known: Epistemic Logic with Assignments

In standard epistemic logic, agent names are usually assumed to be commo...
02/14/2022

Quantitative Strongest Post

We present a novel strongest-postcondition-style calculus for quantitati...
08/20/2018

Fungi: Typed incremental computation with names

Incremental computations attempt to exploit input similarities over time...
02/16/2022

Galois connecting call-by-value and call-by-name

We establish a general framework for reasoning about the relationship be...
07/18/2021

AC Simplifications and Closure Redundancies in the Superposition Calculus

Reasoning in the presence of associativity and commutativity (AC) is wel...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.