Timeline for In System F à la Church, can we automatize type inference for the for-all elimination?
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 13, 2016 at 18:56 | comment | added | Blaisorblade | For reference: This kind of problem is one of the two problems solved by "Local type inference" (dl.acm.org/citation.cfm?id=345100). Also relevant should be dl.acm.org/citation.cfm?id=1086383. | |
| Sep 16, 2010 at 13:44 | vote | accept | Alejandro DC | ||
| Sep 16, 2010 at 13:08 | answer | added | Marc | timeline score: 8 | |
| Sep 16, 2010 at 12:49 | history | edited | Alejandro DC | CC BY-SA 2.5 |
Corrected a little mistake in one example
|
| Sep 16, 2010 at 10:44 | history | edited | Alejandro DC | CC BY-SA 2.5 |
Change of notation; edited body
|
| Sep 16, 2010 at 10:21 | comment | added | Dave Clarke | Your question would be a little more readable if you don't put the argument to f as sub/superscripts, each containing other sub/superscripts. | |
| Sep 16, 2010 at 9:55 | history | asked | Alejandro DC | CC BY-SA 2.5 |