Unbounded Recursion in Two Dimensions, Where Syntax and Prosody Meet

Both syntax and prosody seem to require structures with unbounded branching, something that is not immediately provided by multiple context free grammars or other equivalently expressive formalisms. That extension is easy, and does not disrupt an appealing model of prosody/syntax interaction. Rather than computing prosodic and syntactic structures independently and then selecting optimally corresponding pairs, prosodic structures can be computed directly from the syntax, eliminating alignment issues and the need for bracket-insertion or other ad hoc devices. To illustrate, a simple model of prosodically-defined Irish pronoun displacement is briefly compared to previous proposals

Proceedings of JAC 2010. Journées Automates Cellulaires

The second Symposium on Cellular Automata “Journ´ees Automates Cellulaires” (JAC 2010) took place in Turku, Finland, on December 15-17, 2010. The first two conference days were held in the Educarium building of the University of Turku, while the talks of the third day were given onboard passenger ferry boats in the beautiful Turku archipelago, along the route Turku–Mariehamn–Turku. The conference was organized by FUNDIM, the Fundamentals of Computing and Discrete Mathematics research center at the mathematics department of the University of Turku. The program of the conference included 17 submitted papers that were selected by the international program committee, based on three peer reviews of each paper. These papers form the core of these proceedings. I want to thank the members of the program committee and the external referees for the excellent work that have done in choosing the papers to be presented in the conference. In addition to the submitted papers, the program of JAC 2010 included four distinguished invited speakers: Michel Coornaert (Universit´e de Strasbourg, France), Bruno Durand (Universit´e de Provence, Marseille, France), Dora Giammarresi (Universit` a di Roma Tor Vergata, Italy) and Martin Kutrib (Universit¨at Gie_en, Germany). I sincerely thank the invited speakers for accepting our invitation to come and give a plenary talk in the conference. The invited talk by Bruno Durand was eventually given by his co-author Alexander Shen, and I thank him for accepting to make the presentation with a short notice. Abstracts or extended abstracts of the invited presentations appear in the first part of this volume. The program also included several informal presentations describing very recent developments and ongoing research projects. I wish to thank all the speakers for their contribution to the success of the symposium. I also would like to thank the sponsors and our collaborators: the Finnish Academy of Science and Letters, the French National Research Agency project EMC (ANR-09-BLAN-0164), Turku Centre for Computer Science, the University of Turku, and Centro Hotel. Finally, I sincerely thank the members of the local organizing committee for making the conference possible. These proceedings are published both in an electronic format and in print. The electronic proceedings are available on the electronic repository HAL, managed by several French research agencies. The printed version is published in the general publications series of TUCS, Turku Centre for Computer Science. We thank both HAL and TUCS for accepting to publish the proceedings.Siirretty Doriast

Binding Phenomena Within A Reductionist Theory of Grammatical Dependencies

This thesis investigates the implications of binding phenomena for the development of a reductionist theory of grammatical dependencies. The starting point is the analysis of binding and control in Hornstein (2001, 2009). A number of revisions are made to this framework in order to develop a simpler and empirically more successful account of binding phenomena. The major development is the rejection of economy-based accounts of Condition B effects. It is argued that Condition B effects derive directly from an anti-locality constraint on A-movement. Competition between different dependency types is crucial to the analysis, but is formulated in terms of a heavily revised version of Reinhart's (2006) "No Sneaking" principle, rather than in terms of a simple economy preference for local over non-local dependencies. In contrast to Reinhart's No Sneaking, the condition presented here ("Keeping Up Appearances") has a phonologically rather than semantically specified comparison set. A key claim of the thesis is that the morphology of pronouns and reflexives is of little direct grammatical import. It is argued that much of the complexity of the contemporary binding literature derives from the attempt to capture the distribution of pronouns and reflexives in largely, or purely, syntactic and semantic terms. The analysis presented in this dissertation assigns a larger role to language-specific "spellout" rules, and to general pragmatic/interpretative principles governing the choice between competing morphemes. Thus, a core assumption of binding theory from LGB onwards is rejected: there is no syntactic theory which accounts for the distribution of pronouns and reflexives. Rather, there is a core theory of grammatical dependencies which must be conjoined with with phonological, morphological and pragmatic principles to yield the distributional facts in any given language. In this respect, the approach of the thesis is strictly non-lexicalist: there are no special lexical items which trigger certain kinds of grammatical dependency. All non-strictly-local grammatical dependencies are formed via A- or A-chains, and copies in these chains are pronounced according to a mix of universal principles and language-specific rules. The broader goal of the thesis is to further the prospects for a "reductionist" approach to grammatical dependencies along these lines. The most detailed empirical component of the thesis is an investigation of the problem posed by binding out of prepositional phrases. Even in a framework incorporating sideward movement, the apparent lack of c-command in this configuration poses a problem. Chapter 3 attempts to revive a variant of the traditional "reanalysis" account of binding out of PP. This segues into an investigation of certain properties of pseudopassivization and preposition stranding. The analyses in this thesis are stated within an informal syntactic framework. However, in order to investigate the precise implications of a particular economy condition, Merge over Move, a partial formalization of this framework is developed in chapter 4. This permits the economy condition to be stated precisely, and in a manner which does not have adverse implications for computational complexity

Programming Languages and Systems

This open access book constitutes the proceedings of the 29th European Symposium on Programming, ESOP 2020, which was planned to take place in Dublin, Ireland, in April 2020, as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. The actual ETAPS 2020 meeting was postponed due to the Corona pandemic. The papers deal with fundamental issues in the specification, design, analysis, and implementation of programming languages and systems

Safe Programming Over Distributed Streams

The sheer scale of today\u27s data processing needs has led to a new paradigm of software systems centered around requirements for high-throughput, distributed, low-latency computation.Despite their widespread adoption, existing solutions have yet to provide a programming model with safe semantics -- and they disagree on basic design choices, in particular with their approach to parallelism. As a result, naive programmers are easily led to introduce correctness and performance bugs. This work proposes a reliable programming model for modern distributed stream processing, founded in a type system for partially ordered data streams. On top of the core type system, we propose language abstractions for working with streams -- mechanisms to build stream operators with (1) type-safe compositionality, (2) deterministic distribution, (3) run-time testing, and (4) static performance bounds. Our thesis is that viewing streams as partially ordered conveniently exposes parallelism without compromising safety or determinism. The ideas contained in this work are implemented in a series of open source software projects, including the Flumina, DiffStream, and Data Transducers libraries