792 research outputs found

    Focusing in Asynchronous Games

    Get PDF
    Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as games on which proofs induce strategies. We are specifically interested here in relating two such semantics of linear logic, of very different flavor, which both take in account concurrent features of the proofs: asynchronous games and concurrent games. Interestingly, we show that associating a concurrent strategy to an asynchronous strategy can be seen as a semantical counterpart of the focusing property of linear logic

    A theory for game theories

    Get PDF
    International audienceGame semantics is a valuable source of fully abstract models of programming languages or proof theories based on categories of so-called games and strategies. However, there are many variants of this technique, whose interrelationships largely remain to be elucidated. This raises the question: what is a category of games and strategies? Our central idea, taken from the first author's PhD thesis, is that positions and moves in a game should be morphisms in a base category: playing move m in position f consists in factoring f through m, the new position being the other factor. Accordingly, we provide a general construction which, from a selection of "legal moves" in an almost arbitrary category, produces a category of games and strategies, together with subcategories of deterministic and winning strategies. As our running example, we instantiate our construction to obtain the standard category of Hyland-Ong games subject to the switching condition. The extension of our framework to games without the switching condition is handled in the first author's PhD thesis

    Typing Quantum Superpositions and Measurement

    Get PDF
    We propose a way to unify two approaches of non-cloning in quantum lambda-calculi. The first approach is to forbid duplicating variables, while the second is to consider all lambda-terms as algebraic-linear functions. We illustrate this idea by defining a quantum extension of first-order simply-typed lambda-calculus, where the type is linear on superposition, while allows cloning base vectors. In addition, we provide an interpretation of the calculus where superposed types are interpreted as vector spaces and non-superposed types as their basis.Fil: DĂ­az Caro, Alejandro. Universidad Nacional de Quilmes. Departamento de Ciencia y TecnologĂ­a; Argentina. Consejo Nacional de Investigaciones CientĂ­ficas y TĂ©cnicas; ArgentinaFil: Dowek, Gilles. Institut National de Recherche en Informatique et en Automatique; Franci

    Correlating matched-filter model for analysis and optimisation of neural networks

    Get PDF
    A new formalism is described for modelling neural networks by means of which a clear physical understanding of the network behaviour can be gained. In essence, the neural net is represented by an equivalent network of matched filters which is then analysed by standard correlation techniques. The procedure is demonstrated on the synchronous Little-Hopfield network. It is shown how the ability of this network to discriminate between stored binary, bipolar codes is optimised if the stored codes are chosen to be orthogonal. However, such a choice will not often be possible and so a new neural network architecture is proposed which enables the same discrimination to be obtained for arbitrary stored codes. The most efficient convergence of the synchronous Little-Hopfield net is obtained when the neurons are connected to themselves with a weight equal to the number of stored codes. The processing gain is presented for this case. The paper goes on to show how this modelling technique can be extended to analyse the behaviour of both hard and soft neural threshold responses and a novel time-dependent threshold response is described

    Graphical Reasoning in Compact Closed Categories for Quantum Computation

    Full text link
    Compact closed categories provide a foundational formalism for a variety of important domains, including quantum computation. These categories have a natural visualisation as a form of graphs. We present a formalism for equational reasoning about such graphs and develop this into a generic proof system with a fixed logical kernel for equational reasoning about compact closed categories. Automating this reasoning process is motivated by the slow and error prone nature of manual graph manipulation. A salient feature of our system is that it provides a formal and declarative account of derived results that can include `ellipses'-style notation. We illustrate the framework by instantiating it for a graphical language of quantum computation and show how this can be used to perform symbolic computation.Comment: 21 pages, 9 figures. This is the journal version of the paper published at AIS

    Involutive Categories and Monoids, with a GNS-correspondence

    Get PDF
    This paper develops the basics of the theory of involutive categories and shows that such categories provide the natural setting in which to describe involutive monoids. It is shown how categories of Eilenberg-Moore algebras of involutive monads are involutive, with conjugation for modules and vector spaces as special case. The core of the so-called Gelfand-Naimark-Segal (GNS) construction is identified as a bijective correspondence between states on involutive monoids and inner products. This correspondence exists in arbritrary involutive categories

    A categorical framework for the quantum harmonic oscillator

    Full text link
    This paper describes how the structure of the state space of the quantum harmonic oscillator can be described by an adjunction of categories, that encodes the raising and lowering operators into a commutative comonoid. The formulation is an entirely general one in which Hilbert spaces play no special role. Generalised coherent states arise through the hom-set isomorphisms defining the adjunction, and we prove that they are eigenstates of the lowering operators. Surprisingly, generalised exponentials also emerge naturally in this setting, and we demonstrate that coherent states are produced by the exponential of a raising morphism acting on the zero-particle state. Finally, we examine all of these constructions in a suitable category of Hilbert spaces, and find that they reproduce the conventional mathematical structures.Comment: 44 pages, many figure

    The Category of Node-and-Choice Forms, with Subcategories for Choice-Sequence Forms and Choice-Set Forms

    Full text link
    The literature specifies extensive-form games in many styles, and eventually I hope to formally translate games across those styles. Toward that end, this paper defines NCF\mathbf{NCF}, the category of node-and-choice forms. The category's objects are extensive forms in essentially any style, and the category's isomorphisms are made to accord with the literature's small handful of ad hoc style equivalences. Further, this paper develops two full subcategories: CsqF\mathbf{CsqF} for forms whose nodes are choice-sequences, and CsetF\mathbf{CsetF} for forms whose nodes are choice-sets. I show that NCF\mathbf{NCF} is "isomorphically enclosed" in CsqF\mathbf{CsqF} in the sense that each NCF\mathbf{NCF} form is isomorphic to a CsqF\mathbf{CsqF} form. Similarly, I show that CsqFa~\mathbf{CsqF_{\tilde a}} is isomorphically enclosed in CsetF\mathbf{CsetF} in the sense that each CsqF\mathbf{CsqF} form with no-absentmindedness is isomorphic to a CsetF\mathbf{CsetF} form. The converses are found to be almost immediate, and the resulting equivalences unify and simplify two ad hoc style equivalences in Kline and Luckraz 2016 and Streufert 2019. Aside from the larger agenda, this paper already makes three practical contributions. Style equivalences are made easier to derive by [1] a natural concept of isomorphic invariance and [2] the composability of isomorphic enclosures. In addition, [3] some new consequences of equivalence are systematically deduced.Comment: 43 pages, 9 figure

    Partial order and a T0T_0-topology in a set of finite quantum systems

    Full text link
    A `whole-part' theory is developed for a set of finite quantum systems Σ(n)\Sigma (n) with variables in Z(n){\mathbb Z}(n). The partial order `subsystem' is defined, by embedding various attributes of the system Σ(m)\Sigma (m) (quantum states, density matrices, etc) into their counterparts in the supersystem Σ(n)\Sigma (n) (for m∣nm|n). The compatibility of these embeddings is studied. The concept of ubiquity is introduced for quantities which fit with this structure. It is shown that various entropic quantities are ubiquitous. The sets of various quantities become T0T_0-topological spaces with the divisor topology, which encapsulates fundamental physical properties. These sets can be converted into directed-complete partial orders (dcpo), by adding `top elements'. The continuity of various maps among these sets is studied

    A combined microfinance and training intervention can reduce HIV risk behaviour in young female participants.

    Get PDF
    OBJECTIVE: To assess effects of a combined microfinance and training intervention on HIV risk behavior among young female participants in rural South Africa. DESIGN: : Secondary analysis of quantitative and qualitative data from a cluster randomized trial, the Intervention with Microfinance for AIDS and Gender Equity study. METHODS: Eight villages were pair-matched and randomly allocated to receive the intervention. At baseline and after 2 years, HIV risk behavior was assessed among female participants aged 14-35 years. Their responses were compared with women of the same age and poverty group from control villages. Intervention effects were calculated using adjusted risk ratios employing village level summaries. Qualitative data collected during the study explored participants' responses to the intervention including HIV risk behavior. RESULTS: After 2 years of follow-up, when compared with controls, young participants had higher levels of HIV-related communication (adjusted risk ratio 1.46, 95% confidence interval 1.01-2.12), were more likely to have accessed voluntary counseling and testing (adjusted risk ratio 1.64, 95% confidence interval 1.06-2.56), and less likely to have had unprotected sex at last intercourse with a nonspousal partner (adjusted risk ratio 0.76, 95% confidence interval 0.60-0.96). Qualitative data suggest a greater acceptance of intrahousehold communication about HIV and sexuality. Although women noted challenges associated with acceptance of condoms by men, increased confidence and skills associated with participation in the intervention supported their introduction in sexual relationships. CONCLUSIONS: In addition to impacts on economic well being, women's empowerment and intimate partner violence, interventions addressing the economic and social vulnerability of women may contribute to reductions in HIV risk behavior
    • 

    corecore