The Garnet and KR work you cited from CMU is what got me into constraints/declarative OO/FRP. The term I best like for this style is "Dataflow". Cells, which is/was a dataflow extension for CLOS (object oriented Lisp) used this term, and uses both lazy and eager dataflow.
It was a huge amount of fun to work in, because it made GUI and server programming amazingly productive for a small team. You could get things working super fast, and with very little bugs because so much of the bookkeeping was done for you.
And one of the secrets compared to other systems in this vein was exactly the eager default, with a lazy option. By choosing per-formula which model you wanted, you could use the system that handled the most bookkeeping for you.
It was a huge amount of fun to work in, because it made GUI and server programming amazingly productive for a small team. You could get things working super fast, and with very little bugs because so much of the bookkeeping was done for you.
And one of the secrets compared to other systems in this vein was exactly the eager default, with a lazy option. By choosing per-formula which model you wanted, you could use the system that handled the most bookkeeping for you.
The Lisp code is still here:
http://common-lisp.net/project/cells/
The old examples and so on are in the Internet Archive:
http://web.archive.org/web/20081026054504/http://www.tilton-...