A Head-to-Head Comparison of de Bruijn Indices and Names
نویسندگان
چکیده
Often debates about pros and cons of various techniques for formalising lambda-calculi rely on subjective arguments, such as de Bruijn indices are hard to read for humans or nominal approaches come close to the style of reasoning employed in informal proofs. In this paper we will compare four formalisations based on de Bruijn indices and on names from the nominal logic work, thus providing some hard facts about the pros and cons of these two formalisation techniques. We conclude that the relative merits of the different approaches, as usual, depend on what task one has at hand and which goals one pursues with a formalisation.
منابع مشابه
A Comparison between Concrete Representations for Bindings
Many representations of term syntax with variable bindings have been used to formalize programming language metatheory, but so far there is no clear consensus on which is the best representation. We have undertaken an exhaustive comparison between concrete representations, among which are: names, nominal, de Bruijn indices, de Bruijn levels, locally nameless, and their variations. In the contex...
متن کاملBridging de Bruijn Indices and Variable Names in Explicit Substitutions Calculi
Calculi of explicit substitutions have almost always been presented using de Bruijn indices with the aim of avoiding α-conversion and being as close to machines as possible. De Bruijn indices however, though very suitable for the machine, are difficult to human users. This is the reason for a renewed interest in systems of explicit substitutions using variable names. We believe that the study o...
متن کاملPure Type Systems with de Bruijn Indices
Nowadays, type theory has many applications and is used in many different disciplines. Within computer science, logic and mathematics there are many different type systems. They serve several purposes and are formulated in various ways. A general framework called Pure Type Systems (PTSs) has been introduced independently by Terlouw and Berardi in order to provide a unified formalism in which ma...
متن کاملReviewing the Classical and the de Bruijn Notation for [lambda]-calculus and Pure Type Systems
This article is a brief review of the type-free -calculus and its basic rewriting notions, and of the pure type system framework which generalises many type systems. Both the type-free -calculus and the pure type systems are presented using variable names and de Bruijn indices. Using the presentation of the -calculus with de Bruijn indices, we illustrate how a calculus of explicit substitutions...
متن کاملA Semantics for a ne -calculus with de Bruijn indices
Most of us who have worked with named variables in the -calculus must have noticed how sticky such variables can be. The problem is, that named variables play a very demanding role in the most basic operations of the -calculus, namely: -reduction and substitution. This has lead to using implicit substitution rather than the explicit one in most theories of the -calculus. Variable names however,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 174 شماره
صفحات -
تاریخ انتشار 2007