資料來源 : Free On-Line Dictionary of Computing

Lolli
     
         (Named after the "lollipop" operator "-o") An
        {interpreter} for {logic programming} based 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}.
     
        {(ftp://ftp.cis.upenn.edu/pub/Lolli/Lolli-0.7.tar.Z)}.
     
        [Josh Hodas et al, "Logic Programming in a Fragment of
        Intuitionistic Linear Logic", Information and Computation, to
        appear].
     
        (1992-11-18)