A larger decidable semiunification problem

Authors:
Brad Lushman;Gordon V. Cormack
Affiliations:
University of Waterloo;University of Waterloo
Venue:
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Year:
2007

Citing 15
Cited 0

Type inference and semi-unification

LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
Computational consequences and partial solutions of a generalized unification problem

Proceedings of the Fourth Annual Symposium on Logic in computer science
Fast left-linear semi-unification

ICCI'90 Proceedings of the international conference on Advances in computing and information
On subsumption and semiunification in feature algebras

Journal of Symbolic Computation
The undecidability of the semi-unification problem

Information and Computation
An analysis of ML typability

Journal of the ACM (JACM)
A direct algorithm for type inference in the rank-2 fragment of the second-order &lgr;-calculus

LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Avoiding dynamic type checking in a polymorphic logic programming language

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Scalable context-sensitive flow analysis using instantiation constraints

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Semi-Unification

Proceedings of the Eighth Conference on Foundations of Software Technology and Theoretical Computer Science
Polymorphic Type Schemes and Recursive Definitions

Proceedings of the 6th Colloquium on International Symposium on Programming
A Fast Algorithm for Uniform Semi-Unification

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Polymorphic type inference and semiunification

Polymorphic type inference and semiunification

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a graph-theoretic framework in which to study instances of the semiunification problem (SUP), which is known to be undecidable, but has several known and important decidable subsets. One such subset, the acyclic semiunification problem (ASUP), has proved useful in the study of polymorphic type inference. We present graph-theoretic criteria in our framework that exactly characterize the ASUP acyclicity constraint. We then use our framework to find a decidable subset of SUP (which we call R-ASUP), which has a more natural description than ASUP, and strictly contains it.