In [6, p. 317] Curry described a formal system assigning types to terms of the type-free λ-calculus. In [11] Scott gave a natural semantics for this type assignment and asked whether a completeness result holds.Inspired by [4] and [5] we extend the syntax and semantics of the Curry types in such a way that filters in the resulting type structure form a domain in the sense of Scott [12]. We will show that it is possible to turn the domain of types into a λ-model, among other reasons because all λ-terms possess a type. This model gives the completeness result for the extended system. By a conservativity result the completeness for Curry's system follows.Independently Hindley [8], [9] has proved both completeness results using term models. His method of proof is in some sense dual to ours.For λ-calculus notation see [1].

The study findings suggest that MBCT is as effective for patients with recurrent depression who are currently depressed as for patients who are in remission. Directions towards a better understanding of the mechanisms of action of MBCT are given, although future research is needed to support these hypotheses.

In this study, attentional processing in relation to mindfulness meditation was investigated. Since recent studies have suggested that mindfulness meditation may induce improvements in attentional processing, we have tested 20 expert mindfulness meditators in the attention network test. Their performance was compared to that of 20 age- and gender-matched controls. In addition to attentional network analyses, overall attentional processing was analysed by means of efficiency scores (i.e., accuracy controlled for reaction time). Better orienting and executive attention (reflected by smaller differences in either reaction time or error score, respectively) were observed in the mindfulness meditation group. Furthermore, extensive mindfulness meditation appeared to be related to a reduction of the fraction of errors for responses with the same reaction time. These results provide new insights into differences in attentional processing related to mindfulness meditation and suggest the possibility of increasing the efficiency in attentional processing by extensive mental training.

No abstract

No abstract

The cerebrospinal fluid (CSF) system provides nutrients to and removes waste products from the brain. Recent findings suggest, however, that in addition, the CSF contains message molecules in the form of actively released neuroactive substances. The concentrations of these vary between locations, suggesting they are important for the changes in brain activity that underlie different brain states, and induce different sensory input and behavioral output relationships.The cranial CSF displays a rapid caudally-directed ventricular flow followed by a slower rostrally-directed subarachnoid flow (mainly towards the cribriform plate and from there into the nasal lymphatics). Thus, many brain areas are exposed to and can be influenced by substances contained in the CSF. In this review we discuss the production and flow of the CSF, including the mechanisms involved in the regulation of its composition. In addition, the available evidence for the release of neuropeptides and other neuroactive substances into the CSF is reviewed, with particular attention to the selective effects of these on distant downstream receptive brain areas. As a conclusion we suggest that (1) the flowing CSF is involved in more than just nutrient and waste control, but is also used as a broadcasting system consisting of coordinated messages to a variety of nearby and distant brain areas; (2) this special form of volume transmission underlies changes in behavioral states.

This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), used in designing and verifying IT products and mathematical proofs. In this book, the authors focus on three classes of typing for lambda terms: simple types, recursive types and intersection types. It is in these three formalisms of terms and types that the unexpected mathematical beauty is revealed. The treatment is authoritative and comprehensive, complemented by an exhaustive bibliography, and numerous exercises are provided to deepen the readers' understanding and increase their confidence using types.

No abstract