Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Henglein, Fritz
and
Mairson, Harry G.
1994.
The complexity of type inference for higher-order typed lambda calculi.
Journal of Functional Programming,
Vol. 4,
Issue. 4,
p.
435.
Kanellakis, Paris C.
Hillebrand, Gerd G.
and
Mairson, Harry G.
1994.
Automata, Languages and Programming.
Vol. 820,
Issue. ,
p.
83.
Chen, Kung
and
Odersky, Martin
1994.
Theoretical Aspects of Computer Software.
Vol. 789,
Issue. ,
p.
347.
Hillebrand, G.
and
Kanellakis, P.
1996.
On the expressive power of simply typed and let-polymorphic lambda calculi.
p.
253.
Discussions
No Discussions have been published for this article.