Rewriting with extensional polymorphic λ-calculus-Reference-Cited by-同舟云学术

Rewriting with extensional polymorphic λ-calculus

Published:1996 Issue: Volume: Page:215-232
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Cosmo Roberto,Kesner Delia

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-61377-3_40.pdf

Reference21 articles.

1. Yohji Akama. On Mints' reductions for ccc-Calculus. In Typed Lambda Calculus and Applications, number 664 in LNCS, pages 1–12. Springer Verlag, 1993.

2. Henk Barendregt. The Lambda Calculus; Its syntax and Semantics (revised edition). North Holland, 1984.

3. Val Breazu-Tannen, Combining algebra and higher-order types. In Proceedings, Third Annual Symposium on Logic in Computer Science, pages 82–90, Edinburgh, Scotland, July 5–8 1988. IEEE Computer Society.

4. Val Breazu-Tannen and Jean Gallier. Polymorphic rewiting preserves algebraic confluence. Information and Computation, 114:1–29, 1994.

5. Val Breazu-Tannen and Albert R. Meyer. Polymorphism is conservative over simple types (preliminary report). In Proceedings, Symposium on Logic in Computer Science, pages 7–17, Cambridge, Massachusetts, June 16–18 1986. IEEE Computer Society.

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

1. An insertion operator preserving infinite reduction sequences;Mathematical Structures in Computer Science;2008-08

2. Life without the Terminal Type;Computer Science Logic;2001

3. Simulating η-expansions with Β-reductions in the second-order polymorphic λ-rcalculus;Logical Foundations of Computer Science;1997

4. On the power of simple diagrams;Rewriting Techniques and Applications;1996

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