Timeline for How to statically type polymorphic lambdas using hindley milner style type inference
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 23, 2019 at 9:00 | history | tweeted | twitter.com/StackCompSci/status/1120613444846346245 | ||
| Apr 23, 2019 at 8:49 | history | edited | Johannes Luong | CC BY-SA 4.0 |
edited body
|
| Mar 10, 2019 at 22:31 | history | edited | Johannes Luong | CC BY-SA 4.0 |
added 1 character in body
|
| Mar 10, 2019 at 21:53 | vote | accept | Johannes Luong | ||
| Mar 10, 2019 at 21:51 | history | edited | Johannes Luong | CC BY-SA 4.0 |
added 504 characters in body
|
| Mar 10, 2019 at 20:48 | comment | added | Johannes Luong | +(a, b) is a predefined function that is overloaded for int, float, string etc. | |
| Mar 10, 2019 at 11:08 | comment | added | Andrej Bauer |
What is the type of +? It looks like you are already facing the exact same problem with +, as add is just a wrapper around it.
|
|
| Mar 9, 2019 at 21:36 | answer | added | András Kovács | timeline score: 5 | |
| Mar 9, 2019 at 16:00 | history | edited | Johannes Luong | CC BY-SA 4.0 |
added 1058 characters in body
|
| Mar 9, 2019 at 15:28 | history | edited | Johannes Luong | CC BY-SA 4.0 |
edited title
|
| Mar 9, 2019 at 9:33 | comment | added | Alexey Romanov |
Type inference algorithms for HM style systems normally deduce polymorphic types for let-bound variables, whether they are lambdas or not. If you want to make it for lambdas in general (or in some circumstances), you could transform the expressions so all lambdas are let-bound before type inference.
|
|
| Mar 9, 2019 at 7:00 | review | First posts | |||
| Mar 9, 2019 at 9:37 | |||||
| Mar 9, 2019 at 6:55 | history | asked | Johannes Luong | CC BY-SA 4.0 |