Second-order unification and type inference for Church-style polymorphism
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Solvability of context equations with two context variable is decidable
Journal of Symbolic Computation
Equational theory of context unification is undecidable
Theoretical Computer Science
Type classes with more higher-order polymorphism
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
Decidable Fragments of Simultaneous Rigid Reachability
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Higher Order Unification 30 Years Later
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Currying Second-Order Unification Problems
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Stratified Context Unification Is in PSPACE
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Decidability of Bounded Higher-Order Unification
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Higher-order unification and matching
Handbook of automated reasoning
Decidability of bounded second order unification
Information and Computation
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Tractable and intractable second-order matching problems
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Stratified context unification is NP-complete
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Bounded second-order unification is NP-complete
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 5.23 |