Hi Russ, your wiki is very nice. A small comments: maybe you might extend the example of the append/3. Have a look a this two slides (they refer to http://www.info.ucl.ac.be/people/PVR/tutFinal.pdf):
http://www.elet.polimi.it/upload/gualandi/append.pdf In this way, you can show that in Oz you really use search when needed. Maybe, you can be interested in a "situation calculus" example. You can find both the prolog and oz version: http://www.elet.polimi.it/upload/gualandi/situation_cal.pl http://www.elet.polimi.it/upload/gualandi/sit_cal.oz Eventually, you need to compile search.oz functor (you can use your own search): http://www.elet.polimi.it/upload/gualandi/search.oz bye, Stefano In <[EMAIL PROTECTED]> Russ Abbott wrote: > ------=_Part_34851_19847368.1128959076653 > Content-Type: text/plain; charset=ISO-8859-1 > Content-Transfer-Encoding: quoted-printable > Content-Disposition: inline > > In > http://cs.calstatela.edu/~wiki/index.php/Courses/CS_460/Fall_2005/ > Concurren= t_logic_programming_in_Oz, I attempt to give a brief > description of concurrent logic programming in Oz= .. The first (and > main) part is explicitly procedural. Its procedurality bothered me > enough to prompt an attempt to offer a declarative interpretation. > This seems somewhat unusual in that it offers a declarative version of > logic programming in terms of a procedural version rather than the > other way around. If anyone has any comments, I'd be very interested. > -- Russ > _____________________________________________ > Professor, Computer Science > California State University, Los Angeles > o Check out my blog at http://russabbott.blogspot.com/ > > ------=_Part_34851_19847368.1128959076653 > Content-Type: text/html; charset=ISO-8859-1 > Content-Transfer-Encoding: quoted-printable > Content-Disposition: inline > > <div>In <a href=3D"http://cs.calstatela.edu/~wiki/index.php/ > Courses/C= S_460/Fall_2005/Concurrent_logic_programming_in_Oz">http:// > cs.calstatela.ed= u/~wiki/index.php/Courses/CS_460/Fall_2005/ > Concurrent_logic_programming_in_= Oz</a> , I attempt to give a brief > description of concurrent logic programming in = Oz. The first ( > and main) part is explicitly procedural. Its procedura= lity bothered > me enough to prompt an attempt to offer a declarative interpr= etation. > This seems somewhat unusual in that it offers a declarative versio= n > of logic programming in terms of a procedural version rather than the > oth= er way around.=20 </div> <div> </div> <div>If anyone has any > comments, I'd be very interested.</div> <div> </div> <div>-- Russ > <br>_____________________________________________<br>Professor= , > Computer Science<br>California State University, Los Angeles<br>o > Check o= ut my blog at <a href=3D"http://russabbott.blogspot.com/ > ">http://russabbott= ..blogspot.com/ </a> </div> > > ------=_Part_34851_19847368.1128959076653-- > _________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
