Our great sponsors
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
I've finished most of the broad strokes for my language Forscape, a scientific computing language with typesetting and editor support. However, the type system has me absolutely flummoxed (general state of my life right now). I want to allow functions to be generic and instantiate them at the call site based on the arguments. In fact, I think one can statically track all the functions which the LHS of a call could possibly reference, and make sure they all return the same type and don't have conflicts for the given arg types. But that only provides an avenue to type checking, I still can't figure out how to efficiently resolve the called, instantiated function at runtime. Of course in the typical case, it will be trivial to statically bind the call to a single function, but I want the type system to withstand pathological cases, including recursion and closures. I don't have much experience with typing- is static duck typing possible?