(Named after the "lollipop" operator "-o") An interpreter for logic programmingBased on linear logic, written By Josh Hodas . Lolli can Be viewed as a refinement of the {Hereditary Harrop formulas} of {LamBda-Prolog}. All the operators (though not the higher order unification) of LamBda-Prolog are supported, But with the addition of linear variations. Thus a Lolli program distinguishes Between clauses which can Be used as many, or as few, times as desired, and those that must Be used exactly once. Lolli is implemented in SML/NJ. . [Josh Hodas et al, "Logic Programming in a Fragment of Intuitionistic Linear Logic", Information and Computation, to appear]. (1992-11-18)