# Collection analysis for Horn clause programs

1 PARSIFAL - Proof search and reasoning with logic specifications
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : We consider approximating data structures with collections of the items that they contain. For examples, lists, binary trees, tuples, etc, can be approximated by sets or multisets of the items within them. Such approximations can be used to provide partial correctness properties of logic programs. For example, one might wish to specify than whenever the atom $sort(t,s)$ is proved then the two lists $t$ and $s$ contain the same multiset of items (that is, $s$ is a permutation of $t$). If sorting removes duplicates, then one would like to infer that the sets of items underlying $t$ and $s$ are the same. Such results could be useful to have if they can be determined statically and automatically. We present a scheme by which such collection analysis can be structured and automated. Central to this scheme is the use of linear logic as a omputational logic underlying the logic of Horn clauses.
Document type :
Conference papers

Cited literature [25 references]

https://hal.inria.fr/inria-00167225
Contributor : Dale Miller <>
Submitted on : Thursday, August 16, 2007 - 5:43:00 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:29 PM
Long-term archiving on: Friday, April 9, 2010 - 12:50:14 AM

### Files

ppdp06-hal.pdf
Publisher files allowed on an open archive

### Identifiers

• HAL Id : inria-00167225, version 1
• ARXIV : 0708.2230

### Citation

Dale Miller. Collection analysis for Horn clause programs. International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, Jul 2006, Venice, Italy. ⟨inria-00167225⟩

Record views