19 research outputs found

    TWAM: A Certifying Abstract Machine for Logic Programs

    Full text link
    Type-preserving (or typed) compilation uses typing derivations to certify correctness properties of compilation. We have designed and implemented a type-preserving compiler for a simply-typed dialect of Prolog we call T-Prolog. The crux of our approach is a new certifying abstract machine which we call the Typed Warren Abstract Machine (TWAM). The TWAM has a dependent type system strong enough to specify the semantics of a logic program in the logical framework LF. We present a soundness metatheorem which constitutes a partial correctness guarantee: well-typed programs implement the logic program specified by their type. This metatheorem justifies our design and implementation of a certifying compiler from T-Prolog to TWAM.Comment: 41 pages, under submission to ACM Transactions on Computational Logi

    On the relative expressiveness of higher-order session processes

    Get PDF
    By integrating constructs from the λ-calculus and the π-calculus, in higher-order process calculi exchanged values may contain processes. This paper studies the relative expressiveness of HOπ, the higher-order π-calculus in which communications are governed by session types. Our main discovery is that HO, a subcalculus of HOπ which lacks name-passing and recursion, can serve as a new core calculus for session-typed higher-order concurrency. By exploring a new bisimulation for HO, we show that HO can encode HOπ fully abstractly (up to typed contextual equivalence) more precisely and efficiently than the first-order session π-calculus (π). Overall, under session types, HOπ, HO, and π are equally expressive; however, HOπ and HO are more tightly related than HOπ and π

    Biologic Material Hierarchy

    No full text

    Glutamatergic neurotransmission in alcoholism

    No full text

    Ethanol and the NMDA Receptor: Implications for Intoxication, Tolerance, Dependence, and Alcoholic Brain Damage

    No full text

    Regulation of neuronal GABA(B) receptor functions by subunit composition

    No full text
    GABA(B) receptors (GABA(B)Rs) are G protein-coupled receptors for GABA, the main inhibitory neurotransmitter in the CNS. In the past 5 years, notable advances have been made in our understanding of the molecular composition of these receptors. GABA(B)Rs are now known to comprise principal and auxiliary subunits that influence receptor properties in distinct ways. The principal subunits regulate the surface expression and the axonal versus dendritic distribution of these receptors, whereas the auxiliary subunits determine agonist potency and the kinetics of the receptor response. This Review summarizes current knowledge on how the subunit composition of GABA(B)Rs affects the distribution of these receptors, neuronal processes and higher brain functions
    corecore