Re: Type names vs type structure

• To: wadler@research.bell-labs.com
• Subject: Re: Type names vs type structure
• From: Tobias.Nipkow@informatik.tu-muenchen.de
• Date: Mon, 29 Jun 1998 13:47:46 +0200
• CC: types@cs.indiana.edu
• Delivery-Date: Mon, 29 Jun 1998 06:48:49 -0500
• In-reply-to: <199806291121.GAA15389@shovelnose.cs.indiana.edu> (message from Philip Wadler on Fri, 26 Jun 1998 14:49:55 -0400)
• Sender: Tobias Nipkow <nipkow@informatik.tu-muenchen.de>

Phil Wadler wrote:
> For instance, I know of no paper that describes
> extending Hindley-Milner with unification on rational trees, although
> the idea seems to have been kicking around for a while.

I believe you can find an instance here

@inproceedings{Kaes-LFP-92,author="Stefan Kaes",
title=
"Type Inference in the Presence of Overloading, Subtyping and Recursive Types",
booktitle="Proc.\ {ACM} Conf.\ {LISP} and Functional Programming",
publisher="ACM Press",year=1992,pages="193--204"}

but the idea has been around for much longer.

Tobias

• Prev: Variant typing and recursive types
• Next: Lectureship in Theoretical Computer Science
• Index(es):
  • Main
  • Thread