User loginNavigation |
archivesSyntax for reification of typesHi all, I've got a little language with a syntax resembling C#. It is statically typed, and performs type inference. Functions are polymorphic, and don't require the type of the arguments to be explicit. I am trying to avoid dynamic typing as much as possible. Functions are reified during function invocation based on the inferred type of the arguments. In order to pass a function as an argument, or store it in a variable, I need a convenient way of performing the reificiation. Here is the syntax that I am considering:
As in C# the "=>" operator represent the lambda operator but here the symbol "->" now represents the function reification operator. Does this make sense? Any other suggestions or examples of how it is done in other languages? Thanks in advance! |
Browse archivesActive forum topics |
Recent comments
6 days 20 hours ago
1 week 44 min ago
1 week 50 min ago
23 weeks 1 day ago
27 weeks 3 days ago
29 weeks 8 hours ago
29 weeks 8 hours ago
31 weeks 5 days ago
36 weeks 2 days ago
36 weeks 2 days ago