Files
@ 3ffeb97c88a7
Branch filter:
Location: CSY/reowolf/testdata/parser/positive/2.pdl - annotation
3ffeb97c88a7
848 B
text/plain
Add docs for implementing infinite types in a value based language.
Since we are a value based language and do not have the concept of
pointers, then if we want to lay out the memory of datatypes we run
into a problem when the types represent recursive datastructures:
these are infinite in size. So we have an algorithm for turning
some types into pointer-like things, such that we can lay everything
out in memory.
Since we are a value based language and do not have the concept of
pointers, then if we want to lay out the memory of datatypes we run
into a problem when the types represent recursive datastructures:
these are infinite in size. So we have an algorithm for turning
some types into pointer-like things, such that we can lay everything
out in memory.
1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 1b7b852c3395 | #version 100
import std.reo;
composite main(in asend, out arecv, in bsend, out brecv, in csend, out crecv) {
channel xo -> xi;
channel yo -> yi;
channel zo -> zi;
// Every synchronous round, at most one message is sent (to determine a global order)
new mymerger(asend, bsend, xo);
new mymerger(csend, xi, yo);
// If a message is sent, it is broadcast to every recipient
new replicator(yi, {arecv, zo});
new replicator(zi, {brecv, crecv});
}
primitive mymerger(in a, in b, out c) {
while (true) {
synchronous {
if (fires(a) && !fires(b) && fires(c)) {
put(c, get(a));
} else if (!fires(a) && fires(b) && fires(c)) {
put(c, get(b));
} else {
assert !fires(a) && !fires(b) && !fires(c);
}
}
}
}
|