Fundamental studyOn the expressive power of finitely typed and universally polymorphic recursive procedures☆
Under a Creative Commons license
open archive
Cited by (0)
- ☆
This research was partly supported by NSF grant CCR-8901647 and by a grant of the Polish Ministry of National Education, no. R.P.I.09. Some of the results in this paper have been presented at the Symposiums “Logic in Computer Science” in 1987 and 1988 (see [17] and [18]).
- ∗∗
Part of the work was done when the author was visiting Computer Science Department of Washington State University, Pullman, WA.
Copyright © 1992 Published by Elsevier B.V.