ACM Home Page
Please provide us with feedback. Feedback
A proper extension of ML with an effective type-assignment
Full text PdfPdf (1.02 MB)
Source Annual Symposium on Principles of Programming Languages archive
Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents
San Diego, California, United States
Pages: 58 - 69  
Year of Publication: 1988
ISBN:0-89791-252-7
Authors
A. J. Kfoury  Computer Science Dept, Boston Univ, Boston, MA
J. Tiuryn  Computer Science Dept, Washington State Univ., Pullman, WA and Institute of Mathematics, Univ of Warsaw, PKiN, 00-901, Warszawa, Poland
P. Urzyczyn  Institute of Mathematics, Univ of Warsaw, PKiN, 00-901, Warszawa, Poland
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 13,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/73560.73565
What is a DOI?

ABSTRACT

We extend the functional language ML by allowing the recursive calls to a function F on the right-hand side of its definition to be at different types, all generic instances of the (derived) type of F on the left-hand side of its definition. The original definition of ML does not allow this feature. This extension does not produce new types beyond the usual universal polymorphic types of ML and satisfies the properties already enjoyed by ML: the principal-type property and the effective type-assignment property.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
C
Cardelli, L., "Basic polymorphic typechecking", Polymorphism, Vol. II, No. 1, Jan. 1985.
CDK
CW
DM
 
GMW
Gordon, M.J., Milner, R. and Wadsworth, C.P., Edinburgh LCF, LNCS 78, Springer-Verlag, 1979.
 
KTU1
Kfoury, A., Tiuryn, J. and Urzyczyn, P., "The hierarchy of finitely typed functional programs", Proc. 2-nd Syrup. on Logic in Computer Science, pp 225- 236, June 1987.
 
KTU2
Kfoury, A., Tiuryn, J. and Urzyczyn, P., "A proper extension of ML with an effective typeassignment", unpublished manuscript, July 1987.
 
K
Kfoury, A., "An improved polymorphic type discipline", under preparation.
 
Mi
Milner, R., "A theory of type polymorphism in programming", J. of Computer and System Sciences, Vol. 17, pp 348-375, 1978.
 
My
 
PJ

CITED BY  8

Collaborative Colleagues:
A. J. Kfoury: colleagues
J. Tiuryn: colleagues
P. Urzyczyn: colleagues