Complex Objects and Applications
We further develop our earlier complex objects proposals and present several new and improved solutions, for a variety of problems: a faster SAT solution with a fixed number of rules, a simple metaprogramming facility, a monad template and a termination detection algorithm. This results enforce our conjecture that our complex object proposals enable an efficient high-level programming style for P systems.
P systems complex objects generic rules data structures control flow parallel composition function calls recursion monads metaprogramming numerical P systems NP-complete termination detection applications
Radu Nicolescu Huiling Wu
Department of Computer Science,University of Auckland,Private Bag 92019,Auckland,New Zealand
国际会议
成都
英文
179-198
2013-11-04(万方平台首次上网日期,不代表论文的发表时间)