Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Strongly Normalizing Audited Computation   Auditing is an increasingly important operation for computer programming, for
example in security (e.g. to enable history-based access control) and to enable
reproducibility and accountability (e.g. provenance in scientific programming).
Most proposed auditing techniques are ad hoc or treat auditing as a
second-class, extralinguistic operation; logical or semantic foundations for
auditing are not yet well-established. Justification Logic (JL) offers one such
foundation; Bavera and Bonelli introduced a computational interpretation of JL
called $\lambda^h$ that supports auditing. However, $\lambda^h$ is technically
complex and strong normalization was only established for special cases. In
addition, we show that the equational theory of $\lambda^h$ is inconsistent. We
introduce a new calculus $\lambda^{hc}$ that is simpler than $\lambda^h$,
consistent, and strongly normalizing. Our proof of strong normalization is
formalized in Nominal Isabelle.

32
The categories of this paper are: atom-ph
14
The categories of this paper are: math-ph
6
The categories of this paper are: astro-ph
35
The categories of this paper are: mtrl-th
27
The categories of this paper are: comp-gas
34
The categories of this paper are: chem-ph
25
The categories of this paper are: patt-sol
23
The categories of this paper are: solv-int
16
The categories of this paper are: stat
4
The categories of this paper are: cond-mat
22
The categories of this paper are: chao-dyn
2
The categories of this paper are: math
11
The categories of this paper are: hep-lat
5
The categories of this paper are: gr-qc
36
The categories of this paper are: cmp-lg
9
The categories of this paper are: nlin