Re: type inference of recursive types

Martin Okrslar <okrslar@informatik.uni-muenchen.de>
4 Dec 1999 22:31:51 -0500

          From comp.compilers
Related articles
type inference of recursive types jfklein@students.uiuc.edu (Joel F. Klein) (1999-12-01)
Re: type inference of recursive types okrslar@informatik.uni-muenchen.de (Martin Okrslar) (1999-12-04)
| List of all articles for this month |
From: Martin Okrslar <okrslar@informatik.uni-muenchen.de>
Newsgroups: comp.compilers
Date: 4 Dec 1999 22:31:51 -0500
Organization: Department of Computer Sciences, University of Munich
References: 99-12-006
Keywords: types, ML

I do not know if this is what you are looking for, but Hans Leiss an Martin
Emms did some research in polymorph rcursin in ML. Take a look at


http://www.cis.uni-muenchen.de/people/leiss/polyrec.html


Bye,
        Martin




Joel F. Klein wrote:


> I'm trying to add support for recursive types to a compiler whose language
> is based on typed lambda calculus, sort of akin to ML. Does anyone have
> pointers to literature on implementing type inference for recursive types?

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.