In this paper we encode higher-order rewriting with names into higher-order rewriting in de Bruijn notation. This notation not only is defined for terms (as ...
In this paper we encode higher-order rewriting with names into higher-order rewriting in de Bruijn notation. This notation not only is defined for terms (as ...
Abstract: In this paper we encode higher-order rewriting with names into higher-order rewriting in de Bruijn notation. This notation not only is defined for ...
In this paper we encode higher-order rewriting with names into higher-order rewriting in de Bruijn notation.
In this paper we encode higher-order rewriting with names into higher-order rewriting in de Bruijn notation. This notation not only is defined for terms (as ...
In this paper we encode higher-order rewriting with names into higher-order rewriting in de Bruijn notation. This notation not only is defined for terms (as ...
De Bruijn indices are commonly used in higher-order reasoning systems such as automated theorem provers and logic programming systems.
Nov 25, 2023 · This gains you capture-avoiding substitution without the trouble of constantly shifting indices and other disadvantages of De Bruijn indices.
Jul 21, 2023 · De Bruijn indices are used to represent terms in lambda calculus and type theory without naming bound variables.
We give formal translations from higher-order rewriting with names to higher-order rewriting with de Bruijn indices, and vice-versa. These translations can ...