CSY/reowolf Files · testdata/parser/positive/11.pdl · Centrum Wiskunde & Informatica (CWI)

Files @ 3ffeb97c88a7

Branch filter:

Location: CSY/reowolf/testdata/parser/positive/11.pdl

3ffeb97c88a7 208 B text/plain Show Annotation Show as Raw Download as Raw

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.

#version 100

primitive main(in a, out b) {
	msg x = null;
	while (x == null) {
		synchronous {
			if (fires(a))
				x = get(a);
		}
	}
	while (true) {
		synchronous {
			if (fires(b))
				put(b, x);
		}
	}
}