A. Asperti

A. Charguraud

A.D. Gordon

B. Huffman

B.E. Aydemir

C. McBride

C. Urban

E. Polonowski

J. McKinna

M. Sato

N. Pouillard

N.G. Bruijn de

R. Pollack

S. Berghofer

A long line of research has been dealing with the representation, in a formal tool such as an interactive theorem prover, of languages with binding structures (e.g. the lambda calculus). Several concrete encodings of binding have been proposed, including de Bruijn dummies, the locally nameless representation, and others. Each of these encodings has its strong and weak points, with no clear winner emerging. One common drawback to such techniques is that reasoning on them discloses too much information about what we could call “implementation details”: often, in a formal proof, an unbound index will appear out of nowhere, only to be substituted immediately after; such details are never seen in an informal proof. To hide this unnecessary complexity, we propose to represent binding structures by means of an abstract data type, equipped with high level operations allowing to manipulate terms with binding with a degree of abstraction comparable to that of informal proofs. We also prove that our abstract representation is sound by providing a de Bruijn model

Binding Structures as an Abstract Data Type

Abstract

Similar works

Full text

Available Versions

Edinburgh Research Explorer

Crossref