Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic
  Theories   Cyclic data structures, such as cyclic lists, in functional programming are
tricky to handle because of their cyclicity. This paper presents an
investigation of categorical, algebraic, and computational foundations of
cyclic datatypes. Our framework of cyclic datatypes is based on second-order
algebraic theories of Fiore et al., which give a uniform setting for syntax,
types, and computation rules for describing and reasoning about cyclic
datatypes. We extract the "fold" computation rules from the categorical
semantics based on iteration categories of Bloom and Esik. Thereby, the rules
are correct by construction. We prove strong normalisation using the General
Schema criterion for second-order computation rules. Rather than the fixed
point law, we particularly choose Bekic law for computation, which is a key to
obtaining strong normalisation. We also prove the property of "Church-Rosser
modulo bisimulation" for the computation rules. Combining these results, we
have a remarkable decidability result of the equational theory of cyclic data
and fold.

37
The categories of this paper are: supr-con
36
The categories of this paper are: cmp-lg
25
The categories of this paper are: patt-sol
32
The categories of this paper are: atom-ph
21
The categories of this paper are: adap-org
17
The categories of this paper are: q-fin
15
The categories of this paper are: nucl-ex
34
The categories of this paper are: chem-ph
24
The categories of this paper are: dg-ga
12
The categories of this paper are: nucl-th
11
The categories of this paper are: hep-lat
10
The categories of this paper are: q-bio
2
The categories of this paper are: math
22
The categories of this paper are: chao-dyn
4
The categories of this paper are: cond-mat
7
The categories of this paper are: hep-th