Tracy Harms-3 wrote: > > My take on the matter is this: Amb involves closures. J does not. > > http://www.jsoftware.com/jwiki/Guides/Lexical_Closure > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > > Well, closures are not the only way to get something that Amb is supposed to describe, as, for instance, PROLOG does solve the problem "naturally" without closures and/or continuations. I think the main message that Amb is supposed to get across, if we are to construct it from this excercise, is the notion of non-deterministic computation, which requires neither explicit/implicit lexical closures, nor, for that matter, Amb itself.
-- View this message in context: http://www.nabble.com/Rosetta-Codes%3A-Amb-operator-tp20682749s24193p20741350.html Sent from the J Programming mailing list archive at Nabble.com. ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
