Subject
General Computer Science,Theoretical Computer Science
Reference48 articles.
1. Explicit substitutions;Abadi;J. Funct. Programming,1991
2. Y. Akama, On Mints’ reductions for ccc-Calculus, in: Proc. Int. Conf. on Typed Lambda Calculi and Applications (TLCA), Lecture Notes in Computer Science, vol. 664, Springer, Berlin, 1993.
3. λυ, a calculus of explicit substitutions which preserves strong normalisation;Benaissa;J. Funct. Programming,1996
4. Combinatory reduction systems with explicit substitution that preserve strong normalisation;Bloo,1996
5. An explicit eta rewrite rule;Briaud,1995
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献