Search

A modified Reissner-Nordstr\"om spacetime is considered here, where the central object (for example, a black hole or naked singularity) possesses a mass, with an ordinary, i.e., Standard Model (SM) electric charge, along with a dark electric charge associated with dark matter (DM). The inclusion of this dark charge modifies the gravitational properties of the spacetime, while not affecting ordinary electrodynamics. Geodesic motions of both charged and uncharged SM test particles are modified due to the presence of dark charge. The modifications may allow the detection and measurement of the dark charge. In particular, (1) the effective potential for orbiting particles is modified, and consequently, (2) the angular momenta and ISCOs of test masses in circular orbits are changed from those for the usual Reissner-Nordstr\"om case. (3) In the case of a naked singularity, it is possible that a "levitating atmosphere", due to short distance repulsive gravity, forms at the zero gravity radius, which depends upon both SM and DM charges. A levitating atmosphere may then cloak the naked singularity., Comment: 16 pages

We propose a novel approach to soundly combining linear types with effect handlers. Linear type systems statically ensure that resources such as file handles are used exactly once. Effect handlers provide a modular programming abstraction for implementing features ranging from exceptions to concurrency. Whereas linear type systems bake in the assumption that continuations are invoked exactly once, effect handlers allow continuations to be discarded or invoked more than once. This mismatch leads to soundness bugs in existing systems such as the programming language Links, which combines linearity (for session types) with effect handlers. We introduce control flow linearity as a means to ensure that continuations are used in accordance with the linearity of any resources they capture, ruling out such soundness bugs. We formalise control flow linearity in a System F-style core calculus Feffpop equipped with linear types, effect types, and effect handlers. We define a linearity-aware semantics to formally prove that Feffpop preserves the integrity of linear values in the sense that no linear value is discarded or duplicated. In order to show that control flow linearity can be made practical, we adapt Links based on the design of Feffpop, in doing so fixing a long-standing soundness bug. Finally, to better expose the potential of control flow linearity, we define an ML-style core calculus Qeffpop, based on qualified types, which requires no programmer provided annotations, and instead relies entirely on type inference to infer control flow linearity. Both linearity and effects are captured by qualified types. Qeffpop overcomes a number of practical limitations of Feffpop, supporting abstraction over linearity, linearity dependencies between type variables, and a much more fine-grained notion of control flow linearity., Comment: 51 pages, accepted for POPL 2024

We present a novel approach to generic programming over extensible data types. Row types capture the structure of records and variants, and can be used to express record and variant subtyping, record extension, and modular composition of case branches. We extend row typing to capture generic programming over rows themselves, capturing patterns including lifting operations to records and variations from their component types, and the duality between cases blocks over variants and records of labeled functions, without placing specific requirements on the fields or constructors present in the records and variants. We formalize our approach in System R{\omega}, an extension of F{\omega} with row types, and give a denotational semantics for (stratified) R{\omega} in Agda., Comment: To appear at: International Conference on Functional Programming 2023 Corrected citations from previous version