Three things needed in FPC: 1) Garbage collection. Anybody who's worked on apps with objects of objects of objects of objects will see the value in this. If CMEM is used, can the Boehm garbage collector be used? Even a resurrection of the split-heap stuff into something more generalized (mini-heaps) could help here.
2) Contract programming. We have to be able to show proof of correctness in code to prove the business value of FPC. This will be a major theme for the business side of software development in the future. 3) A new concurrency model. Multi-core programming adds a layer of complexity, plus the future of computing is all about where I can buy or steal a unit of computing power for my app. Ok, one more: 4) I miss array slice syntax (str:= s[2..7];) from the Stony Brook M2 days. So much more concise than Copy().; 2) and 4) could probably be handled by pre-processing. Anybody else thought about this stuff? James _______________________________________________ fpc-pascal maillist - fpc-pascal@lists.freepascal.org http://lists.freepascal.org/mailman/listinfo/fpc-pascal
