mirror of
https://github.com/grin-compiler/grin.git
synced 2024-09-11 15:37:54 +03:00
13 lines
428 B
Plaintext
13 lines
428 B
Plaintext
the data flow machine is same as the meta-variable solver in a type checker
|
|
|
|
idea for more efficient data-flow execution:
|
|
- keep internal structure of unifications
|
|
if everything is propagated as a value then it's a sharing loss
|
|
|
|
data-flow program should be a normal program
|
|
|
|
the input program AST structure definies the meta-variable dependencies,
|
|
that means the AST is the dependency tree that re-triggers computations
|
|
|
|
|