Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. V. Breazu-Tannen. Combining algebra and higher-order types. In Proceedings 3rd IEEE Symposium on Logic in Computer Science, Edinburgh (UK), pages 82–90, 1988.
2. G. Dowek. Third order matching is decidable. In Proceedings of LICS'92, Santa-Cruz (California, USA), June 1992.
3. G. Huet and B. Lang. Proving and applying program transformations expressed with second-order patterns. Acta Informatica, 11:31–55, 1978.
4. J. Roger Hindley and Johnathan P. Seldin. Introduction to Combinators and Lambda-calculus. Cambridge University, 1986.
5. T. Nipkow and Z. Qian. Modular higher-order E-unification. In R. V. Book, editor, Proceedings 4th Conference on Rewriting Techniques and Applications, Como (Italy), volume 488 of Lecture Notes in Computer Science, pages 200–214. Springer-Verlag, 1991.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Analogy in Automated Deduction: A Survey;Computational Approaches to Analogical Reasoning: Current Trends;2014
2. Decidable higher-order unification problems;Automated Deduction — CADE-12;1994