51 research outputs found
-typical Witt vectors with coefficients and the norm
For a profinite group we describe an abelian group of
-typical Witt vectors with coefficients in an -module (where is a
commutative ring). This simultaneously generalises the ring of Dress
and Siebeneicher and the Witt vectors with coefficients of Dotto,
Krause, Nikolaus and Patchkoria, both of which extend the usual Witt vectors of
a ring. We use this new variant of Witt vectors to give a purely algebraic
description of the zeroth equivariant stable homotopy groups of the
Hill-Hopkins-Ravenel norm of a connective spectrum , for
any finite group . Our construction is reasonably analogous to the
constructions of previous variants of Witt vectors, and as such is amenable to
fairly explicit concrete computations.Comment: 83 page
Making concurrency functional
The article bridges between two major paradigms in computation, the functional, at basis computation from input to output, and the interactive, where computation reacts to its environment while underway. Central to any compositional theory of interaction is the dichotomy between a system and its environment. Concurrent games and strategies address the dichotomy in fine detail, very locally, in a distributed fashion, through distinctions between Player moves (events of the system) and Opponent moves (those of the environment). A functional approach has to handle the dichotomy much more ingeniously, through its blunter distinction between input and output. This has led to a variety of functional approaches, specialised to particular interactive demands. Through concurrent games we can more clearly see what separates and connects the differing paradigms, and show how: * to lift functions to strategies; the "Scott order" intrinsic to concurrent games plays a key role in turning functional dependency to causal dependency. * several paradigms of functional programming and logic arise naturally as subcategories of concurrent games, including stable domain theory; nondeterministic dataflow; geometry of interaction; the dialectica interpretation; lenses and optics; and their extensions to containers in dependent lenses and optics. * to transfer enrichments of strategies (such as to probabilistic, quantum or real-number computation) to functional cases
Categorical Modelling of Logic Programming: Coalgebra, Functorial Semantics, String Diagrams
Logic programming (LP) is driven by the idea that logic subsumes computation. Over the
past 50 years, along with the emergence of numerous logic systems, LP has also grown into a
large family, the members of which are designed to deal with various computation scenarios.
Among them, we focus on two of the most influential quantitative variants are probabilistic
logic programming (PLP) and weighted logic programming (WLP).
In this thesis, we investigate a uniform understanding of logic programming and its quan-
titative variants from the perspective of category theory. In particular, we explore both a
coalgebraic and an algebraic understanding of LP, PLP and WLP.
On the coalgebraic side, we propose a goal-directed strategy for calculating the probabilities
and weights of atoms in PLP and WLP programs, respectively. We then develop a coalgebraic
semantics for PLP and WLP, built on existing coalgebraic semantics for LP. By choosing
the appropriate functors representing probabilistic and weighted computation, such coalgeraic
semantics characterise exactly the goal-directed behaviour of PLP and WLP programs.
On the algebraic side, we define a functorial semantics of LP, PLP, and WLP, such that they
three share the same syntactic categories of string diagrams, and differ regarding to the semantic
categories according to their data/computation type. This allows for a uniform diagrammatic
expression for certain semantic constructs. Moreover, based on similar approaches to Bayesian
networks, this provides a framework to formalise the connection between PLP and Bayesian
networks. Furthermore, we prove a sound and complete aximatization of the semantic category
for LP, in terms of string diagrams. Together with the diagrammatic presentation of the
fixed point semantics, one obtain a decidable calculus for proving the equivalence between
propositional definite logic programs
Strong pseudomonads and premonoidal bicategories
Strong monads and premonoidal categories play a central role in clarifying
the denotational semantics of effectful programming languages. Unfortunately,
this theory excludes many modern semantic models in which the associativity and
unit laws only hold up to coherent isomorphism: for instance, because
composition is defined using a universal property. This paper remedies the
situation. We define premonoidal bicategories and a notion of strength for
pseudomonads, and show that the Kleisli bicategory of a strong pseudomonad is
premonoidal. As often in 2-dimensional category theory, the main difficulty is
to find the correct coherence axioms on 2-cells. We therefore justify our
definitions with numerous examples and by proving a correspondence theorem
between actions and strengths, generalizing a well-known category-theoretic
result.Comment: Comments and feedback welcome
Output Without Delay: A ?-Calculus Compatible with Categorical Semantics
The quest for logical or categorical foundations of the ?-calculus (not limited to session-typed variants) remains an important challenge. A categorical type theory correspondence for a variant of the i/o-typed ?-calculus was recently revealed by Sakayori and Tsukada, but, at the same time, they exposed that this categorical semantics contradicts with most of the behavioural equivalences. This paper diagnoses the nature of this problem and attempts to fill the gap between categorical and operational semantics. We first identify the source of the problem to be the mismatch between the operational and categorical interpretation of a process called the forwarder. From the operational viewpoint, a forwarder may add an arbitrary delay when forwarding a message, whereas, from the categorical viewpoint, a forwarder must not add any delay when forwarding a message. Led by this observation, we introduce a calculus that can express forwarders that do not introduce delay. More specifically, the calculus we introduce is a variant of the ?-calculus with a new operational semantics in which output actions are forced to happen as soon as they get unguarded. We show that this calculus (i) is compatible with the categorical semantics and (ii) can encode the standard ?-calculus
Compositional Game Theory, compositionally
We present a new compositional approach to compositional game theory (CGT) based upon Arrows, a concept originally from functional programming, closely related to Tambara modules, and operators to build new Arrows from old. We model equilibria as a module over an Arrow and define an operator to build a new Arrow from such a module over an existing Arrow. We also model strategies as graded Arrows and define an operator which builds a new Arrow by taking the colimit of a graded Arrow. A final operator builds a graded Arrow from a graded bimodule. We use this compositional approach to CGT to show how known and previously unknown variants of open games can be proven to form symmetric monoidal categories
Cohomology of Finite Groups: Interactions and Applications (hybrid meeting)
The cohomology of finite groups is an important tool in many subjects
including representation theory and algebraic topology.
This meeting was the fifth in a series that has emphasized the interactions
of group cohomology with other areas. In spite of the Covid-19 epidemic,
this hybrid meeting ran smoothly with about half the participants physically
present and the other half participating via Zoom
- …