An explicit Eta rewrite rule-Reference-Cited by-同舟云学术

An explicit Eta rewrite rule

Published:1995 Issue: Volume: Page:94-108
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Briaud Daniel

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0014047

Reference21 articles.

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375–416, 1991.

2. H. P. Barendregt. The Lambda-Calculus, its syntax and semantics. Studies in Logic and the Foundation of Mathematics. Elsevier Science Publishers B. V. (North-Holland), Amsterdam, 1984. Second edition.

3. Z. Benaissa, D. Briaud, P. Lescanne, and J. Rouyer-Degli. λυ, a calculus of explicit substitutions which preserves strong normalisation. Submitted, December 1994.

4. D. Briaud. An explicit Eta rewrite rule. Rapport de Recherche 2417, INRIA, 1994.

5. H. B. Curry and Feys. Combinatory Logic, volume 1. Elsevier Science Publishers B. V. (North-Holland), Amsterdam, 1958.

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

1. SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi ★;Journal of Applied Non-Classical Logics;2006-01

2. Expression Reduction Systems and Extensions: An Overview;Processes, Terms and Cycles: Steps on the Road to Infinity;2005

3. More Church-Rosser proofs (in Isabelle/HOL);Automated Deduction — Cade-13;1996

4. Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract);Rewriting Techniques and Applications;1996

5. An explicit Eta rewrite rule;Lecture Notes in Computer Science;1995