Idea: bring statically and dynamically typed languages together - and solve code duplication forever.

  • create a language that is syntactically based on JavaScript and intrinsically supports full type inference.
  • create a parser and analyzer for that language that supports the extraction of type signatures requirements or each function, function group or class. For example for a function c = a * b: a type signature requirement could be “a must be able to be multiplied with b”, or for a function c = a.customer: “a must support a member named ‘customer’”.
  • build a server that supports
    • uploading of such functions
    • the extraction of context documentation
    • the extraction of type signature requirements
    • efficient matching of type signature requirements
  • create an IDE oder IDE plugin that is able to extract type signature in locally created code and supports intellisense like operation by matching with type signature requirements of the server.
  • create a compiler for that language that creates – based on the matched type signatures – static code for a effective GC supporting language like C# or Java.

yours
armin

Comments

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.

see haXe

for a) and maybe b), take a look at http://haxe.org/