Abstract Representation of Binders in OCaml using the Bindlib Library - Archive ouverte HAL Access content directly
Journal Articles Electronic Proceedings in Theoretical Computer Science Year : 2018

Abstract Representation of Binders in OCaml using the Bindlib Library

(1) , (2)
1
2

Abstract

The Bindlib library for OCaml provides a set of tools for the manipulation of data structures with variable binding. It is very well suited for the representation of abstract syntax trees, and has already been used for the implementation of half a dozen languages and proof assistants (including a new version of the logical framework Dedukti). Bindlib is optimised for fast substitution, and it supports variable renaming. Since the representation of binders is based on higher-order abstract syntax, variable capture cannot arise during substitution. As a consequence, variable names are not updated at substitution time. They can however be explicitly recomputed to avoid "visual capture" (i.e., distinct variables with the same apparent name) when a data structure is displayed.

Dates and versions

hal-01972050 , version 1 (07-01-2019)

Identifiers

Cite

Rodolphe Lepigre, Christophe Raffalli. Abstract Representation of Binders in OCaml using the Bindlib Library. Electronic Proceedings in Theoretical Computer Science, 2018, 274, pp.42-56. ⟨10.4204/EPTCS.274.4⟩. ⟨hal-01972050⟩
39 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More