Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Finite-Tree Analysis for Constraint Logic-Based Languages: The Complete
  Unabridged Version   Logic languages based on the theory of rational, possibly infinite, trees
have much appeal in that rational trees allow for faster unification (due to
the safe omission of the occurs-check) and increased expressivity (cyclic terms
can provide very efficient representations of grammars and other useful
objects). Unfortunately, the use of infinite rational trees has problems. For
instance, many of the built-in and library predicates are ill-defined for such
trees and need to be supplemented by run-time checks whose cost may be
significant. Moreover, some widely-used program analysis and manipulation
techniques are correct only for those parts of programs working over finite
trees. It is thus important to obtain, automatically, a knowledge of the
program variables (the finite variables) that, at the program points of
interest, will always be bound to finite terms. For these reasons, we propose
here a new data-flow analysis, based on abstract interpretation, that captures
such information.

8
The categories of this paper are: hep-ex
33
The categories of this paper are: plasm-ph
36
The categories of this paper are: cmp-lg
23
The categories of this paper are: solv-int
35
The categories of this paper are: mtrl-th
7
The categories of this paper are: hep-th
32
The categories of this paper are: atom-ph
4
The categories of this paper are: cond-mat
19
The categories of this paper are: eess
25
The categories of this paper are: patt-sol
26
The categories of this paper are: bayes-an
15
The categories of this paper are: nucl-ex
21
The categories of this paper are: adap-org
10
The categories of this paper are: q-bio
18
The categories of this paper are: econ
12
The categories of this paper are: nucl-th