Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Martín Abadi, Luca Cardelli, Pierre Louis Curien, and Jean-Jacques Lévy. Explicit substitutions. Journal of Functional Programming, 4(1):375–416, 1991.
2. Zine-El-Abidine Benaissa, Daniel Briaud, Pierre Lescanne, and Jocelyne Rouyer-Degli. λυ, a calculus of explicit substitutions which preserves strong normalisation. Journal of Functional Programming, 6(5):699–722, 1996.
3. Roel Bloo. Preservation of strong normalization for explicit substitutions. Technical Report TR95-08, TUE Computing Science Reports, Eindhoven University of Technology, 1995.
4. Roel Bloo and Kristoffer Rose. Preservation of strong normalization in named lambda calculi with explicit substitution and garbage collection. In Computing Science in the Netherlands, pages 62–72. Netherlands Computer Science Research Foundation, 1995.
5. Pierre-Louis Curien, Thérèse Hardin, and Jean-Jacques Lévy. Confluence properties of weak and strong calculi of explicit substitutions. Journal of the ACM, 43(2):362–397, March 1996.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Implementation of Dynamic Patterns;Electronic Proceedings in Theoretical Computer Science;2011-02-17
2. A Theory of Explicit Substitutions with Safe and Full Composition;Logical Methods in Computer Science;2009-07-15
3. Expression Reduction Systems with Patterns;Journal of Automated Reasoning;2007-07-21
4. Pure Pattern Calculus;Programming Languages and Systems;2006
5. Extending the Explicit Substitution Paradigm;Lecture Notes in Computer Science;2005