Modeling sharing and recursion for weak reduction strategies using explicit substitution-Reference-Cited by-同舟云学术

Modeling sharing and recursion for weak reduction strategies using explicit substitution

Published:1996 Issue: Volume: Page:393-407
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Benaissa Zine-El-Abidine,Lescanne Pierre,Rose Kristoffer H.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-61756-6_99.pdf

Reference16 articles.

1. Ariola, Z. M., Felleisen, M., Maraist, J., Odersky, M. and Wadler, P. (1995). A call-by-need lambda calculus. 22nd Principles of Programming Languages. San Francisco, California, pp. 233–246.

2. Ariola, Z. M. and Klop, J. W. (1994). Cyclic lambda graph rewriting. Logic in Computer Science. IEEE Computer Society Press. Paris, France. pp. 416–425.

3. Barendregt, H. P. (1984). The Lambda Calculus: Its Syntax and Semantics. Revised edn. North-Holland.

4. Bloo, R. and Rose, K. H. (1995). Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection. CSN '95 — Computer Science in the Netherlands. pp. 62–72. 〈url: ftp://ftp.diku.dk/diku/semantics/papers/ D-246.ps〉

5. Curien, P.-L. (1991). An abstract framework for environment machines. Theor. Comp. Sci. 82: 389–402.

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

1. Converting between Combinatory Reduction Systems and Big Step Semantics;Semantics and Algebraic Specification;2009

2. Editorial;Higher-Order and Symbolic Computation;2007-10-27

3. Explaining the lazy Krivine machine using explicit substitution and addresses;Higher-Order and Symbolic Computation;2007-10-24

4. Lambda-Calculus with Director Strings;Applicable Algebra in Engineering, Communication and Computing;2005-02-22

5. Reductions, intersection types, and explicit substitutions;Lecture Notes in Computer Science;2001