Type Theory: Difference between revisions

From Adam Colton
Jump to navigation Jump to search
← Older editNewer edit →
No edit summary
No edit summary
Line 1: Line 1:
Go significantly limits the amount of meta-programming available, which simplifies code but comes at a small performance cost.
== Hyper-Consistent ==
I'm really drawn to this. There are a lot of very similar structures in a program that could be brought in line. Although I'm afraid doing this is going to recreate lisp.


== Classes of types ==
The two fundamental container types are an ordered list and an associative array.
* Fundamental/builtin
* Structured memory (string, array)
* abstract (interfaces, functions?)
* containers (array, hash maps)
* unions


== Generics ==
[[Category:Gryphon]]
* Generic computation
* Generic containers

Revision as of 14:39, 24 September 2019

Hyper-Consistent

I'm really drawn to this. There are a lot of very similar structures in a program that could be brought in line. Although I'm afraid doing this is going to recreate lisp.

The two fundamental container types are an ordered list and an associative array.

Retrieved from "https://wiki.adamcolton.net/index.php?title=Type_Theory&oldid=7281"