Cyclic lambda calculi-Reference-Cited by-同舟云学术

Cyclic lambda calculi

Published:1997 Issue: Volume: Page:77-106
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Ariola Zena M.,Blom Stefan

Publisher

Springer Berlin Heidelberg

Link

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

Reference39 articles.

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

2. Z. M. Ariola. Relating graph and term rewriting via Böhm models. Applicable Algebra in Engineering, Communication and Computing, 7(5), 1996.

3. Z. M. Ariola and S. Blom. Lambda calculi plus letrec. Technical Report CIS-TR97-05, Department of computer and information science, University of Oregon. ftp://ftp.cs.uoregon.edu/pub/ariola/cyclic-calculi.ps.

4. Z. M. Ariola and M. Felleisen. The call-by-need lambda calculus. Journal of Functional Programming, 7(3), 1997.

5. Z. M. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler. The call-byneed lambda calculus. In Proc. ACM Conference on Principles of Programming Languages, pages 233–246, 1995.

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

1. A Logical Framework with Higher-Order Rational (Circular) Terms;Lecture Notes in Computer Science;2023

2. Parallel Independence in Attributed Graph Rewriting;Electronic Proceedings in Theoretical Computer Science;2021-02-08

3. Formal Verifications of Call-by-Need and Call-by-Name Evaluations with Mutual Recursion;Programming Languages and Systems;2019

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

5. Formal Verification of the Correspondence Between Call-by-Need and Call-by-Name;Functional and Logic Programming;2018