Re: How to make cyclic terms (Was: A miraculous match?)

Also Hiroshi Nakano paper is not
about System F, since the type binder
is not motivated by let polymorphism of
Hindley-Milner but rather by least fixpoint
theories, trying to capture recursive types.
Mild Shock schrieb:

Corr.: System T ~~> System F
 Mild Shock schrieb:

Hi,
>
I told you a dozen times that the scope of
this thread is simple types. Why don't you
open a separate thread for your fetish
>
System T and/or Coq. I really don't care
about System T. You can play online with
System T here:
>
https://crypto.stanford.edu/~blynn/lambda/systemf.html
>
Bye