Projection Factorisations in Partial Evaluation

Partial evaluation is becoming ever more promising as a programming tool. Early partial evaluators depended over much on the source program being written in a particular style, and needed certain ad hoc optimisations to produce good results. The practice of partial evaluation is now fairly well developed but the theoretical underpinnings are not equally well understood. A partial evaluator takes a program, together with some of the input to the program, and produces a new program. This new, or residual, program is an optimised version of the old, having taken the input data into account. Work undertaken at DIKU in Copenhagen has shown the importance of prior analysis of the program. This binding-time analysis discovers which values within the program may bo computed during partial evaluation-called static values and which values may not the dynamic values. In this thesis we propose using domain projections in binding-time analysis. This allows a greater level of data separation than before because values are no longer treated atomically. In particular, we are able to pinpoint static values within data structures containing both static and dynamic parts. An interesting consequence of using domain projections is that we are able to demonstrate an intimate relationship between binding-time analysis and strictness analysis. Dependent sum and product are familiar from constructive type theory. We give a less familiar domain-theoretic definition and show how projections determine particular dependent sums. The practical application of this result is to generate residual functions whose types depend on the static values from which they wore produced. Certain optimising techniques, such as tag removal and arity raising, arise as a direct, consequence. We extend the use of projections to polymorphic programs, giving a practical application of developments in the theory of polymorphism. Polymorphic functions are regarded as natural transformations between appropriate functors. This leads to three benefits: polymorphic functions are analysed once and the result reused; the static input to polymorphic functions is described by polymorphic projections, which reduces the search space of the analysis; and polymorphic functions are specialised to polymorphic values, leading to polymorphic residual functions

Polyvariant Analysis of the Untyped Lambda Calculus

We present a polyvariant closure, safety, and binding time analysis for the untyped lambda calculus. The innovation is to analyze each abstraction afresh at all syntactic application points. This is achieved by a semantics-preserving program transformation followed by a novel monovariant analysis, expressed using type constraints. The constraints are solved in cubic time by a single fixed-point computation.Safety analysis is aimed at determining if a term will cause an error during evaluation. We have recently proved that the monovariant safety analysis accepts strictly more terms than simple type inference. This paper demonstrates that the polyvariant transformation makes even more terms acceptable, even some without higher-order polymorphic types. Furthermore, polyvariant binding time analysis can improve the partial evaluators that base a polyvariant specialization on only monovariant binding time analysis

In Silico Derivation of HLA-Specific Alloreactivity Potential from Whole Exome Sequencing of Stem Cell Transplant Donors and Recipients: Understanding the Quantitative Immuno-biology of Allogeneic Transplantation

Donor T cell mediated graft vs. host effects may result from the aggregate alloreactivity to minor histocompatibility antigens (mHA) presented by the HLA in each donor-recipient pair (DRP) undergoing stem cell transplantation (SCT). Whole exome sequencing has demonstrated extensive nucleotide sequence variation in HLA-matched DRP. Non-synonymous single nucleotide polymorphisms (nsSNPs) in the GVH direction (polymorphisms present in recipient and absent in donor) were identified in 4 HLA-matched related and 5 unrelated DRP. The nucleotide sequence flanking each SNP was obtained utilizing the ANNOVAR software package. All possible nonameric-peptides encoded by the non-synonymous SNP were then interrogated in-silico for their likelihood to be presented by the HLA class I molecules in individual DRP, using the Immune-Epitope Database (IEDB) SMM algorithm. The IEDB-SMM algorithm predicted a median 18,396 peptides/DRP which bound HLA with an IC50 of <500nM, and 2254 peptides/DRP with an IC50 of <50nM. Unrelated donors generally had higher numbers of peptides presented by the HLA. A similarly large library of presented peptides was identified when the data was interrogated using the Net MHCPan algorithm. These peptides were uniformly distributed in the various organ systems. The bioinformatic algorithm presented here demonstrates that there may be a high level of minor histocompatibility antigen variation in HLA-matched individuals, constituting an HLA-specific alloreactivity potential. These data provide a possible explanation for how relatively minor adjustments in GVHD prophylaxis yield relatively similar outcomes in HLA matched and mismatched SCT recipients.Comment: Abstract: 235, Words: 6422, Figures: 7, Tables: 3, Supplementary figures: 2, Supplementary tables:

Two polymorphisms facilitate differences in plasticity between two chicken major histocompatibility complex class I proteins

Major histocompatibility complex class I molecules (MHC I) present peptides to cytotoxic T-cells at the surface of almost all nucleated cells. The function of MHC I molecules is to select high affinity peptides from a large intracellular pool and they are assisted in this process by co-factor molecules, notably tapasin. In contrast to mammals, MHC homozygous chickens express a single MHC I gene locus, termed BF2, which is hypothesised to have co-evolved with the highly polymorphic tapasin within stable haplotypes. The BF2 molecules of the B15 and B19 haplotypes have recently been shown to differ in their interactions with tapasin and in their peptide selection properties. This study investigated whether these observations might be explained by differences in the protein plasticity that is encoded into the MHC I structure by primary sequence polymorphisms. Furthermore, we aimed to demonstrate the utility of a complimentary modelling approach to the understanding of complex experimental data. Combining mechanistic molecular dynamics simulations and the primary sequence based technique of statistical coupling analysis, we show how two of the eight polymorphisms between BF2*15:01 and BF2*19:01 facilitate differences in plasticity. We show that BF2*15:01 is intrinsically more plastic than BF2*19:01, exploring more conformations in the absence of peptide. We identify a protein sector of contiguous residues connecting the membrane bound ?3 domain and the heavy chain peptide binding site. This sector contains two of the eight polymorphic residues. One is residue 22 in the peptide binding domain and the other 220 is in the ?3 domain, a putative tapasin binding site. These observations are in correspondence with the experimentally observed functional differences of these molecules and suggest a mechanism for how modulation of MHC I plasticity by tapasin catalyses peptide selection allosterically

The TLR4 D299G and T399I SNPs Are Constitutively Active to Up-Regulate Expression of Trif-Dependent Genes

Peer reviewedPublisher PD

The long non-coding RNA Kcnq1ot1 controls maternal p57 expression in muscle cells by promoting H3K27me3 accumulation to an intragenic MyoD-binding region

BACKGROUND: The cell-cycle inhibitor p57kip2 plays a critical role in mammalian development by coordinating cell proliferation and differentiation in many cell types. p57kip2 expression is finely regulated by several epigenetic mechanisms, including paternal imprinting. Kcnq1ot1, a long non-coding RNA (LncRNA), whose gene maps to the p57Kip2 imprinting domain, is expressed exclusively from the paternal allele and participates in the cis-silencing of the neighboring imprinted genes through chromatin-level regulation. In light of our previous evidence of a functional interaction between myogenic factors and imprinting control elements in the regulation of the maternal p57Kip2 allele during muscle differentiation, we examined the possibility that also Kcnq1ot1 could play an imprinting-independent role in the control of p57Kip2 expression in muscle cells. RESULTS: We found that Kcnq1ot1 depletion by siRNA causes the upregulation of the maternal and functional p57Kip2 allele during differentiation, suggesting a previously undisclosed role for this LncRNA. Consistently, Chromatin Oligo-affinity Precipitation assays showed that Kcnq1ot1 physically interacts not only with the paternal imprinting control region of the locus, as already known, but also with both maternal and paternal alleles of a novel p57Kip2 regulatory region, located intragenically and containing two binding sites for the muscle-specific factor MyoD. Moreover, chromatin immunoprecipitation assays after Kcnq1ot1 depletion demonstrated that the LncRNA is required for the accumulation of H3K27me3, a chromatin modification catalyzed by the histone-methyl-transferase EZH2, at the maternal p57kip2 intragenic region. Finally, upon differentiation, the binding of MyoD to this region and its physical interaction with Kcnq1ot1, analyzed by ChIP and RNA immunoprecipitation assays, correlate with the loss of EZH2 and H3K27me3 from chromatin and with p57Kip2 de-repression. CONCLUSIONS: These findings highlight the existence of an imprinting-independent role of Kcnq1ot1, adding new insights into the biology of a still mysterious LncRNA. Moreover, they expand our knowledge about the molecular mechanisms underlying the tight and fine regulation of p57Kip2 during differentiation and, possibly, its aberrant silencing observed in several pathologic conditions

Koka: Programming with Row Polymorphic Effect Types

We propose a programming model where effects are treated in a disciplined way, and where the potential side-effects of a function are apparent in its type signature. The type and effect of expressions can also be inferred automatically, and we describe a polymorphic type inference system based on Hindley-Milner style inference. A novel feature is that we support polymorphic effects through row-polymorphism using duplicate labels. Moreover, we show that our effects are not just syntactic labels but have a deep semantic connection to the program. For example, if an expression can be typed without an exn effect, then it will never throw an unhandled exception. Similar to Haskell's `runST` we show how we can safely encapsulate stateful operations. Through the state effect, we can also safely combine state with let-polymorphism without needing either imperative type variables or a syntactic value restriction. Finally, our system is implemented fully in a new language called Koka and has been used successfully on various small to medium-sized sample programs ranging from a Markdown processor to a tier-splitted chat application. You can try out Koka live at www.rise4fun.com/koka/tutorial.Comment: In Proceedings MSFP 2014, arXiv:1406.153