On 30 Oct 2012, at 11:26, alexgian wrote: >> The next step is the distribution subsystem. Mozart 2.0 has a reflective >> language interface, where you can write Oz code to change the semantics of >> language operations. > > Brilliant. I got nothing against Gump, but that whole C/yacc route was a bit > convoluted for my tastes.
Actually, Gump is more intended for defining new languages from scratch, not for changing the semantics of Oz itself. (I hope either Gump or something similar will still be available in the medium/long term for Mozart 2 :) >> We are also redoing completely the constraint subsystem. It will be based >> on Gecode, and it is being implemented by the Avispa research group in Cali, >> Colombia. > Interesting. I have been meaning to look at gecode for a while, now no more > excuses. What I like best of its features is use of multiprocessors locally. > I am assuming that it will comply with the model described by Christian > Schulte's "Programming Constraint Services" (Well, I see Christian is heavily > involved in gecode). Just wondering, as I see it has its own search engine. > Would that mean there would be two approaches to search engines, I wonder? Actually, you can do parallel search -- using either multiple local processors or networked computers -- already in Mozart 1 (it was broken in recent releases introducing the new distribution system, but with older versions it is still there). You can see in Christian Schulte's book you mentioned that he is actually using Oz (Mozart 1) there ;-) Best wishes, Torsten -- Dr Torsten Anders Course Leader, Music Technology University of Bedfordshire Park Square, Room A315 http://www.torsten-anders.de _________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
