Abstract
A typed language of combinators based on the type conjunction operator is defined and shown to be semantically sound. The undecidability of type checking can be overcome through the use of explicit user-supplied types at regular parts of an expression. Explicit types need only be given for expressions which themselves are not a functional application and which are applied to one or more subexpressions. This language has the 'principal type property', i.e. all typeable expressions have a principal type. A type checking algorithm for the simple language is given. Extensions to the language are discussed, including MacQueen's (1984) type fixed-point operator and default explicit types. With default explicit types, type checking can proceed (via extended unification) when explicit types are omitted; thus, combinators which can be typed in the parametric type system of Milner (1978) need not be explicitly typed. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
