The article mentions that it's related, but somewhat simpler because it's "only" backtracking, versus Prolog's full logic programming:
The embedding recalls the continuation strategies used to implement Prolog-style logic programming, but is sparer because the operator provided is much like a Scheme boolean operator, does not require special contexts for its use, and does not rely on linguistic infrastructure such as logic variables and unification.
Comments
Isn't this just the prolog-ism of backtracking imported into other languages? Especially as long you just evaluate the options in order?
The article mentions that it's related, but somewhat simpler because it's "only" backtracking, versus Prolog's full logic programming:
The embedding recalls the continuation strategies used to implement Prolog-style logic programming, but is sparer because the operator provided is much like a Scheme boolean operator, does not require special contexts for its use, and does not rely on linguistic infrastructure such as logic variables and unification.