Author:
Calvès Christophe,Fernández Maribel
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Baader, F., Snyder, W.: Unification Theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 8, vol. I, pp. 445–532. Elsevier Science, Amsterdam (2001)
2. Electronic Notes in Computer Science;C. Calvès,2006
3. Cheney, J.: α-Prolog: an interpreter for a logic programming language based on nominal logic,
http://homepages.inf.ed.ac.uk/jcheney/programs/aprolog/
4. Electronic Notes in Theoretical Computer Science;R.A. Clouston,2007
5. Fernández, M., Gabbay, M.J.: Nominal Rewriting. Information and Computation 205, 917–965 (2007)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Nominal syntax with atom substitutions;Journal of Computer and System Sciences;2021-08
2. Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting;Fundamentals of Computation Theory;2019
3. Sums of products for mutually recursive datatypes: the appropriationist’s view on generic programming;Proceedings of the 3rd ACM SIGPLAN International Workshop on Type-Driven Development;2018-09-27
4. Alpha-renaming of higher-order meta-expressions;Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming;2017-10-09
5. Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming;Programming Languages and Systems;2009