Author:
Jouannaud Jean-Pierre,Rubio Albert
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Lecture Notes in Computer Science;F. Blanqui,1999
2. Lecture Notes in Computer Science;F. Blanqui,2000
3. Blanqui, F., Jouannaud, J.-P., Okada, M.: Inductive Data Type Systems. Theoretical Computer Science 272(1-2), 41–68 (2002)
4. Barendregt, H.: Functional Programming and Lambda Calculus. In: [22], pp. 321–364.
5. Barendregt, H.: Typed lambda calculi. In: Abramsky, et al. (eds.) Handbook of Logic in Computer Science. Oxford University Press, Oxford (1993)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Normal Higher-Order Termination;ACM Transactions on Computational Logic;2015-03-21
2. Argument Filterings and Usable Rules in Higher-order Rewrite Systems;IPSJ Online Transactions;2011
3. Semantic Labelling for Proving Termination of Combinatory Reduction Systems;Functional and Constraint Logic Programming;2010
4. Coq formalization of the higher-order recursive path ordering;Applicable Algebra in Engineering, Communication and Computing;2009-10-09
5. A Higher-Order Iterative Path Ordering;Logic for Programming, Artificial Intelligence, and Reasoning;2008