Refocusing generalised normalisation

When defined with general elimination/application rules, natural deduction and $\lambda$-calculus become closer to sequent calculus. In order to get real isomorphism, normalisation has to be defined in a ``multiary'' variant, in which reduction rules are necessarily non-local (reason: nomalisation, like cut-elimination, acts at the \emph{head} of applicative terms, but natural deduction focuses at the \emph{tail} of such terms). Non-local rules are bad, for instance, for the mechanization of the system. A solution is to extend natural deduction even further to a \emph{unified calculus} based on the unification of cut and general elimination. In the unified calculus, a sequent term behaves like in the sequent calculus, whereas the reduction steps of a natural deduction term are interleaved with explicit steps for bringing heads to focus. A variant of the calculus has the symmetric role of improving sequent calculus in dealing with tail-active permutative conversions

Virtual zero gravity impact on internal gravity model

This project investigates the impact of a virtual zero gravity experience on the human gravity model. In the planned experiment, subjects are immersed with HMD and full body motion capture in a virtual world exhibiting either normal gravity or the apparent absence of gravity (i.e. body and objects floating in space). The study evaluates changes in the subjects' gravity model by observing changes on motor planning of actions dependent on gravity. Our goal is to demonstrate that a virtual reality exposure can induce some modifications to the humans internal gravity model, analogous to those resulting from real exposure (e.g. parabolic flights), even if users remain under normal gravity condition in reality

Forcing-based cut-elimination for Gentzen-style intuitionistic sequent calculus

International audienceWe give a simple intuitionistic completeness proof of Kripke semantics for intuitionistic logic with implication and universal quantification with respect to cut-free intuitionistic sequent calculus. The Kripke semantics is ``simplified'' in the way that the domain remains constant. The proof has been formalised in the Coq proof assistant and by combining soundness with completeness, we obtain an executable cut-elimination procedure. The proof easily extends to the case of the absurdity connective using Kripke models with exploding nodes à la Veldman

A calibration method for broad-bandwidth cavity enhanced absorption spectroscopy performed with supercontinuum radiation

An efficient calibration method has been developed for broad-bandwidth cavity enhanced absorption spectroscopy. The calibration is performed using phase shift cavity ring-down spectroscopy, which is conveniently implemented through use of an acousto-optic tunable filter (AOTF). The AOTF permits a narrowband portion of the SC spectrum to be scanned over the full high-reflectivity bandwidth of the cavity mirrors. After calibration the AOTF is switched off and broad-bandwidth CEAS can be performed with the same light source without any loss of alignment to the set-up. We demonstrate the merits of the method by probing transitions of oxygen molecules O-2 and collisional pairs of oxygen molecules (O-2)(2) in the visible spectral range

Characterising strongly normalising intuitionistic sequent terms

This paper gives a characterisation, via intersection types, of the strongly normalising terms of an intuitionistic sequent calculus (where LJ easily embeds). The soundness of the typing system is reduced to that of a well known typing system with intersection types for the ordinary lambda-calculus. The completeness of the typing system is obtained from subject expansion at root position. This paper's sequent term calculus integrates smoothly the lambda-terms with generalised application or explicit substitution. Strong normalisability of these terms as sequent terms characterises their typeability in certain "natural'' typing systems with intersection types. The latter are in the natural deduction format, like systems previously studied by Matthes and Lengrand et al., except that they do not contain any extra, exceptional rules for typing generalised applications or substitution

The duality of computation

http://www.acm.orgInternational audienceWe present the lambda-bar-mu-mu-tilde-calculus, a syntax for lambda-calculus + control operators exhibiting symmetries such as program/context and call-by-name/call-by-value. This calculus is derived from implicational Gentzen's sequent calculus LK, a key classical logical system in proof theory. Under the Curry-Howard correspondence between proofs and programs, we can see LK, or more precisely a formulation called LK-mu-mu-tilde, as a syntax-directed system of simple types for lambda-bar-mu-mu-tilde-calculus. For lambda-bar-mu-mu-tilde-calculus, choosing a call-by-name or call-by-value discipline for reduction amounts to choosing one of the two possible symmetric orientations of a critical pair. Our analysis leads us to revisit the question of what is a natural syntax for call-by-value functional computation. We define a translation of lambda-mu-calculus into lambda-bar-mu-mu-tilde-calculus and two dual translations back to lambda-calculus, and we recover known CPS translations by composing these translations

Towards a canonical classical natural deduction system

This paper studies a new classical natural deduction system, presented as a typed calculus named \lml. It is designed to be isomorphic to Curien-Herbelin's calculus, both at the level of proofs and reduction, and the isomorphism is based on the correct correspondence between cut (resp. left-introduction) in sequent calculus, and substitution (resp. elimination) in natural deduction. It is a combination of Parigot's $\lambda\mu$-calculus with the idea of ``coercion calculus'' due to Cervesato-Pfenning, accommodating let-expressions in a surprising way: they expand Parigot's syntactic class of named terms. This calculus aims to be the simultaneous answer to three problems. The first problem is the lack of a canonical natural deduction system for classical logic. \lml is not yet another classical calculus, but rather a canonical reflection in natural deduction of the impeccable treatment of classical logic by sequent calculus. The second problem is the lack of a formalization of the usual semantics of Curien-Herbelin's calculus, that explains co-terms and cuts as, respectively, contexts and hole-filling instructions. The mentioned isomorphism is the required formalization, based on the precise notions of context and hole-expression offered by \lml. The third problem is the lack of a robust process of ``read-back'' into natural deduction syntax of calculi in the sequent calculus format, that affects mainly the recent proof-theoretic efforts of derivation of $\lambda$-calculi for call-by-value. An isomorphic counterpart to the $Q$-subsystem of Curien-Herbelin's-calculus is derived, obtaining a new $\lambda$-calculus for call-by-value, combining control and let-expressions.Fundação para a Ciência e a Tecnologia (FCT

Forcing-based cut-elimination for Gentzen-style intuitionistic sequent calculus

International audienceWe give a simple intuitionistic completeness proof of Kripke semantics for intuitionistic logic with implication and universal quantification with respect to cut-free intuitionistic sequent calculus. The Kripke semantics is ``simplified'' in the way that the domain remains constant. The proof has been formalised in the Coq proof assistant and by combining soundness with completeness, we obtain an executable cut-elimination procedure. The proof easily extends to the case of the absurdity connective using Kripke models with exploding nodes à la Veldman

Targeting Protein Homeostasis in Sporadic Inclusion Body Myositis

Sporadic inclusion body myositis (sIBM) is the commonest severe myopathy in patients over age 50. Previous therapeutic trials have targeted the inflammatory features of sIBM, but all have failed. Since protein dyshomeostasis may also play a role in sIBM, we tested the effects of targeting this feature of the disease. Using rat myoblast cultures, we found that up-regulation of the heat shock response with Arimoclomol reduced key pathological markers of sIBM in vitro. Furthermore, in mutant valosin-containing protein VCP mice, which develop an inclusion body myopathy (IBM), treatment with Arimoclomol ameliorated disease pathology and improved muscle function. We therefore evaluated the safety and tolerability of Arimoclomol in an investigator-lead, randomised, double-blind, placebo-controlled, proof-of-concept patient trial and gathered exploratory efficacy data which showed that Arimoclomol was safe and well tolerated. Although Arimoclomol improved some IBM-like pathology in vitro and in vivo in the mutant VCP mouse, we did not see statistically significant evidence of efficacy in this proof of concept patient trial