Fibrational induction meets effects

This paper provides several induction rules that can be used to prove properties of effectful data types. Our results are semantic in nature and build upon Hermida and Jacobs’ fibrational formulation of induction for polynomial data types and its extension to all inductive data types by Ghani, Johann, and Fumex. An effectful data type μ(TF) is built from a functor F that describes data, and a monad T that computes effects. Our main contribution is to derive induction rules that are generic over all functors F and monads T such that μ(TF) exists. Along the way, we also derive a principle of definition by structural recursion for effectful data types that is similarly generic. Our induction rule is also generic over the kinds of properties to be proved: like the work on which we build, we work in a general fibrational setting and so can accommodate very general notions of properties, rather than just those of particular syntactic forms. We give examples exploiting the generality of our results, and show how our results specialize to those in the literature, particularly those of Filinski and Støvring

On the twistor space of pseudo-spheres

We give a new proof that the sphere S^6 does not admit an integrable orthogonal complex structure, as in \cite{LeBrun}, following the methods from twistor theory. We present the twistor space of a pseudo-sphere S^{2n}_{2q}=SO_{2p+1,2q}/SO_{2p,2q} as a pseudo-K\"ahler symmetric space. We then consider orthogonal complex structures on the pseudo-sphere, only to prove such a structure cannot exist.Comment: Added the MSC's hoping Arxiv will "run" a better distribuition through Subj-class's. The article has 20 page

Automated verification of shape and size properties via separation logic.

Despite their popularity and importance, pointer-based programs remain a major challenge for program verification. In this paper, we propose an automated verification system that is concise, precise and expressive for ensuring the safety of pointer-based programs. Our approach uses user-definable shape predicates to allow programmers to describe a wide range of data structures with their associated size properties. To support automatic verification, we design a new entailment checking procedure that can handle well-founded inductive predicates using unfold/fold reasoning. We have proven the soundness and termination of our verification system, and have built a prototype system

New constructions of twistor lifts for harmonic maps

We show that given a harmonic map $\varphi$ from a Riemann surface to a classical compact simply connected inner symmetric space, there is a $J_2$-holomorphic twistor lift of $\varphi$ (or its negative) if and only if it is nilconformal. In the case of harmonic maps of finite uniton number, we give algebraic formulae in terms of holomorphic data which describes their extended solutions. In particular, this gives explicit formulae for the twistor lifts of all harmonic maps of finite uniton number from a surface to the above symmetric spaces.Comment: Some minor changes and a correction of Example 8.

Willmore Surfaces of Constant Moebius Curvature

We study Willmore surfaces of constant Moebius curvature $K$ in $S^4$. It is proved that such a surface in $S^3$ must be part of a minimal surface in $R^3$ or the Clifford torus. Another result in this paper is that an isotropic surface (hence also Willmore) in $S^4$ of constant $K$ could only be part of a complex curve in $C^2\cong R^4$ or the Veronese 2-sphere in $S^4$. It is conjectured that they are the only examples possible. The main ingredients of the proofs are over-determined systems and isoparametric functions.Comment: 16 pages. Mistakes occured in the proof to the main theorem (Thm 3.6) has been correcte

Localized induction equation and pseudospherical surfaces

We describe a close connection between the localized induction equation hierarchy of integrable evolution equations on space curves, and surfaces of constant negative Gauss curvature.Comment: 21 pages, AMSTeX file. To appear in Journal of Physics A: Mathematical and Genera

Hybridization of institutions

Extended version including all proofsModal logics are successfully used as specification logics for reactive systems. However, they are not expressive enough to refer to individual states and reason about the local behaviour of such systems. This limitation is overcome in hybrid logics which introduce special symbols for naming states in models. Actually, hybrid logics have recently regained interest, resulting in a number of new results and techniques as well as applications to software specification. In this context, the first contribution of this paper is an attempt to ‘universalize’ the hybridization idea. Following the lines of [DS07], where a method to modalize arbitrary institutions is presented, the paper introduces a method to hybridize logics at the same institution-independent level. The method extends arbitrary institutions with Kripke semantics (for multi-modalities with arbitrary arities) and hybrid features. This paves the ground for a general result: any encoding (expressed as comorphism) from an arbitrary institution to first order logic (FOL) deter- mines a comorphism from its hybridization to FOL. This second contribution opens the possibility of effective tool support to specification languages based upon logics with hybrid features.Fundação para a Ciência e a Tecnologia (FCT