An Internet Query Language based on Intuitionistic Linear Logic

We propose an Internet query language based on intuitionistic linear logic. This language extends regular expressions with linear implications and additive (classical) conjunctions. To be precise, it allows goals of the form D -o G and G₁&G₂ where D is a text and G is a goal. The first goal is intended to be solved by adding D to the current text and then solving G. This goal is flexible in controlling the current text dynamically. The second goal is intended to be solved by solving both G₁ and G2 from the current text. This goal is particularly useful for internet search.