First Class Call Stacks: Exploring Head Reduction

Weak-head normalization is inconsistent with functional extensionality in the call-by-name $\lambda$-calculus. We explore this problem from a new angle via the conflict between extensionality and effects. Leveraging ideas from work on the $\lambda$-calculus with control, we derive and justify alternative operational semantics and a sequence of abstract machines for performing head reduction. Head reduction avoids the problems with weak-head reduction and extensionality, while our operational semantics and associated abstract machines show us how to retain weak-head reduction's ease of implementation.Comment: In Proceedings WoC 2015, arXiv:1606.0583

Towards Correctness of Program Transformations Through Unification and Critical Pair Computation

Correctness of program transformations in extended lambda calculi with a contextual semantics is usually based on reasoning about the operational semantics which is a rewrite semantics. A successful approach to proving correctness is the combination of a context lemma with the computation of overlaps between program transformations and the reduction rules, and then of so-called complete sets of diagrams. The method is similar to the computation of critical pairs for the completion of term rewriting systems. We explore cases where the computation of these overlaps can be done in a first order way by variants of critical pair computation that use unification algorithms. As a case study we apply the method to a lambda calculus with recursive let-expressions and describe an effective unification algorithm to determine all overlaps of a set of transformations with all reduction rules. The unification algorithm employs many-sorted terms, the equational theory of left-commutativity modelling multi-sets, context variables of different kinds and a mechanism for compactly representing binding chains in recursive let-expressions.Comment: In Proceedings UNIF 2010, arXiv:1012.455

Developement of real time diagnostics and feedback algorithms for JET in view of the next step

