Abstract
The semi-unification problem has recently been shown to be undecidable [8]. We present a new subclass of decidable semi-unification problems, properly containing those over monadic languages. In our ‘quasi-monadic’ problems, function symbols may be of arity>1, but only terms with at most one free variable are admitted.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Dörre and B. Rounds: On Subsumption and Semiunification in Feature Algebras. Proc. 5th Annual IEEE Symposium on Logic in Computer Science, Pittsburgh 1990
F.Henglein: Type Inference and Semi-Unification. Proc. ACM Conference on Lisp and Functional Programming, Snowbird, Utah, July 25–27, 1988, pp. 184–197.
F.Henglein: Polymorphic Type Inference and Semi-Unification. PhD Thesis, New York University, Dept. of Computer Science, Tech. Report 443, May 1989.
F.Henglein: Fast Left-Linear Semi-Unification. Proc. of the International Conference on Computing and Information, Niagara Falls, Canada, May 1990. Springer LNCS 468, pp 82–91.
D. Kapur and D. Musser and P. Narendran and J. Stillman: Semi-Unification. Proc. of the 8th Conference on Foundations of Software Technology and Theoretical Computer Science, Pune, India, December 21–23, 1988. Springer LNCS 338, pp. 435–454.
G.Kreisel, personal communication, Nov. 1989
A.J.Kfoury, J.Tiuryn, and P.Urcyczyn: Computational Consequences and Partial Solutions of a Generalized Unification Problem. 4th IEEE Symposium on Logic in Computer Science, Asilomar, California, June 5–8, 1989.
A.J.Kfoury, J.Tiuryn, and P.Urcyczyn: The Undecidablity of the Semi-Unification Problem. Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, May 14–16, 1990, pp. 468–476.
A.J. Kfoury, J. Tiuryn, and P. Urcyczyn: ML-Typability is DEXPTIME-complete. 15th Colloquium on Trees in Algebra and Programming, CAAP'90, Arnold (ed.). Springer LNCS 431, pp. 206–220, 1990.
H. Leiß, On Type Inference for Object-Oriented Programming Languages. E. Börger e.a. (eds.) CSL'87. Proc. of the 1st Workshop on Computer Science Logic, Universität Karlsruhe, 1987. Springer LNCS 329, pp. 151–172
H. Leiß, Semi-Unification and Type Inference for Polymorphic Recursion. Technical Report INF2-ASE-5-89, Siemens AG, München, May 1989.
H. Leiß: Polymorphic Recursion and Semi-Unification. E. Börger e.a. (eds.) CSL '89. Proc. of the 3rd Workshop on Computer Science Logic, Universität Kaiserslautern, Oct 2–6, 1989. Springer LNCS 440, pp. 211–224.
A. Mycroft: Polymorphic Type Schemes and Recursive Definitions. In: International Symposium on Programming, 6th Colloquium. Toulouse, April 17–19, 1984. Springer LNCS 187, pp. 217–228.
P. Pudlák: On a Unification Problem related to Kreisel's Conjecture. Commentationes Mathematicae Universitatis Carolinae, no. 29 (3), 1988, pp. 551–556.
G. Takeuti: Proof Theory. Second Edition. North-Holland, Amsterdam 1975.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leiß, H., Henglein, F. (1991). A decidable case of the semi-unification problem. In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_75
Download citation
DOI: https://doi.org/10.1007/3-540-54345-7_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54345-9
Online ISBN: 978-3-540-47579-8
eBook Packages: Springer Book Archive