Subject
General Computer Science,Theoretical Computer Science
Reference37 articles.
1. Adding algebraic rewriting to the calculus of constructions: strong normalization preserved;Barbanera,1990
2. Combining algebra and higher-order types;Breazu-Tannen,1988
3. Polymorphic rewriting conserves algebraic strong normalization and confluence;Breazu-Tannen;Theoret. Comput. Sci.,1991
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficient Full Higher-Order Unification;Logical Methods in Computer Science;2021-12-14
2. SUPERPOSITION FOR LAMBDA-FREE HIGHER-ORDER LOGIC;LOG METH COMPUT SCI;2021
3. Restricted Combinatory Unification;Lecture Notes in Computer Science;2019
4. Superposition with Lambdas;Lecture Notes in Computer Science;2019
5. Unification for $$\lambda $$ -calculi Without Propagation Rules;Theoretical Aspects of Computing – ICTAC 2016;2016