Polymorphic type inference systems with self-application

Article View: comp.lang.misc

Article #6189

#6189

From: Jonas Wallgren
Date: Mon, 16 Jan 1989 16:24

25 lines
1356 bytes

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
-------------------------------------------------------------------------------

Technical Details

Message-ID: <1144@mina.liu.se>

Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!mcvax!enea!kth!draken!liuida!JWC

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!utzoo!attcan!uunet!mcvax!enea!kth!draken!liuida!JWC
From: JWC@IDA.LiU.SE (Jonas Wallgren)
Newsgroups: comp.lang.misc
Subject: Polymorphic type inference systems with self-application
Message-ID: <1144@mina.liu.se>
Date: 16 Jan 89 16:24:46 GMT
Sender: jonwa@mina.liu.se
Lines: 25
Organisation: CIS Dept, Univ of Linkoping, Sweden