Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Towards Patterns for Heaps and Imperative Lambdas   In functional programming, point-free relation calculi have been fruitful for
general theories of program construction, but for specific applications
pointwise expressions can be more convenient and comprehensible. In imperative
programming, refinement calculi have been tied to pointwise expression in terms
of state variables, with the curious exception of the ubiquitous but invisible
heap. To integrate pointwise with point-free, de Moor and Gibbons extended
lambda calculus with non-injective pattern matching interpreted using
relations. This article gives a semantics of that language using ``ideal
relations'' between partial orders, and a second semantics using predicate
transformers. The second semantics is motivated by its potential use with
separation algebra, for pattern matching in programs acting on the heap. Laws
including lax beta and eta are proved in these models and a number of open
problems are posed.

2
The categories of this paper are: math
32
The categories of this paper are: atom-ph
28
The categories of this paper are: alg-geom
3
The categories of this paper are: physics
27
The categories of this paper are: comp-gas
6
The categories of this paper are: astro-ph
11
The categories of this paper are: hep-lat
10
The categories of this paper are: q-bio
31
The categories of this paper are: ao-sci
21
The categories of this paper are: adap-org
23
The categories of this paper are: solv-int
22
The categories of this paper are: chao-dyn
37
The categories of this paper are: supr-con
7
The categories of this paper are: hep-th
24
The categories of this paper are: dg-ga
18
The categories of this paper are: econ