Theoretical Computer Science
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient Resource Management for Linear Logic Proof Search
ELP '96 Proceedings of the 5th International Workshop on Extensions of Logic Programming
| Hi-index | 0.00 |
We propose a query language based on extended regular expressions. This language extends texts with text-generating macros. These macros make it possible to define languages in a compressed, elegant way. This paper also extends queries with linear implications and additive (classical) conjunctions. To be precise, it allows goals of the form D ⊸ G and G1 & G2 where D is a text or a macro and G is a query. The first goal is 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 solved by solving both G1 and G2 from the current text. This goal is particularly useful for internet search.