I have been working on the edge of hardware land for the last 18 months and i was wondering about a regular language being used instead of ladder logic. It seems to me if you have memory safety and type safety , the only things you need is some sort of determinism to exit a loop eg guarantee the loop does not run more than n times , that there is no allocation and a function cannot take longer than ms without excepting. This seems very similar to some aspects of kernel development.
Has any thought been given to this sort of constraint in bitc/ modern Languages..? Regards, Ben
_______________________________________________ bitc-dev mailing list bitc-dev@coyotos.org http://www.coyotos.org/mailman/listinfo/bitc-dev
