Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Lecture Notes in Computer Science;L. Bachmair,1993
2. Lecture Notes in Computer Science;T. Chen,1995
3. Christian, J.: Flatterms, Discrimination Nets, and Fast Term Rewriting. Journal of Automated Reasoning 10(1), 95–113 (1993)
4. Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 243–320. North-Holland, Amsterdam (1990)
5. Eker, S.: Associative-Commutative Matching Via Bipartite Graph Matching. Computer Journal 38(5), 381–399 (1995)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Nominal AC-Matching;Lecture Notes in Computer Science;2023
2. Safe, fast, concurrent proof checking for the lambda-pi calculus modulo rewriting;Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs;2022-01-11
3. Formalising nominal C-unification generalised with protected variables;Mathematical Structures in Computer Science;2021-03
4. Providing On-Demand Feedback for Improved Learning of Logical Reasoning in Computer Science and Software Engineering;Advances in Intelligent Systems and Computing;2021
5. Nominal C-Unification;Logic-Based Program Synthesis and Transformation;2018