Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the Learnability of Programming Language Semantics   Game semantics is a powerful method of semantic analysis for programming
languages. It gives mathematically accurate models ("fully abstract") for a
wide variety of programming languages. Game semantic models are combinatorial
characterisations of all possible interactions between a term and its syntactic
context. Because such interactions can be concretely represented as sets of
sequences, it is possible to ask whether they can be learned from examples.
Concretely, we are using long short-term memory neural nets (LSTM), a technique
which proved effective in learning natural languages for automatic translation
and text synthesis, to learn game-semantic models of sequential and concurrent
versions of Idealised Algol (IA), which are algorithmically complex yet can be
concisely described. We will measure how accurate the learned models are as a
function of the degree of the term and the number of free variables involved.
Finally, we will show how to use the learned model to perform latent semantic
analysis between concurrent and sequential Idealised Algol.

20
The categories of this paper are: acc-phys
28
The categories of this paper are: alg-geom
32
The categories of this paper are: atom-ph
37
The categories of this paper are: supr-con
14
The categories of this paper are: math-ph
5
The categories of this paper are: gr-qc
18
The categories of this paper are: econ
16
The categories of this paper are: stat
12
The categories of this paper are: nucl-th
17
The categories of this paper are: q-fin
8
The categories of this paper are: hep-ex
15
The categories of this paper are: nucl-ex
7
The categories of this paper are: hep-th
19
The categories of this paper are: eess
13
The categories of this paper are: quant-ph
24
The categories of this paper are: dg-ga