Actually, you can construct a language where you cannot amke some kind of actions at all. There are languages that express only polynomial time computations, l

Actually, you can construct a language where you cannot amke some kind of actions at all. There are languages that express only polynomial time computations, languages that won't allow you to make deadlocks, etc. http://lambda-the-ultimate.org/classic/message5863.html http://lambda-the-ultimate.org/classic/message5863.html http://edwinb.wordpress.com/2008/04/03/correct-by-construction-concurrency/ http://edwinb.wordpress.com/2008/04/03/correct-by-constructi...