LEIBNIZ\u2019S MIRROR THESIS. SOLIPSISM, PRIVATE PERSPECTIVES AND CONCEPTUAL HOLISM

One of the symbolic images to which Leibniz constantly entrusted the synthesis of his philosophy regards the idea of considering one and the same city from various visual perspectives. Such an image is diffused throughout all Leibniz\u2019s writings and clearly reflects the philosopher\u2019s interest for matters regarding perspective as well as optical phenomena. The point of view of its inhabitants can therefore be compared to a mirror that reflects some different portions of reality. But what do the city-viewers really see? Do they all see exactly the same thing? And assuming the plurality of points of view, how one can be sure that they share the same representative content? The paper presented here tries to offer a plausible interpretation of this topic also by linking different and somehow remote Leibnizian doctrines together

Cryptospores and cryptophytes reveal hidden diversity in early land floras

Cryptospores, recovered from Ordovician through Devonian rocks, differ from trilete spores in possessing distinctive configurations (i.e. hilate monads, dyads, and permanent tetrads). Their affinities are contentious, but knowledge of their relationships is essential to understanding the nature of the earliest land flora. This review brings together evidence about the source plants, mostly obtained from spores extracted from minute, fragmented, yet exceptionally anatomically preserved fossils. We coin the term ‘cryptophytes’ for plants that produced the cryptospores and show them to have been simple terrestrial organisms of short stature (i.e. millimetres high). Two lineages are currently recognized. Partitatheca shows a combination of characters (e.g. spo-rophyte bifurcation, stomata, and dyads) unknown in plants today. Lenticulatheca encompasses discoidal sporangia containing monads formed from dyads with ultrastructure closer to that of higher plants, as exemplified by Cooksonia. Other emerging groupings are less well characterized, and their precise affinities to living clades remain unclear. Some may be stem group embryophytes or tracheophytes. Others are more closely related to the bryophytes, but they are not bryophytes as defined by extant representatives. Cryptophytes encompass a pool of diversity from which modern bryophytes and vascular plants emerged, but were competitively replaced by early tracheophytes. Sporogenesis always produced either dyads or tetrads, indicating strict genetic control. The long-held consensus that tetrads were the archetypal condition in land plants is challenged

Polymonadic Programming

Monads are a popular tool for the working functional programmer to structure effectful computations. This paper presents polymonads, a generalization of monads. Polymonads give the familiar monadic bind the more general type forall a,b. L a -> (a -> M b) -> N b, to compose computations with three different kinds of effects, rather than just one. Polymonads subsume monads and parameterized monads, and can express other constructions, including precise type-and-effect systems and information flow tracking; more generally, polymonads correspond to Tate's productoid semantic model. We show how to equip a core language (called lambda-PM) with syntactic support for programming with polymonads. Type inference and elaboration in lambda-PM allows programmers to write polymonadic code directly in an ML-like syntax--our algorithms compute principal types and produce elaborated programs wherein the binds appear explicitly. Furthermore, we prove that the elaboration is coherent: no matter which (type-correct) binds are chosen, the elaborated program's semantics will be the same. Pleasingly, the inferred types are easy to read: the polymonad laws justify (sometimes dramatic) simplifications, but with no effect on a type's generality.Comment: In Proceedings MSFP 2014, arXiv:1406.153

Interleaving data and effects

The study of programming with and reasoning about inductive datatypes such as lists and trees has benefited from the simple categorical principle of initial algebras. In initial algebra semantics, each inductive datatype is represented by an initial f-algebra for an appropriate functor f. The initial algebra principle then supports the straightforward derivation of definitional principles and proof principles for these datatypes. This technique has been expanded to a whole methodology of structured functional programming, often called origami programming. In this article we show how to extend initial algebra semantics from pure inductive datatypes to inductive datatypes interleaved with computational effects. Inductive datatypes interleaved with effects arise naturally in many computational settings. For example, incrementally reading characters from a file generates a list of characters interleaved with input/output actions, and lazily constructed infinite values can be represented by pure data interleaved with the possibility of non-terminating computation. Straightforward application of initial algebra techniques to effectful datatypes leads either to unsound conclusions if we ignore the possibility of effects, or to unnecessarily complicated reasoning because the pure and effectful concerns must be considered simultaneously. We show how pure and effectful concerns can be separated using the abstraction of initial f-and-m-algebras, where the functor f describes the pure part of a datatype and the monad m describes the interleaved effects. Because initial f-and-m-algebras are the analogue for the effectful setting of initial f-algebras, they support the extension of the standard definitional and proof principles to the effectful setting. Initial f-and-m-algebras are originally due to Filinski and Støvring, who studied them in the category Cpo. They were subsequently generalised to arbitrary categories by Atkey, Ghani, Jacobs, and Johann in a FoSSaCS 2012 paper. In this article we aim to introduce the general concept of initial f-and-m-algebras to a general functional programming audience

Interleaving Data and Effects

The study of programming with and reasoning about inductive datatypes such as lists and trees has benefited from the simple categorical principle of initial algebras. In initial algebra semantics, each inductive datatype is represented by an initial f-algebra for an appropriate functor f. The initial algebra principle then supports the straightforward derivation of definitional principles and proof principles for these datatypes. This technique has been expanded to a whole methodology of structured functional programming, often called origami programming.In this article we show how to extend initial algebra semantics from pure inductive datatypes to inductive datatypes interleaved with computational effects. Inductive datatypes interleaved with effects arise naturally in many computational settings. For example, incrementally reading characters from a file generates a list of characters interleaved with input/output actions, and lazily constructed infinite values can be represented by pure data interleaved with the possibility of non-terminating computation. Straightforward application of initial algebra techniques to effectful datatypes leads either to unsound conclusions if we ignore the possibility of effects, or to unnecessarily complicated reasoning because the pure and effectful concerns must be considered simultaneously. We show how pure and effectful concerns can be separated using the abstraction of initial f-and-m-algebras, where the functor f describes the pure part of a datatype and the monad m describes the interleaved effects. Because initial f-and-m-algebras are the analogue for the effectful setting of initial f-algebras, they support the extension of the standard definitional and proof principles to the effectful setting. Initial f-and-m-algebras are originally due to Filinski and Støvring, who studied them in the category Cpo. They were subsequently generalised to arbitrary categories by Atkey, Ghani, Jacobs, and Johann in a FoSSaCS 2012 paper. In this article we aim to introduce the general concept of initial f-and-m-algebras to a general functional programming audience