Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference4 articles.
1. An abstraction algorithm for combinatory logic;Abdali;J. Symbolic Logic,1976
2. J.R. Kennaway, The complexity of a translation of λ-calculus to combinators, to appear.
3. A new implementation technique for applicative languages;Turner;Software Practice and Experience,1979
4. Another algorithm for bracket abstraction;Turner;J. Symbolic Logic,1978
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improving automation in interactive theorem provers by efficient encoding of lambda-abstractions;Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs;2016-01-18
2. On graph rewriting, reduction, and evaluation in the presence of cycles;Higher-Order and Symbolic Computation;2013-12
3. Four-Membered Sulfur Heterocycles;Chemistry of Heterocyclic Compounds: A Series Of Monographs;2008-01-02
4. Higher-order rigid E-unification;Logic Programming and Automated Reasoning;1994
5. What is an efficient implementation of the λ-calculus?;Functional Programming Languages and Computer Architecture;1991