Re: Type names vs type structure

• To: types@cs.indiana.edu
• Subject: Re: Type names vs type structure
• From: Martin Odersky <cismxo@cis.unisa.edu.au>
• Date: Tue, 30 Jun 1998 16:09:04 +0930
• Cc: wadler@research.bell-labs.com
• Delivery-Date: Tue, 30 Jun 1998 01:40:57 -0500
• In-reply-to: <199806291903.OAA17705@shovelnose.cs.indiana.edu> (Tobias.Nipkow@informatik.tu-muenchen.de)
• Reply-to: odersky@cis.unisa.edu.au

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.

If I recall correctly, there was a paper by Mishra and Reddy in POPL'85
on this. Here's the bib entry:

@InProceedings{mishra-reddy:declaration-free,
  author = 	"Prateek Mishra and Uday S. Reddy",
  title = 	"Declaration-free Type Checking",
  pages = 	"7--21",
  booktitle = 	"Conference Record of the Twelfth {ACM} Symposium on
		 Principles of Programming Languages",
  year = 	"1985",
  month = 	"January",
  organization =	{Association for Computing Machinery},
  folder = {   3-18}
}

Cheers

 -- Martin
 

• Prev: AFP 2nd Call
• Next: New book: Higher Order Operational Techniques in Semantics
• Index(es):
  • Main
  • Thread