Russ Abbott wrote:
In
http://cs.calstatela.edu/~wiki/index.php/Courses/CS_460/Fall_2005/Concurrent_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.
Well, that looks good! Two comments:
In item 2.b, don't forget the "end" in the "if" statement:
if X<0 then fail end.
In the "Declarative interpretation", I suggest that you give the logic
semantics of the sequence and the choice. If S1 and S2 are statements,
- S1 S2 can be read as "S1 AND S2";
- choice S1 [] S2 end can be read as "S1 OR S2".
Cheers,
raph
_________________________________________________________________________________
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
