Question

Map to new space on Sat, 18 Jul 2015 18:01:49


1. how to modify the type inference algorithm to translate Hindley/Milner system to Girard/Reynolds system

2. how powerful is Girard/Reynolds system? what this system do but Hindley/Milner can not?


Money for nothing



Sponsored



Replies

Mr. Tines on Sat, 18 Jul 2015 19:18:27


If you cannot answer the item (2.), why are you even thinking about making your own private fork of the language?

If you do proceed with this exercise, you will be the only expert on the nuances of language you have created, so will have to answer all your own questions.

Map to new space on Mon, 20 Jul 2015 05:10:12


free theorem paper said that Girard/Reynolds system is more powerful,

but i do not understand is that if it need to do at compiler, how can i see how powerful it is when i write program?

any syntax difference between two of them?

Haskell is system F, is F# also system F?