Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Proof-Based Synthesis of Sorting Algorithms Using Multisets in Theorema   Using multisets, we develop novel techniques for mechanizing the proofs of
the synthesis conjectures for list-sorting algorithms, and we demonstrate them
in the Theorema system. We use the classical principle of extracting the
algorithm as a set of rewrite rules based on the witnesses found in the proof
of the synthesis conjecture produced from the specification of the desired
function (input and output conditions). The proofs are in natural style, using
standard rules, but most importantly domain specific inference rules and
strategies. In particular the use of multisets allows us to develop powerful
strategies for the synthesis of arbitrarily structured recursive algorithms by
general Noetherian induction, as well as for the automatic generation of the
specifications of all necessary auxiliary functions (insert, merge, split),
whose synthesis is performed using the same method.

31
The categories of this paper are: ao-sci
15
The categories of this paper are: nucl-ex
37
The categories of this paper are: supr-con
0
The categories of this paper are: hep-ph
17
The categories of this paper are: q-fin
2
The categories of this paper are: math
5
The categories of this paper are: gr-qc
9
The categories of this paper are: nlin
32
The categories of this paper are: atom-ph
22
The categories of this paper are: chao-dyn
10
The categories of this paper are: q-bio
16
The categories of this paper are: stat
21
The categories of this paper are: adap-org
11
The categories of this paper are: hep-lat
18
The categories of this paper are: econ
12
The categories of this paper are: nucl-th