Call-by-name, call-by-value, call-by-need and the linear lambda calculus

this paper is a minor refinement of one previously presented by Wadler [41,42], which is based on Girard's successor to linear logic, the Logic of Unity [15]. A similar calculus has been devised by Plotkin and Barber [6]. In many presentations of logic a key role is played by the structural rules: contraction provides the only way to duplicate an assumption, while weakening provides the only way to discard one. In linear logic [14], the presence of contraction or weakening is revealed in a formula by the presence of the `of course' connective, written `!'. The Logic of Unity [15] takes this separation one step further by distinguishing linear assumptions, which one cannot contract or weaken, from nonlinear or intuitionistic assumptions, which one can. Corresponding to Girard's first translation we define a mapping ffi from the call-byname to the linear calculus and show that this mapping is sound, in that M \Gamma\Gamma\Gamma\Gamma

Call-by-value non-determinism in a linear logic type discipline

We consider the call-by-value lambda-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent intersection types, we endow this calculus with a type system based on the so-called Girard's second translation of intuitionistic logic into linear logic. We prove that a term is typable if and only if it is converging, and that its typing tree carries enough information to give a bound on the length of its lazy call-by-value reduction. Moreover, when the typing tree is minimal, such a bound becomes the exact length of the reduction

Trapping malicious insiders in the SPDR web

Abstract The insider threat has assumed increasing importance as our dependence on critical cyber information infrastructure has increased. In this paper we describe an approach for thwarting and attributing insider attacks. The Sense, Prepare, Detect, and React (SPDR

Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order

Traditionally, reasoning about programs under varying evaluation regimes (call-by-value, call-by-name etc.) was done at the meta-level, treating them as term rewriting systems. Levy’s call-by-push-value (CBPV) calculus provides a more powerful approach for reasoning, by treating CBPV terms as a common intermediate language which captures both call-by-value and call-by-name, and by allowing equational reasoning about changes to evaluation order between or within programs. We extend CBPV to additionally deal with call-by-need, which is non-trivial because of shared reductions. This allows the equational reasoning to also support call-by-need. As an example, we then prove that call-by-need and call-by-name are equivalent if nontermination is the only side-effect in the source language. We then show how to incorporate an effect system. This enables us to exploit static knowledge of the potential effects of a given expression to augment equational reasoning; thus a program fragment might be invariant under change of evaluation regime only because of knowledge of its effects

Realizability Interpretation and Normalization of Typed Call-by-Need λ\lambda-calculus With Control

We define a variant of realizability where realizers are pairs of a term and a substitution. This variant allows us to prove the normalization of a simply-typed call-by-need \lambda$-$calculus with control due to Ariola et al. Indeed, in such call-by-need calculus, substitutions have to be delayed until knowing if an argument is really needed. In a second step, we extend the proof to a call-by-need \lambda$$-calculus equipped with a type system equivalent to classical second-order predicate logic, representing one step towards proving the normalization of the call-by-need classical second-order arithmetic introduced by the second author to provide a proof-as-program interpretation of the axiom of dependent choice

Dependently-Typed Formalisation of Typed Term Graphs

We employ the dependently-typed programming language Agda2 to explore formalisation of untyped and typed term graphs directly as set-based graph structures, via the gs-monoidal categories of Corradini and Gadducci, and as nested let-expressions using Pouillard and Pottier's NotSoFresh library of variable-binding abstractions.Comment: In Proceedings TERMGRAPH 2011, arXiv:1102.226

Voices Raised, Issue 06

Included in this issue: Immaculate Mary; Grants augment women’s research; Mentoring grows; Women’s Studies take root in the neighborhood; Solution-oriented VP to retire; Muslim students strive to educate, support; Don’t let stress ruin your holidays; Dining services dishes up more than you’d expect; Marianist Images Across Campus; Confronting Disrespect: We Owe it to Each Other.https://ecommons.udayton.edu/wc_newsletter/1005/thumbnail.jp

Acute ingestion of red wine by men activates platelets but does not influence endothelial markers: no effect of white wine

Long-term moderate alcohol use is associated with a better cardiovascular risk profile than total abstinence, although the short-term effect of a bolus of alcohol is unclear. The hypothesis tested in this study was that an acute bolus of alcohol would adversely affect the endothelium and platelets. Blood was taken before and 4 It after the ingestion of red or white wine by nine volunteers per group, and by 11 control water-only drinkers at the same time points. Plasma was obtained and markers of platelet activity (beta-thromboglobulin and soluble P selectin) and endothelial cell function (von Willebrand factor and soluble thrombomodulin) measured by enzyme-linked immunosorbent assay. The only marker to change significantly was beta-thromboglobulin, which increased from a median of 10 ng/ml (interquartile range, 8.5-15) before drinking red wine to 16 ng/ml (interquartile range, 14-20) 4 h later (P = 0.0067). We conclude that an acute bolus of red wine, but not white wine, activates platelets but has no substantial effect on the endothelium. (C) 2002 Lippincott Williams Wilkins