D. A. Basin. Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete. In 10 International Conference on Automated Deduction, pages 251--260. Springer-Verlag New York, Inc., 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Retrieving Library Functions By Unifying Types Modulo Linear.. - Rittri (1992) (13 citations) (Correct)
....Table 3: User times in seconds, and number of retrieved items. 3.3 Comparisons between equivalence, matching, and unification Equational unification is normally more complex than matching and plain equivalence tests. The CCC isomorphism test for Hindley Milner types is graph isomorphismcomplete [2]; such problems are believed to be between polynomial and NP complete. CCC matchability is NP complete, and CCC unifiability is undecidable, although the restriction to linear CCC isomorphisms makes the unifiability NP complete and thus decidable [17] My implementation can usually test ....
D. A. Basin. Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete. In M. E. Stickel, editor, 10th Int. Conf. on Automated Deduction, Kaiserslautern, Germany. Volume 449 of Lecture Notes in Artificial Intelligence, pages 251--260, SpringerVerlag, 1990.
Metalogical Frameworks - Basin, Constable (1992) (27 citations) Self-citation (Basin) (Correct)
....of an implementation. More importantly, the presentation cannot easily be the subject of metatheoretic analysis because analyzing variables and operations on them requires reasoning about the framework logic itself. Consider for example term equality decision procedures, such as those presented in [7], where the term orderings used for term normalization may depend on the names of variables. Alternatively, consider decision procedures where the complexity of the procedure can depend on the number of variables or the number of time each variable occurs. For example, propositional ....
David A. Basin. Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete. In Proc. of 10th International Conference On Automated Deduction (CADE-10), pages 251 -- 260, Springer-Verlag, Kaiserslautern, Germany, 1990.
Efficient Algorithms for Isomorphisms of Simple Types - Yoav Zibin Zyoav (Correct)
No context found.
D. A. Basin. Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete. In 10 International Conference on Automated Deduction, pages 251--260. Springer-Verlag New York, Inc., 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC