BACKGROUND We aimed to identify novel genetic variants affecting asthma risk, since these might provide novel insights into molecular mechanisms underlying the disease. METHODS We did a genome-wide association study (GWAS) in 2669 physician-diagnosed asthmatics and 4528 controls from Australia. Seven loci were prioritised for replication after combining… (More)
We present three term rewrite systems for integer arithmetic with addition, multiplication , and, in two cases, subtraction. All systems are ground connuent and terminating; termination is proved by semantic labelling and recursive path order. The rst system represents numbers by successor and predecessor. In the second, which deenes non-negative integers… (More)
We measured the levels of IFNgamma, TNFalpha, Il-4 and Il-10 produced by mitogen-stimulated peripheral blood mononuclear cells (PBMC) from healthy people, and those with the relapse/remitting form of multiple sclerosis. Blood was taken in summer and winter. Healthy people had a summer excess of Il-4, Il-10 and TNFalpha, and a winter excess of IFNgamma.… (More)
BACKGROUND Exposure to cigarette smoke (CS) is associated with increased risk of pneumococcal infection. The mechanism for this association is unknown. We recently reported that the particulate matter from urban air simulates platelet-activating factor receptor (PAFR)-dependent adhesion of pneumococci to airway cells. We therefore sought to determine… (More)
We present a term rewriting system for decimal integers with addition and subtraction. We prove that the system is connuent and terminating.
The design and implementation of the language fSDL (full Structure Deenition Language) is discussed. In fSDL, complex user-deened data types such as lists, tables, trees, and graphs can be constructed from a tiny set of primitives. Beyond mere structure deeni-tions (also ooered by previously existing tools) high-level functionality on these data types can… (More)
A simple, eecient, and correct compilation technique for left-linear Term Rewriting Systems (TRSs) is presented. TRSs are compiled into Minimal Term Rewriting Systems (MTRSs), a subclass of TRSs, presented in WK95]. In MTRSs, the rules have such a simple form that they can be seen as instructions for an easily implementable abstract machine, the Abstract… (More)