Real time control of many plasma parameters will be an essential aspect in the development of reliable high performance operation of Next Step Tokamaks. The main prerequisites for any feedback scheme are the precise real-time determination of the quantities to be controlled, requiring top quality and highly reliable diagnostics, and the availability of robust control algorithms. A new set of real time diagnostics was recently implemented on JET to prove the feasibility of determining, with high accuracy and time resolution, the most important plasma quantities. With regard to feedback algorithms, new model–based controllers were developed to allow a more robust control of several plasma parameters. Both diagnostics and algorithms were successfully used in several experiments, ranging from H-mode plasmas to configuration with ITBs. Since elaboration of computationally heavy measurements is often required, significant attention was devoted to non-algorithmic methods like Digital or Cellular Neural/Nonlinear Networks. The real time hardware and software adopted architectures are also described with particular attention to their relevance to ITER.Comment: 12th International Congress on Plasma Physics, 25-29 October 2004, Nice (France

On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control

International audienceWe construct a partially-ordered hierarchy of delimited control operators similar to those of the CPS hierarchy of Danvy and Filinski. However, instead of relying on nested CPS translations, these operators are directly interpreted in linear logic extended with subexponentials (i.e., multiple pairs of ! and ?). We construct an independent proof theory for a fragment of this logic based on the principle of focusing. It is then shown that the new constraints placed on the permutation of cuts correspond to multiple levels of delimited control

The Contribution of National Spontaneous Reporting Systems to Detect Signals of Torsadogenicity: Issues Emerging from the ARITMO Project

Introduction: Spontaneous reporting systems (SRSs) are pivotal for signal detection, especially for rare events with a high drug-attributable component, such as torsade de pointes (TdP). Use of different national SRSs is rarely attempted because of inherent difficulties, but should be considered on the assumption that rare events are diluted in international databases. Objective: The aim was to describe TdP-related events associated with antipsychotics, H1-antihistamines and anti-infectives in three national SRSs (in Italy, Germany and France) and highlight potential signals of torsadogenicity through a combined literature evaluation. Methods: A common search strategy was applied to extract TdP-related events: (1) TdP, (2) QT interval abnormalities, (3) ventricular fibrillation/tachycardia, and (4) sudden cardiac death. Signals of disproportionate reporting (SDRs) were calculated for TdP + QT interval abnormalities and defined by a lower limit of the 95 % confidence interval of the reporting odds ratio (ROR) >1. Among SDRs with at least three cases without concomitant pro-arrhythmic drugs, we defined potential new signal of torsadogenicity as drugs with no published evidence from (a) the crediblemeds® website (http://www.crediblemeds.com, as of November 1st, 2014); (b) studies on the FDA Adverse Event Reporting System (FAERS); and (c) safety trials or pharmaco-epidemiological studies (as of December 16th, 2014). Results: Overall, 3505 cases were retrieved (1372, 1468, and 801 for France, Germany and Italy, respectively). Antipsychotics were mainly recorded in Germany (792 cases), whereas antibiotics peaked at 515 and 491 (France and Italy, respectively). Forty-one drugs met criteria for SDRs in at least one single source, of which 31 were detected only from one single SRS: 18, ten and three (French, German and Italian SRS, respectively). By contrast, only five SDRs were detected in all national data sources (amisulpride, aripiprazole, haloperidol, olanzapine, risperidone). Overall, five potential new signals of torsadogenicity were identified: flupentixol, ganciclovir, levocetirizine, oxatomide and tiapride. Conclusions: We found differences across and within national SRSs in the reporting of drug-induced TdP, which finally resulted in five potential new signals of torsadogenicity. These findings warrant targeted pharmacovigilance studies to formally assess the existence of actual drug–event associations

Overview of progress in European medium sized tokamaks towards an integrated plasma-edge/wall solution

Integrating the plasma core performance with an edge and scrape-off layer (SOL) that leads to tolerable heat and particle loads on the wall is a major challenge. The new European medium size tokamak task force (EU-MST) coordinates research on ASDEX Upgrade (AUG), MAST and TCV. This multi-machine approach within EU-MST, covering a wide parameter range, is instrumental to progress in the field, as ITER and DEMO core/pedestal and SOL parameters are not achievable simultaneously in present day devices. A two prong approach is adopted. On the one hand, scenarios with tolerable transient heat and particle loads, including active edge localised mode (ELM) control are developed. On the other hand, divertor solutions including advanced magnetic configurations are studied. Considerable progress has been made on both approaches, in particular in the fields of: ELM control with resonant magnetic perturbations (RMP), small ELM regimes, detachment onset and control, as well as filamentary scrape-off-layer transport. For example full ELM suppression has now been achieved on AUG at low collisionality with n  =  2 RMP maintaining good confinement HH(98,y2)≈0.95. Advances have been made with respect to detachment onset and control. Studies in advanced divertor configurations (Snowflake, Super-X and X-point target divertor) shed new light on SOL physics. Cross field filamentary transport has been characterised in a wide parameter regime on AUG, MAST and TCV progressing the theoretical and experimental understanding crucial for predicting first wall loads in ITER and DEMO. Conditions in the SOL also play a crucial role for ELM stability and access to small ELM regimes.Integrating the plasma core performance with an edge and scrape-off layer (SOL) that leads to tolerable heat and particle loads on the wall is a major challenge. The new European medium size tokamak task force (EU-MST) coordinates research on ASDEX Upgrade (AUG), MAST and TCV. This multi-machine approach within EU-MST, covering a wide parameter range, is instrumental to progress in the field, as ITER and DEMO core/pedestal and SOL parameters are not achievable simultaneously in present day devices. A two prong approach is adopted. On the one hand, scenarios with tolerable transient heat and particle loads, including active edge localised mode (ELM) control are developed. On the other hand, divertor solutions including advanced magnetic configurations are studied. Considerable progress has been made on both approaches, in particular in the fields of: ELM control with resonant magnetic perturbations (RMP), small ELM regimes, detachment onset and control, as well as filamentary scrape-off-layer transport. For example full ELM suppression has now been achieved on AUG at low collisionality with n = 2 RMP maintaining good confinement H-H(98,H-y2) approximate to 0.95. Advances have been made with respect to detachment onset and control. Studies in advanced divertor configurations (Snowflake, Super-X and X-point target divertor) shed new light on SOL physics. Cross field filamentary transport has been characterised in a wide parameter regime on AUG, MAST and TCV progressing the theoretical and experimental understanding crucial for predicting first wall loads in ITER and DEMO. Conditions in the SOL also play a crucial role for ELM stability and access to small ELM regimes.Peer reviewe

Beyond Polarity: Towards a Multi-Discipline Intermediate Language with Sharing

The study of polarity in computation has revealed that an "ideal" programming language combines both call-by-value and call-by-name evaluation; the two calling conventions are each ideal for half the types in a programming language. But this binary choice leaves out call-by-need which is used in practice to implement lazy-by-default languages like Haskell. We show how the notion of polarity can be extended beyond the value/name dichotomy to include call-by-need by only adding a mechanism for sharing and the extra polarity shifts to connect them, which is enough to compile a Haskell-like functional language with user-defined types

Compiling With Classical Connectives

The study of polarity in computation has revealed that an "ideal" programming language combines both call-by-value and call-by-name evaluation; the two calling conventions are each ideal for half the types in a programming language. But this binary choice leaves out call-by-need which is used in practice to implement lazy-by-default languages like Haskell. We show how the notion of polarity can be extended beyond the value/name dichotomy to include call-by-need by adding a mechanism for sharing which is enough to compile a Haskell-like functional language with user-defined types. The key to capturing sharing in this mixed-evaluation setting is to generalize the usual notion of polarity "shifts:" rather than just two shifts (between positive and negative) we have a family of four dual shifts. We expand on this idea of logical duality -- "and" is dual to "or;" proof is dual to refutation -- for the purpose of compiling a variety of types. Based on a general notion of data and codata, we show how classical connectives can be used to encode a wide range of built-in and user-defined types. In contrast with an intuitionistic logic corresponding to pure functional programming, these classical connectives bring more of the pleasant symmetries of classical logic to the computationally-relevant, constructive setting. In particular, an involutive pair of negations bridges the gulf between the wide-spread notions of parametric polymorphism and abstract data types in programming languages. To complete the study of duality in compilation, we also consider the dual to call-by-need evaluation, which shares the computation within the control flow of a program instead of computation within the information flow