This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Courcelle, B.(1983). Fundamental properties of infinite trees. Theoretical Computer Science 25, 95–169.
Goldfarb, W.(1981). The undecidability of the second-order unification problem. Theoretical Computer Science 13, 225–230.
Friedman, H.(1975). Equality between functions. Lecture Notes in Mathematics vol. 453, 22–37.
Huet, G.(1973). The undecidability of unification in third order logic. Information and Control 22(3), 257–267.
Huet, G.(1975). A unification algorithm for typed λ-calculus. Theoretical Computer Science 1, 27–58.
Pietrzykowski, T.(1973). A complete mechanization of second-order type theory. Journal of the ACM 20(2), 333–365.
Zaionc,M.(1984). Gramatyki termów w λ-rachunku z typami. Ph.D. Thesis Computer Science Department, University of Warsaw (in Polish).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zaionc, M. (1985). The set of unifiers in typed λ-calculus as regular expression. In: Jouannaud, JP. (eds) Rewriting Techniques and Applications. RTA 1985. Lecture Notes in Computer Science, vol 202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15976-2_23
Download citation
DOI: https://doi.org/10.1007/3-540-15976-2_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15976-6
Online ISBN: 978-3-540-39679-6
eBook Packages: Springer Book Archive