User loginNavigation 
Lightweight Static Capabilitites (II)The slides for the talk discussed here are now available for download. Like all of Ken and Oleg's work, this stuff is both cool and important. Keep in mind that the talk is quite different from the paper. The safety claims were formalized and proved in Twelf: list example, array example. To follow the proofs you should read them alongside the presentation slides. I am told that the first file might change soon, to reflect a more general proof. Perhaps Ken or Oleg would like to comment on the experience of doing mechanized proofs, a subject the comes up regularly on LtU. LtU newcomers, who already managed to take in a little Haskell or ML, may want to spend a little time chewing on this, and ask questions if something remains unclear, since this work may eventually have practical importance, and can teach quite a few interesting techniques. By Ehud Lamm at 20060829 08:34  Semantics  Software Engineering  Type Theory  other blogs  7183 reads

Browse archivesActive forum topics 
Recent comments
7 hours 14 min ago
8 hours 38 min ago
10 hours 5 min ago
11 hours 15 min ago
11 hours 56 min ago
14 hours 44 min ago
15 hours 48 min ago
18 hours 8 min ago
23 hours 40 min ago
1 day 53 min ago