A Compositional Treatment of Polysemous Arguments in Categorial Grammar

We discuss an extension of the standard logical rules (functional application and abstraction) in Categorial Grammar (CG), in order to deal with some specific cases of polysemy. We borrow from Generative Lexicon theory which proposes the mechanism of {\em coercion}, next to a rich nominal lexical semantic structure called {\em qualia structure}. In a previous paper we introduced coercion into the framework of {\em sign-based} Categorial Grammar and investigated its impact on traditional Fregean compositionality. In this paper we will elaborate on this idea, mostly working towards the introduction of a new semantic dimension. Where in current versions of sign-based Categorial Grammar only two representations are derived: a prosodic one (form) and a logical one (modelling), here we introduce also a more detaled representation of the lexical semantics. This extra knowledge will serve to account for linguistic phenomena like {\em metonymy\/}.Comment: LaTeX file, 19 pages, uses pubsmacs, pubsbib, pubsarticle, leqn

Light Logics and the Call-by-Value Lambda Calculus

The so-called light logics have been introduced as logical systems enjoying quite remarkable normalization properties. Designing a type assignment system for pure lambda calculus from these logics, however, is problematic. In this paper we show that shifting from usual call-by-name to call-by-value lambda calculus allows regaining strong connections with the underlying logic. This will be done in the context of Elementary Affine Logic (EAL), designing a type system in natural deduction style assigning EAL formulae to lambda terms.Comment: 28 page

Model-Driven Engineering for Big Data

Accessing heterogeneous and huge amount of data through different sources heavily impacts users of data nowadays worldwide. Thus, Big Data has now become a hot emerging paradigm in computing environments. Issues in scalability, interoperability, platform independency, adaptability and reusability in big data systems are considered the main current challenges. This raises the need for appropriate software engineering approaches to develop effective and efficient Big Data system models, i.e. an approach which reduce investment cost and development time. Today, software engineering has emerged advanced methodologies to solve problems from different perspectives, while still further research is needed to overcome new challenges raised in emerging technologies, i.e. Big Data. Thus, the author believe model-driven engineering technique is the appropriate approach to alleviate complexities in modeling Big Data system

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

Resource utilization and outcome at a university versus a community teaching hospital in tPA treated stroke patients: a retrospective cohort study

<p>Abstract</p> <p>Background</p> <p>Comparing patterns of resource utilization between hospitals is often complicated by biases in community and patient populations. Stroke patients treated with tissue plasminogen activator (tPA) provide a particularly homogenous population for comparison because of strict eligibility criteria for treatment. We tested whether resource utilization would be similar in this homogenous population between two hospitals located in a single Midwestern US community by comparing use of diagnostic testing and associated outcomes following treatment with t-PA.</p> <p>Methods</p> <p>Medical records from 206 consecutive intravenous t-PA-treated stroke patients from two teaching hospitals (one university, one community-based) were reviewed. Patient demographics, clinical characteristics and outcome were analyzed, as were the frequency of use of CT, MRI, MRA, echocardiography, angiography, and EEG.</p> <p>Results</p> <p>Seventy-nine and 127 stroke patients received t-PA at the university and community hospitals, respectively. The two patient populations were demographically similar. There were no differences in stroke severity. All outcomes were similar at both hospitals. Utilization of CT scans, and non-invasive carotid and cardiac imaging studies were similar at both hospitals; however, brain MR, TEE, and catheter angiography were used more frequently at the university hospital. EEG was obtained more often at the community hospital.</p> <p>Conclusions</p> <p>Utilization of advanced brain imaging and invasive diagnostic testing was greater at the university hospital, but was not associated with improved clinical outcomes. This could not be explained on the basis of stroke severity or patient characteristics. This variation of practice suggests substantial opportunities exist to reduce costs and improve efficiency of diagnostic resource use as well as reduce patient exposure to risk from diagnostic procedures.</p

Note on Algol and Conservatively Extending Functional Programming

A simple Idealized Algol is considered, based on Reynolds\u27s essence of Algol. It is shown that observational equivalence in this language conservatively extends observational equivalence in its assignment-free functional sublanguage