δο!∈=1 Optimizing optimal λ-calculus implementations-Reference-Cited by-同舟云学术

δο!∈=1 Optimizing optimal λ-calculus implementations

Published:1995 Issue: Volume: Page:102-116
ISSN:0302-9743
Container-title:Rewriting Techniques and Applications
language:
Short-container-title:

Author:

Asperti Andrea

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-59200-8_51.pdf

Reference20 articles.

1. A. Asperti. Linear Logic, Comonads, and Optimal Reductions. To appear in Fundamenta Informaticae, Special Issue devoted to Categories in Computer Science. 1994.

2. A. Asperti, C. Laneve. Optimal Reductions in Interaction Systems. Proc. of the 4th Joint Conference on the Theory and Practice of Software Development, TAPSOFT'93, Orsay (France). April 1993.

3. A. Asperti, C. Laneve. Paths, Computations and Labels in the λ-calculus. To appear in Theoretical Computer Science, Special issue devoted to RTA'93, Montreal. June 1993.

4. A. Asperti, C. Laneve. Interaction Systems I: the theory of optimal reductions. To appear in Mathematical Structures in Computer Science. 1994.

5. A. Asperti, C. Laneve. Relating λ-calculus translations in sharing graphs. Proc. of the Second International Conference on Typed Lambda Calculi and Applications, TLCA'95, Edinburgh, Scotland. 1995.

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

1. Coherence for sharing proof-nets;Theoretical Computer Science;2003-02

2. Sharing Continuations: Proofnets for Languages with Explicit Control;Programming Languages and Systems;2000

3. Modal Logic, Linear Logic, Optimal Lambda-Reduction;Logic and Foundations of Mathematics;1999

4. Directed virtual reductions;Computer Science Logic;1997