87 research outputs found
Discrete Morse theory for computing cellular sheaf cohomology
Sheaves and sheaf cohomology are powerful tools in computational topology,
greatly generalizing persistent homology. We develop an algorithm for
simplifying the computation of cellular sheaf cohomology via (discrete)
Morse-theoretic techniques. As a consequence, we derive efficient techniques
for distributed computation of (ordinary) cohomology of a cell complex.Comment: 19 pages, 1 Figure. Added Section 5.
Thin Games with Symmetry and Concurrent Hyland-Ong Games
We build a cartesian closed category, called Cho, based on event structures.
It allows an interpretation of higher-order stateful concurrent programs that
is refined and precise: on the one hand it is conservative with respect to
standard Hyland-Ong games when interpreting purely functional programs as
innocent strategies, while on the other hand it is much more expressive. The
interpretation of programs constructs compositionally a representation of their
execution that exhibits causal dependencies and remembers the points of
non-deterministic branching.The construction is in two stages. First, we build
a compact closed category Tcg. It is a variant of Rideau and Winskel's category
CG, with the difference that games and strategies in Tcg are equipped with
symmetry to express that certain events are essentially the same. This is
analogous to the underlying category of AJM games enriching simple games with
an equivalence relations on plays. Building on this category, we construct the
cartesian closed category Cho as having as objects the standard arenas of
Hyland-Ong games, with strategies, represented by certain events structures,
playing on games with symmetry obtained as expanded forms of these arenas.To
illustrate and give an operational light on these constructions, we interpret
(a close variant of) Idealized Parallel Algol in Cho
Object-oriented refinement and proof using behaviour functions.
This paper proposes a new calculus for expressing the behaviour of object-oriented systems.
The semantics of the calculus is given in terms of operators from computational category theory.
The calculus aims to span the gulf between abstract specification and concrete implementation of object-oriented systems using mathematically verifiable properties and transformations.
The calculus is compositional and can be used to express the behaviour of partial system views. The calculus is used to specify, analyse and refine a simple case study
- …