Skip to main content
Conference Proceedings

The set of unifiers in typed λ-calculus as regular expression

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1985) 202 LNCS 430-440
DOI: 10.1007/3-540-15976-2_23
9Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Zaionc, M. (1985). The set of unifiers in typed λ-calculus as regular expression. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 202 LNCS, pp. 430–440). Springer Verlag. https://doi.org/10.1007/3-540-15976-2_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free