A Head-to-Head Comparison of de Bruijn Indices and Names-Reference-Cited by-同舟云学术

A Head-to-Head Comparison of de Bruijn Indices and Names

Published:2007-06 Issue:5 Volume:174 Page:53-67
ISSN:1571-0661
Container-title:Electronic Notes in Theoretical Computer Science
language:en
Short-container-title:Electronic Notes in Theoretical Computer Science

Author:

Berghofer Stefan,Urban Christian

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference16 articles.

1. Aydemir, B., A. Bohannon and S. Weirich, Nominal Reasoning Techniques in Coq (Work in Progress), in: Proc. of the International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP), To appear in Electronic Notes in Theoretical Computer Science, 2006, pp. 68–75

2. Mechanized Metatheory for the Masses: The PoplMark Challenge;Aydemir,2005

3. The Lambda Calculus: Its Syntax and Semantics;Barendregt,1981

4. Combinatory Logic Vol. I;Curry,1958

5. Lambda-Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem;de Bruijn;Indagationes Math.,1972

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hashing Modulo Context-Sensitive -Equivalence;Proceedings of the ACM on Programming Languages;2024-06-20

2. Variable binding and substitution for (nameless) dummies;Logical Methods in Computer Science;2024-03-01

3. Nominal Recursors as Epi-Recursors;Proceedings of the ACM on Programming Languages;2024-01-05

4. A Formalized Extension of the Substitution Lemma in Coq;Electronic Proceedings in Theoretical Computer Science;2023-09-22

5. Rensets and Renaming-Based Recursion for Syntax with Bindings Extended Version;Journal of Automated Reasoning;2023-07-05