On the Relation of Interaction Semantics to Continuations and Defunctionalization

In game semantics and related approaches to programming language semantics, programs are modelled by interaction dialogues. Such models have recently been used in the design of new compilation methods, e.g. for hardware synthesis or for programming with sublinear space. This paper relates such semantically motivated non-standard compilation methods to more standard techniques in the compilation of functional programming languages, namely continuation passing and defunctionalization. We first show for the linear {\lambda}-calculus that interpretation in a model of computation by interaction can be described as a call-by-name CPS-translation followed by a defunctionalization procedure that takes into account control-flow information. We then establish a relation between these two compilation methods for the simply-typed {\lambda}-calculus and end by considering recursion

Updated cosmic-ray and radio constraints on light dark matter: Implications for the GeV gamma-ray excess at the Galactic center

The apparent gamma-ray excess in the Galactic center region and inner Galaxy has attracted considerable interest, notably because both its spectrum and radial distribution are consistent with an interpretation in terms of annihilating dark matter particles with a mass of about 10-40 GeV. We confront such an interpretation with an updated compilation of various indirect dark matter detection bounds, which we adapt to the specific form required by the observed signal. We find that cosmic-ray positron data strongly rule out dark matter annihilating to light leptons, or 'democratically' to all leptons, as an explanation of the signal. Cosmic-ray antiprotons, for which we present independent and significantly improved limits with respect to previous estimates, are already in considerable tension with DM annihilation to any combination of quark final states; the first set of AMS-02 data will thus be able to rule out or confirm the DM hypothesis with high confidence. For reasonable assumptions about the magnetic field in the Galactic center region, radio observations independently put very severe constraints on a DM interpretation of the excess, in particular for all leptonic annihilation channels.Comment: 23 pages revtex, 19 figures, 1 table. Extended discussion of antiproton limits and added references. Matches published versio

NEUTROSOPHIC LOGIC, WAVE MECHANICS, AND OTHER STORIES

There is beginning for anything; we used to hear that phrase. The same wisdom word applies to the authors too. What began in 2005 as a short email on some ideas related to interpretation of the Wave Mechanics results in a number of papers and books up to now. Some of these papers can be found in Progress in Physics or elsewhere. It is often recognized that when a mathematician meets a physics-inclined mind then the result is either a series of endless debates or publication. In this story, authors preferred to publish rather than perish. Therefore, the purpose with this book is to present a selection of published papers in a compilation which enable the readers to find some coherent ideas which appear in those articles. For this reason, the ordering of the papers here is based on categories of ideas

Proposed interpretations of Rule 503, Commissions proposed interpretation 503-2 : definition of the word client as used in Rule 503 and ; Proposed interpretation 503-3 : definition of products or services of others as used in Rule 503 ;Proposed interpretation 503-2 : definition of the word client as used in Rule 503;Proposed interpretation 503-3 : definition of products or services of others as used in Rule 503;Definition of the word client as used in Rule 503;Definition of products or services of others as used in Rule 503; Exposure draft (American Institute of Certified Public Accountants), 1983, Sept. 6

Proposed Interpretation 503-2, Definition of the Word \u27Client\u27 as Used in Rule 503, narrows the term client to a person or entity that has retained a member or his firm engaged in the practice of public accounting to perform audit, accounting, review, compilation, tax, or management advisory services. Proposed Interpretation 503-3, Definition of \u27Products or Services of Others\u27 as Used in Rule 503, limits the application of rule 503 to the referral of those products or services with respect to which CPAs can reasonably be expected by clients to have professional skill or knowledge as a result of education or experience as CPAs.https://egrove.olemiss.edu/aicpa_sop/1460/thumbnail.jp

Modular Compilation of a Synchronous Language

Synchronous languages rely on formal methods to ease the development of applications in an efficient and reusable way. Formal methods have been advocated as a means of increasing the reliability of systems, especially those which are safety or business critical. It is still difficult to develop automatic specification and verification tools due to limitations like state explosion, undecidability, etc... In this work, we design a new specification model based on a reactive synchronous approach. Then, we benefit from a formal framework well suited to perform compilation and formal validation of systems. In practice, we design and implement a special purpose language (LE) and its two semantics~: the ehavioral semantics helps us to define a program by the set of its behaviors and avoid ambiguousness in programs' interpretation; the execution equational semantics allows the modular compilation of programs into software and hardware targets (c code, vhdl code, fpga synthesis, observers). Our approach is pertinent considering the two main requirements of critical realistic applications~: the modular compilation allows us to deal with large systems, the model-based approach provides us with formal validation

Knowledge Compilation of Logic Programs Using Approximation Fixpoint Theory

To appear in Theory and Practice of Logic Programming (TPLP), Proceedings of ICLP 2015 Recent advances in knowledge compilation introduced techniques to compile \emph{positive} logic programs into propositional logic, essentially exploiting the constructive nature of the least fixpoint computation. This approach has several advantages over existing approaches: it maintains logical equivalence, does not require (expensive) loop-breaking preprocessing or the introduction of auxiliary variables, and significantly outperforms existing algorithms. Unfortunately, this technique is limited to \emph{negation-free} programs. In this paper, we show how to extend it to general logic programs under the well-founded semantics. We develop our work in approximation fixpoint theory, an algebraical framework that unifies semantics of different logics. As such, our algebraical results are also applicable to autoepistemic logic, default logic and abstract dialectical frameworks

Abstract Interpretation-based verification/certification in the ciaoPP system

CiaoPP is the abstract interpretation-based preprocessor of the Ciao multi-paradigm (Constraint) Logic Programming system. It uses modular, incremental abstract interpretation as a fundamental tool to obtain information about programs. In CiaoPP, the semantic approximations thus produced have been applied to perform high- and low-level optimizations during program compilation, including transformations such as múltiple abstract specialization, parallelization, partial evaluation, resource usage control, and program verification. More recently, novel and promising applications of such semantic approximations are being applied in the more general context of program development such as program verification. In this work, we describe our extensión of the system to incorpórate Abstraction-Carrying Code (ACC), a novel approach to mobile code safety. ACC follows the standard strategy of associating safety certificates to programs, originally proposed in Proof Carrying- Code. A distinguishing feature of ACC is that we use an abstraction (or abstract model) of the program computed by standard static analyzers as a certifícate. The validity of the abstraction on the consumer side is checked in a single-pass by a very efficient and specialized abstractinterpreter. We have implemented and benchmarked ACC within CiaoPP. The experimental results show that the checking phase is indeed faster than the proof generation phase, and that the sizes of certificates are reasonable. Moreover, the preprocessor is based on compile-time (and run-time) tools for the certification of CLP programs with resource consumption assurances

Putting Instruction Sequences into Effect

An attempt is made to define the concept of execution of an instruction sequence. It is found to be a special case of directly putting into effect of an instruction sequence. Directly putting into effect of an instruction sequences comprises interpretation as well as execution. Directly putting into effect is a special case of putting into effect with other special cases classified as indirectly putting into effect