Call-by-Value λ-Graph Rewriting Without Rewriting-Reference-Cited by-同舟云学术

Call-by-Value λ-Graph Rewriting Without Rewriting

Published:2002 Issue: Volume: Page:75-89
ISSN:0302-9743
Container-title:Graph Transformation
language:
Short-container-title:

Author:

Fernández Maribel,Mackie Ian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45832-8_8

Reference17 articles.

1. A. Asperti and S. Guerrini. The Optimal Implementation of Functional Programming Languages, volume 45 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1998.

2. Lect Notes Comput Sci;A. Asperti,1993

3. H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company, second, revised edition, 1984.

4. G. Cousineau, P.-L. Curien, and M. Mauny. The categorical abstract machine. Science of Computer Programming, 8:173–202, 1987.

5. P.-L. Curien. An abstract framework for environment machines. Theoretical Computer Science, 82:389–402, 1991.

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

1. The (In)Efficiency of interaction;Proceedings of the ACM on Programming Languages;2021-01-04

2. Efficient Implementation of Evaluation Strategies via Token-Guided Graph Rewriting;Electronic Proceedings in Theoretical Computer Science;2018-02-16

3. From Call-by-Value to Interaction by Typed Closure Conversion;Programming Languages and Systems;2015

4. Proof nets and the call-by-value lambda-calculus;Electronic Proceedings in Theoretical Computer Science;2013-03-28

5. Call-by-Name and Call-by-Value as Token-Passing Interaction Nets;Lecture Notes in Computer Science;2005