JWC@IDA.LiU.SE (Jonas Wallgren) (01/17/89)
PLEASE SEND YOUR ANSWERS TO ME DIRECTLY - NOT TO THE NEWSGROUP! I'm looking for references to papers about polymorphic type inference systems which gives the result of the application (\x.xx)(\y.y) the type for all a: a->a. I've already seen Coppo, M., An extended polymorphic type system for applicative languages. I've also seen MacQueen, D. et al, An ideal model for recursive polymorphic types, but, as far as I can see, in that system the result gets the type ua.a->a. ------------------------------------------------------------------------------- Jonas Wallgren | JWC@IDA.LiU.SE Department of Computer and Information Science | Linkoping University |----------------------------- SE-581 83 Linkoping | Sweden | The Argument Eater: YKx=YK -------------------------------------------------------------------------------