Linear logic as logic programming: An abstract

From MaRDI portal





The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, \(\lambda\)Prolog and its linear logic refinement, Lolli [\textit{J. Hodas} and \textit{D. Miller}, Inf. Comput. 110, 327-365 (1994; Zbl 0807.68016)], provide for various forms of abstraction (modules, abstract data types, and higher-order programming) but lack primitives for concurrency. The logic programming language LO (Linear Objects) [\textit{J.-M. Andreoli} and \textit{R. Pareschi}, New Gener. Comput. 9, 445-473 (1991; Zbl 0731.68022)] provides some primitives for concurrency but lacks abstraction mechanisms. Forum is a logic programming presentation of all of linear logic that modularly extends \(\lambda\)Prolog, Lolli, and LO. This language, therefore, allows specifications to incorporate both abstractions and concurrency. For the entire collection see [Zbl 0877.00010].











This page was built for publication: Linear logic as logic programming: An abstract

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4370235)