Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
424076 | Electronic Notes in Theoretical Computer Science | 2007 | 15 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics