Ray Strachey ARC1983 -010 - Finding Aid

https://place.asburyseminary.edu/findingaids/1039/thumbnail.jp

Writing about age, birthdays and the passage of time

How do we experience ageing, how do we interpret changes in our lives and what do we say about the passage of time? The aim of this paper is to present longitudinal evidence about the personal and social significance of birthdays in adult life and, in particular, how birthdays contribute to a sense of ageing. The primary source of data is the Mass-Observation Archive at the University of Sussex. Members of its panel of 'ordinary' people living in the United Kingdom were in 1990 invited to write anonymously about celebrations, and in 2002 they were invited to write more specifically on the topic of birthdays. A total of 120 accepted both invitations and 55 included accounts of their last birthday in both submissions. As a consequence, it is possible to compare what they wrote on the two occasions and how this reflects their unfolding experience and changing feelings about age. The analysis reveals the personal salience of the date of a birthday and of continuity in how birthdays are celebrated. Who remembers birthdays and who participates in their celebration reflect the generational structure of families and age-related patterns of friendship. Birthdays are used to celebrate collective continuity more than individual change

Enhancing Semantic Bidirectionalization via Shape Bidirectionalizer Plug-ins

Matsuda et al. (2007) and Voigtlander (2009) have introduced two techniques that given a source-to-view function provide an update propagation function mapping an original source and an updated view back to an updated source, subject to standard consistency conditions. Previously, we developed a synthesis of the two techniques, based on a separation of shape and content aspects (Voigtlander et al. 2010). Here, we carry that idea further, reworking the technique of Voigtlander such that any shape bidirectionalizer (based on the work of Matsuda et al. or not) can be used as a plug-in, to good effect. We also provide a data-type-generic account, enabling wider reuse, including the use of pluggable bidirectionalization itself as a plug-in

Java and scala's type systems are unsound: the existential crisis of null pointers

We present short programs that demonstrate the unsoundness of Java and Scala's current type systems. In particular, these programs provide parametrically polymorphic functions that can turn any type into any type without (down) casting. Fortunately, parametric polymorphism was not integrated into the Java Virtual Machine (JVM), so these examples do not demonstrate any unsoundness of the JVM. Nonetheless, we discuss broader implications of these findings on the field of programming languages

Orthogonal parallel processing in vector pascal

Despite the widespread adoption of parallel operations in contemporary CPU designs, their use has been restricted by a lack of appropriate programming language abstractions and development environments. To fully exploit the SIMD model of computation such operations offer, programmers depend on CPU specific machine code or implementation dependent libraries. Vector Pascal is a language designed to enable the elegant and efficient expression of SIMD algorithms. It imports into Pascal abstraction mechanisms derived from functional languages, in turn having their origins in APL. In particular, it extends all operators to work on vectors of data. The type system is also extended to handle pixels and dimensional analysis. Code generation is via the ILCG system that allows retargeting to multiple different SIMD instruction sets based on formalised descriptions of the instruction set semantics

An Introduction to Natural Computation,

ABSTRACT Coherence Spaces were defined by J. Y. Girard in Coherence Spaces are a special subcategory of Scott domains [4] having a strictly finitary structure. The objects are constructed over a set of tokens (basic elements) where a coherence (reflexive and symmetric) relation is defined. The order of information is the set inclusion relation. In this work, we introduce the Probabilistic Coherence Spaces by associating probabilistic values with the objects of coherence spaces. As a result we get a notion of partial probability associated with the partial objects of the probabilistic coherence spaces. It is possible to adopt a vector notation, introducing the Vector Coherence Spaces, so that Probabilistic Coherence Spaces can be used to represent state spaces of probabilistic processes. Since such states represent partial probabilities, computation with such states produces probabilistic approximation processes whose limits are the conventional probabilistic processes. We also study linear functions on probabilistic coherence spaces to represent those probabilistic approximation processes and conventional probabilistic limits. The aim to recast in terms of the special structure of Vector Coherence Spaces the fundamental notions of probabilistic and quantum computing One immediate application of the work is in the construction of a domain of Markov models [1] with partial probabilities

Online partial evaluation of sheet-defined functions

We present a spreadsheet implementation, extended with sheet-defined functions, that allows users to define functions using only standard spreadsheet concepts such as cells, formulas and references, requiring no new syntax. This implements an idea proposed by Peyton-Jones and others. As the main contribution of this paper, we then show how to add an online partial evaluator for such sheet-defined functions. The result is a higher-order functional language that is dynamically typed, in keeping with spreadsheet traditions, and an interactive platform for function definition and function specialization. We describe an implementation of these ideas, present some performance data from microbenchmarks, and outline desirable improvements and extensions.Comment: In Proceedings Festschrift for Dave Schmidt, arXiv:1309.455