2013-10-15
		01:09 UTC Revision 1 . . . . BayleShanks – " To define sharing without races, D has a coherent model for immutability (via the immutable qualifier) and a model for lock-free sharing (via the . . .

History of notes-computer-programming-programmingLanguageDesign-prosAndCons-typeSystemsForConcurrency