Lewis meets Brouwer: constructive strict implication

C. I. Lewis invented modern modal logic as a theory of "strict implication". Over the classical propositional calculus one can as well work with the unary box connective. Intuitionistically, however, the strict implication has greater expressive power than the box and allows to make distinctions invisible in the ordinary syntax. In particular, the logic determined by the most popular semantics of intuitionistic K becomes a proper extension of the minimal normal logic of the binary connective. Even an extension of this minimal logic with the "strength" axiom, classically near-trivial, preserves the distinction between the binary and the unary setting. In fact, this distinction and the strong constructive strict implication itself has been also discovered by the functional programming community in their study of "arrows" as contrasted with "idioms". Our particular focus is on arithmetical interpretations of the intuitionistic strict implication in terms of preservativity in extensions of Heyting's Arithmetic.Comment: Our invited contribution to the collection "L.E.J. Brouwer, 50 years later

Innovation in incapacity: education, technique, subject

Abstract This essay addresses the question of change as it is expressed in debates on the introduction and use of new digital technologies in contemporary education. It sets out some of the terms of this debate, concerning MOOCs in particular, and puts into question the very conception of change they presume. The essay advocates a distinction between education, which marks the subjective capacity of all for thought, and pedagogy, which, the essay argues, teaches subjective incapacity for all. The case is made that without a formal conception of change MOOCs will only strengthen the contemporary pedagogical project of difference as repetition. In conclusion, the essay attempts to sketch a conception of real change such that a new orientation to the debate is proposed

The Two Faces of Collaboration: Impacts of University-Industry Relations on Public Research

We analyze the impact of university-industry relationships on public research. Our inductive study of university-industry collaboration in engineering suggests that basic projects are more likely to yield academically valuable knowledge than applied projects. However, applied projects show higher degrees of partner interdependence and therefore enable exploratory learning by academics, leading to new ideas and projects. This result holds especially for research-oriented academics working in the ‘sciences of the artificial’ and engaging in multiple relationships with industry. Our learning-centred interpretation qualifies the notion of entrepreneurial science as a driver of applied university-industry collaboration. We conclude with implications for science and technology policy.University industry relations; Collaborative research; Contract research; Academic consulting; Science technology links; Engineering

Jeeg: Temporal Constraints for the Synchronization of Concurrent Objects

We introduce Jeeg, a dialect of Java based on a declarative replacement of the synchronization mechanisms of Java that results in a complete decoupling of the 'business' and the 'synchronization' code of classes. Synchronization constraints in Jeeg are expressed in a linear temporal logic which allows to effectively limit the occurrence of the inheritance anomaly that commonly affects concurrent object oriented languages. Jeeg is inspired by the current trend in aspect oriented languages. In a Jeeg program the sequential and concurrent aspects of object behaviors are decoupled: specified separately by the programmer these are then weaved together by the Jeeg compiler

DiLogics: Creating Web Automation Programs With Diverse Logics

Knowledge workers frequently encounter repetitive web data entry tasks, like updating records or placing orders. Web automation increases productivity, but translating tasks to web actions accurately and extending to new specifications is challenging. Existing tools can automate tasks that perform the same logical trace of UI actions (e.g., input text in each field in order), but do not support tasks requiring different executions based on varied input conditions. We present DiLogics, a programming-by-demonstration system that utilizes NLP to assist users in creating web automation programs that handle diverse specifications. DiLogics first semantically segments input data to structured task steps. By recording user demonstrations for each step, DiLogics generalizes the web macros to novel but semantically similar task requirements. Our evaluation showed that non-experts can effectively use DiLogics to create automation programs that fulfill diverse input instructions. DiLogics provides an efficient, intuitive, and expressive method for developing web automation programs satisfying diverse specifications

Generation and evaluation of business continuity processes using algebraic graph transformation and the mCRL2 process algebra

Critical business processes can fail. Therefore, continuity processes are needed as back-up solutions. Today, those continuity processes are set up and maintained manually. They are mostly based on best practices that focus on specific continuity scenarios, Nevertheless, failures can occur in new and unforeseen combinations. As a consequence, a given business continuity plan needs to handle such situations as well. For this purpose, we present a technique for the generation and validation of the universe of continuity processes given a critical business process at Credit Suisse. The presented approach uses a combination of formal methods in the area of algebraic graph transformation and process algebra encompassing modal logic. The overall approach prepares for a sound evaluation of the effectiveness and efficiency of such plans. It uses formal tools, not standard software engineering solutions, to benefit from formal guarantees that facilitate the implementation of local and global security requirements. Keywords: business continuity, business process, algebraic graph transformation, process algebra, generation, evaluation, enterprise modelin