Higher-Order and Semantic Unification
暂无分享,去创建一个
[1] Nachum Dershowitz,et al. Equation Solving in Conditional AC-Theories , 1990, ALP.
[2] Daniel J. Dougherty. Higher-Order Unification via Combinators , 1993, Theor. Comput. Sci..
[3] Daniel J. Dougherty,et al. A Combinatory Logic Approach to Higher-Order E-Unification , 1995, Theor. Comput. Sci..
[4] Wayne Snyder. Higher Order E-Unification , 1990, CADE.
[5] Nachum Dershowitz,et al. Solving Goals in Equational Languages , 1988, CTRS.
[6] Jean-Pierre Jouannaud,et al. Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[7] N. Dershowitz,et al. Decidable Matching for Convergent Systems , 1992 .
[8] Jacques Chabin,et al. Narrowing Directed by a Graph of Terms , 1991, RTA.
[9] Nachum Dershowitz,et al. Decidable Matching for Convergent Systems (Preliminary Version) , 1992, CADE.
[10] Pierre Réty. Improving Basic Narrowing Techniques , 1987, RTA.
[11] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[12] Jean-Marie Hullot,et al. Canonical Forms and Unification , 1980, CADE.
[13] Tobias Nipkow,et al. Modular Higher-Order E-Unification , 1991, RTA.
[14] V. Breazu-Tannen,et al. Combining algebra and higher-order types , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.