Compilation of extended recursion in call-by-value functional languages

This paper formalizes and proves correct a compilation scheme for mutually-recursive definitions in call-by-value functional languages. This scheme supports a wider range of recursive definitions than previous methods. We formalize our technique as a translation scheme to a lambda-calculus featuring in-place update of memory blocks, and prove the translation to be correct.Comment: 62 pages, uses pi

Innocent strategies as presheaves and interactive equivalences for CCS

Seeking a general framework for reasoning about and comparing programming languages, we derive a new view of Milner's CCS. We construct a category E of plays, and a subcategory V of views. We argue that presheaves on V adequately represent innocent strategies, in the sense of game semantics. We then equip innocent strategies with a simple notion of interaction. This results in an interpretation of CCS. Based on this, we propose a notion of interactive equivalence for innocent strategies, which is close in spirit to Beffara's interpretation of testing equivalences in concurrency theory. In this framework we prove that the analogues of fair and must testing equivalences coincide, while they differ in the standard setting.Comment: In Proceedings ICE 2011, arXiv:1108.014

Absence of gastrointestinal infections in a cohort of patients with Zollinger-Ellison syndrome and other acid hypersecretors receiving long-term acid suppression with lansoprazole

<p>Abstract</p> <p>Background</p> <p>The relationship between proton pump inhibitor therapy and other acid suppressing medications and the risk of gastrointestinal infections remains controversial.</p> <p>Methods</p> <p>Patients enrolled in a long-term trial of lansoprazole for Zollinger-Ellison syndrome and other acid hypersecretory states had interval histories taken every six months regarding hospitalizations or other intercurrent medical conditions. All medications taken were also reviewed at each visit. In addition, available patients were specifically queried during the study period 2006–2007 regarding the development of any gastrointestinal infections, hospitalizations, and prescriptions for antibiotics.</p> <p>Results</p> <p>Ninety patients were enrolled in our long-term study and 81 were available for review. The median basal gastric pH for the cohort after stabilization on therapy was 2.9 and ranged from 1.1 – 8.4 with a median pentagastrin stimulated gastric pH of 1.60 (range 1.0 – 8.2). No patient developed a clinically significant gastrointestinal infection during the study. The median patient years of follow-up were 6.25 years.</p> <p>Conclusion</p> <p>In a cohort of patients with gastric acid hypersecretion in whom acid secretion status was monitored on lansoprazole, all were free of significant gastrointestinal infections on long-term follow-up.</p> <p>Trial registration</p> <p>NCT00204373</p

Extended Initiality for Typed Abstract Syntax

Initial Semantics aims at interpreting the syntax associated to a signature as the initial object of some category of 'models', yielding induction and recursion principles for abstract syntax. Zsid\'o proves an initiality result for simply-typed syntax: given a signature S, the abstract syntax associated to S constitutes the initial object in a category of models of S in monads. However, the iteration principle her theorem provides only accounts for translations between two languages over a fixed set of object types. We generalize Zsid\'o's notion of model such that object types may vary, yielding a larger category, while preserving initiality of the syntax therein. Thus we obtain an extended initiality theorem for typed abstract syntax, in which translations between terms over different types can be specified via the associated category-theoretic iteration operator as an initial morphism. Our definitions ensure that translations specified via initiality are type-safe, i.e. compatible with the typing in the source and target language in the obvious sense. Our main example is given via the propositions-as-types paradigm: we specify propositions and inference rules of classical and intuitionistic propositional logics through their respective typed signatures. Afterwards we use the category--theoretic iteration operator to specify a double negation translation from the former to the latter. A second example is given by the signature of PCF. For this particular case, we formalize the theorem in the proof assistant Coq. Afterwards we specify, via the category-theoretic iteration operator, translations from PCF to the untyped lambda calculus

Variable binding, symmetric monoidal closed theories, and bigraphs

This paper investigates the use of symmetric monoidal closed (SMC) structure for representing syntax with variable binding, in particular for languages with linear aspects. In our setting, one first specifies an SMC theory T, which may express binding operations, in a way reminiscent from higher-order abstract syntax. This theory generates an SMC category S(T) whose morphisms are, in a sense, terms in the desired syntax. We apply our approach to Jensen and Milner's (abstract binding) bigraphs, which are linear w.r.t. processes. This leads to an alternative category of bigraphs, which we compare to the original.Comment: An introduction to two more technical previous preprints. Accepted at Concur '0

On the implementation of recursion in call-by-value functional languages

Functional languages encourage the extensive use of recursive fonctions and data structures. It is therefore important that they efficiently implement recursion. In this paper, we formalize and improve a known implementation technique for recursion. The original technique was introduced by Cousineau and Mauny as the «in-place updating trick». Consider a list of mutually recursive definitions. The technique consists in allocating a dummy, uninitialized heap block for each recursive definition. The size of these blocks is guessed from the shape of each definition. Then, the right-hand sides of the definitions are computed. Recursively-defined identifiers thus refer to the corresponding dummy blocks. This leads, for each definition, to a block of the expected size. Eventually, the contents of the obtained blocks are copied to the dummy blocks, updating them in place. The only change we propose to this scheme is to update the dummy blocks as soon as possible, immediately after each definition is computed, thus making it available for further use. At the source language level, the improvement allows to extend the class of expressions allowed as right-hand sides of recursive definitions, usually restricted to syntactic functions. We formalize our technique as a translation scheme to a lambda-calculus featuring in-place updating of memory blocks, and prove the translation to be faithful

Autoantibody Profiling for Lung Cancer Screening Longitudinal Retrospective Analysis of CT Screening Cohorts

Recommendations for lung cancer screening present a tangible opportunity to integrate predictive blood-based assays with radiographic imaging. This study compares performance of autoantibody markers from prior discovery in sample cohorts from two CT screening trials. One-hundred eighty non-cancer and 6 prevalence and 44 incidence cancer cases detected in the Mayo Lung Screening Trial were tested using a panel of six autoantibody markers to define a normal range and assign cutoff values for class prediction. A cutoff for minimal specificity and best achievable sensitivity were applied to 256 samples drawn annually for three years from 95 participants in the Kentucky Lung Screening Trial. Data revealed a discrepancy in quantile distribution between the two apparently comparable sample sets, which skewed the assay’s dynamic range towards specificity. This cutoff offered 43% specificity (102/237) in the control group and accurately classified 11/19 lung cancer samples (58%), which included 4/5 cancers at time of radiographic detection (80%), and 50% of occult cancers up to five years prior to diagnosis. An apparent ceiling in assay sensitivity is likely to limit the utility of this assay in a conventional screening paradigm. Pre-analytical bias introduced by sample age, handling or storage remains a practical concern during development, validation and implementation of autoantibody assays. This report does not draw conclusions about other logical applications for autoantibody profiling in lung cancer diagnosis and management, nor its potential when combined with other biomarkers that might improve overall predictive accuracy

Therapeutic trial of silicone in peptic ulcer

In a controlled double-blind trial of the therapeutic effectiveness of silicone in patients with duodenal ulcer, the silicone tested was shown to be slightly less effective than placebo medication. The relatively good early response of chronically recurring ulcer disease appeared to be due to the emotional impact of “a new treatment of ulcers.”Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/44434/1/10620_2005_Article_BF02232021.pd