Call-by-Name and Call-by-Value as Token-Passing Interaction Nets-Reference-Cited by-同舟云学术

Call-by-Name and Call-by-Value as Token-Passing Interaction Nets

Published:2005 Issue: Volume: Page:386-400
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Sinot François-Régis

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11417170_28

Reference19 articles.

1. Asperti, A., Giovannetti, C., Naletto, A.: The Bologna optimal higher-order machine. Journal of Functional Programming 6(6), 763–810 (1996)

2. Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. In: Studies in Logic and the Foundations of Mathematics, 2nd revised edn., vol. 103. North-Holland Publishing Company, Amsterdam (1984)

3. Lecture Notes in Computer Science;M. Fernández,2002

4. Fernández, M., Mackie, I., Sinot, F.-R.: Closed reduction: Explicit substitutions without alpha-conversion. Mathematical Structure in Computer Science (to appear)

5. Field, J.: On laziness and optimality in lambda interpreters: Tools for specification and analysis. In: Conference Record of the 17th Annual ACM Symposium on Principles of Programming Languages (POPL 1990), pp. 1–15. ACM Press, San Francisco (1990)

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

1. Grammar-based Pattern Matching and Type Checking for Difference Data Structures;Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming;2024-09-09

2. Engineering Grammar-Based Type Checking for Graph Rewriting Languages;IEEE Access;2022

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

4. Name Binding is Easy with Hypergraphs;IEICE Transactions on Information and Systems;2018

5. An Operational Semantics of BPMN Collaboration;Formal Aspects of Component Software;2016